Computation of ideal and Nadir values and implications for their use in MCDM methods
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- Horst, Reiner & Thoai, Nguyen V., 1999. "Maximizing a concave function over the efficient or weakly-efficient set," European Journal of Operational Research, Elsevier, vol. 117(2), pages 239-252, September.
- Kok, M. & Lootsma, F. A., 1985. "Pairwise-comparison methods in multiple objective programming, with applications in a long-term energy-planning model," European Journal of Operational Research, Elsevier, vol. 22(1), pages 44-55, October.
- Namorado Climaco, Joao Carlos & Queiros Vieira Martins, Ernesto, 1982. "A bicriterion shortest path algorithm," European Journal of Operational Research, Elsevier, vol. 11(4), pages 399-404, December.
- Pekka Korhonen & Seppo Salo & Ralph E. Steuer, 1997. "A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming," Operations Research, INFORMS, vol. 45(5), pages 751-757, October.
- Solanki, Rajendra S. & Appino, Perry A. & Cohon, Jared L., 1993. "Approximating the noninferior set in multiobjective linear programming problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 356-373, August.
- R. Horst & N. V. Thoai, 1997. "Utility Function Programs and Optimization over the Efficient Set in Multiple-Objective Decision Making," Journal of Optimization Theory and Applications, Springer, vol. 92(3), pages 605-631, March.
- Lee, Haijune & Simin Pulat, P., 1993. "Bicriteria network flow problems: Integer case," European Journal of Operational Research, Elsevier, vol. 66(1), pages 148-157, April.
- Reeves, Gary R. & Reid, Randall C., 1988. "Minimum values over the efficient set in multiple objective decision making," European Journal of Operational Research, Elsevier, vol. 36(3), pages 334-338, September.
- Ramos, R. M. & Alonso, S. & Sicilia, J. & Gonzalez, C., 1998. "The problem of the optimal biobjective spanning tree," European Journal of Operational Research, Elsevier, vol. 111(3), pages 617-628, December.
- E. U. Choo & D. R. Atkins, 1983. "Proper Efficiency in Nonconvex Multicriteria Programming," Mathematics of Operations Research, INFORMS, vol. 8(3), pages 467-470, August.
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.- Ehrgott, Matthias & Skriver, Anders J. V., 2003. "Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach," European Journal of Operational Research, Elsevier, vol. 147(3), pages 657-664, June.
- A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
- Thoai, Nguyen V., 2000. "A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem," European Journal of Operational Research, Elsevier, vol. 122(1), pages 58-68, April.
- Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
- Alves, Maria João & Costa, João Paulo, 2009. "An exact method for computing the nadir values in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 198(2), pages 637-646, October.
- Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
- Gomes da Silva, Carlos & Figueira, Jose & Climaco, Joao, 2007. "Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1656-1677, March.
- R. Horst & N. V. Thoai & Y. Yamamoto & D. Zenke, 2007. "On Optimization over the Efficient Set in Linear Multicriteria Programming," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 433-443, September.
- Le Thi, Hoai An & Pham, Dinh Tao & Thoai, Nguyen V., 2002. "Combination between global and local methods for solving an optimization problem over the efficient set," European Journal of Operational Research, Elsevier, vol. 142(2), pages 258-270, October.
- Steuer, Ralph E. & Piercy, Craig A., 2005. "A regression study of the number of efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 162(2), pages 484-496, April.
- Tu, Ta Van, 2000. "Optimization over the efficient set of a parametric multiple objective linear programming problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 570-583, May.
- Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
- Simon Pezzutto & Gianluca Grilli & Stefano Zambotti & Stefan Dunjic, 2018. "Forecasting Electricity Market Price for End Users in EU28 until 2020—Main Factors of Influence," Energies, MDPI, vol. 11(6), pages 1-18, June.
- Murat Köksalan & Banu Lokman, 2015. "Finding nadir points in multi-objective integer programs," Journal of Global Optimization, Springer, vol. 62(1), pages 55-77, May.
- Zanakis, Stelios H. & Mandakovic, Tomislav & Gupta, Sushil K. & Sahay, Sundeep & Hong, Sungwan, 1995. "A review of program evaluation and fund allocation methods within the service and government sectors," Socio-Economic Planning Sciences, Elsevier, vol. 29(1), pages 59-79, March.
- Erjiang Sun, 2017. "On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 236-246, January.
- Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
- Ngwenyama, Ojelanki K. & Bryson, Noel, 1999. "Eliciting and mapping qualitative preferences to numeric rankings in group decision making," European Journal of Operational Research, Elsevier, vol. 116(3), pages 487-497, August.
- Murat Köksalan & Banu Lokman, 2009. "Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 191-198, March.
- G Mavrotas & E Georgopoulou & S Mirasgedis & Y Sarafidis & D Lalas & V Hontou & N Gakis, 2009. "Multi-objective combinatorial optimization for selecting best available techniques (BAT) in the industrial sector: the COMBAT tool," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 906-920, July.
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:151:y:2003:i:1:p:119-139. 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.