IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v151y2003i1p119-139.html
   My bibliography  Save this article

Computation of ideal and Nadir values and implications for their use in MCDM methods

Author

Listed:
  • Ehrgott, Matthias
  • Tenfelde-Podehl, Dagmar

Abstract

No abstract is available for this item.

Suggested Citation

  • Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
  • Handle: RePEc:eee:ejores:v:151:y:2003:i:1:p:119-139
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00595-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    Full references (including those not matched with items on IDEAS)

    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.
    1. 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.
    2. A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Lipovetsky, S. & Lootsma, F. A., 2000. "Generalized golden sections, repeated bisections and aesthetic pleasure," European Journal of Operational Research, Elsevier, vol. 121(1), pages 213-216, February.
    16. Cristina Requejo & Eulália Santos, 2020. "Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms," Operational Research, Springer, vol. 20(4), pages 2467-2495, December.
    17. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    18. Serpil Say{i}n & Panos Kouvelis, 2005. "The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm," Management Science, INFORMS, vol. 51(10), pages 1572-1581, October.
    19. Mumtaz Karatas, 2017. "Multiattribute Decision Making Using Multiperiod Probabilistic Weighted Fuzzy Axiomatic Design," Systems Engineering, John Wiley & Sons, vol. 20(4), pages 318-334, July.
    20. Henri Bonnel & C. Yalçın Kaya, 2010. "Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 147(1), pages 93-112, October.

    More about this item

    Statistics

    Access and download statistics

    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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.