Use of reference points for solving MONLP problems
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Erkut, Erhan & Neuman, Susan, 1989. "Analytical models for locating undesirable facilities," European Journal of Operational Research, Elsevier, vol. 40(3), pages 275-291, June.
- Plastria, Frank, 1987. "Solving general continuous single facility location problems by cutting planes," European Journal of Operational Research, Elsevier, vol. 29(1), pages 98-110, April.
- Nakayama, Hirotaka, 1992. "Trade-off analysis using parametric optimization techniques," European Journal of Operational Research, Elsevier, vol. 60(1), pages 87-98, July.
- Gerald W. Evans, 1984. "An Overview of Techniques for Solving Multiobjective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1268-1282, November.
- Korhonen, Pekka J. & Laakso, Jukka, 1986. "A visual interactive method for solving the multiple criteria problem," European Journal of Operational Research, Elsevier, vol. 24(2), pages 277-287, February.
- Aneja, Y. P. & Chandrasekaran, R. & Nair, K. P. K., 1988. "A note on the m-center problem with rectilinear distances," European Journal of Operational Research, Elsevier, vol. 35(1), pages 118-123, April.
- Metev, Boyan & Yordanova, Irena, 1993. "Use of reference points for MOLP problems analysis," European Journal of Operational Research, Elsevier, vol. 68(3), pages 374-378, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Metev, Boyan S. & Yordanova-Markova, Irena T., 1997. "Multi-objective optimization over convex disjunctive feasible sets using reference points," European Journal of Operational Research, Elsevier, vol. 98(1), pages 124-137, April.
- Metev, Boyan & Gueorguieva, Dessislava, 2000. "A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems," European Journal of Operational Research, Elsevier, vol. 126(2), pages 386-390, October.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Kaliszewski, Ignacy & Michalowski, Wojtek, 1999. "Searching for psychologically stable solutions of multiple criteria decision problems," European Journal of Operational Research, Elsevier, vol. 118(3), pages 549-562, November.
- Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
- Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
- Pekka Korhonen & Jyrki Wallenius, 1988. "A pareto race," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(6), pages 615-623, December.
- Metev, Boyan S. & Yordanova-Markova, Irena T., 1997. "Multi-objective optimization over convex disjunctive feasible sets using reference points," European Journal of Operational Research, Elsevier, vol. 98(1), pages 124-137, April.
- A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
- Thomas L. Saaty, 2013. "The Modern Science of Multicriteria Decision Making and Its Practical Applications: The AHP/ANP Approach," Operations Research, INFORMS, vol. 61(5), pages 1101-1118, October.
- Francisco J. André & Laura Riesgo, 2006. "A Duality Procedure to Elicit Nonlinear Multiattribute Utility Functions," Working Papers 06.02, Universidad Pablo de Olavide, Department of Economics.
- Büsing, Christina & Goetzmann, Kai-Simon & Matuschke, Jannik & Stiller, Sebastian, 2017. "Reference points and approximation algorithms in multicriteria discrete optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 829-840.
- Murat Köksalan & Ceren Tuncer Şakar, 2016. "An interactive approach to stochastic programming-based portfolio optimization," Annals of Operations Research, Springer, vol. 245(1), pages 47-66, October.
- J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
- Arbel, Ami & Korhonen, Pekka, 2001.
"Using objective values to start multiple objective linear programming algorithms,"
European Journal of Operational Research, Elsevier, vol. 128(3), pages 587-596, February.
- A. Arbel & P. Korhonen, 1998. "Using Objective Values to Start Multiple Objective Linear Programming Algorithms," Working Papers ir98066, International Institute for Applied Systems Analysis.
- Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
- Romero-Morales, Dolores & Carrizosa, Emilio & Conde, Eduardo, 1997. "Semi-obnoxious location models: A global optimization approach," European Journal of Operational Research, Elsevier, vol. 102(2), pages 295-301, October.
- Ruiz, Francisco & Luque, Mariano & Miguel, Francisca & del Mar Munoz, Maria, 2008. "An additive achievement scalarizing function for multiobjective programming problems," European Journal of Operational Research, Elsevier, vol. 188(3), pages 683-694, August.
- Daniel P. Loucks & László Somlyódy, 1986. "Multiobjective Assessment of Multipurpose Water Resources Projects for Developing Countries," Natural Resources Forum, Blackwell Publishing, vol. 10(1), pages 61-75, February.
- Aringhieri, Roberto & Cordone, Roberto & Grosso, Andrea, 2015. "Construction and improvement algorithms for dispersion problems," European Journal of Operational Research, Elsevier, vol. 242(1), pages 21-33.
- Lili Mei & Deshi Ye & Yong Zhang, 2018. "Approximation strategy-proof mechanisms for obnoxious facility location on a line," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 549-571, August.
- Aouni, Belaid & Kettani, Ossama, 2001. "Goal programming model: A glorious history and a promising future," European Journal of Operational Research, Elsevier, vol. 133(2), pages 225-231, January.
- H. P. Benson & E. Sun, 2000. "Outcome Space Partition of the Weight Set in Multiobjective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 17-36, April.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:80:y:1995:i:1:p:193-203. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.