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 search for a different version of it.

    References listed on IDEAS

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Luque, Mariano & Ruiz, Francisco & Steuer, Ralph E., 2010. "Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming," European Journal of Operational Research, Elsevier, vol. 204(3), pages 557-564, August.
    2. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    3. Jornada, Daniel & Leon, V. Jorge, 2016. "Biobjective robust optimization over the efficient set for Pareto set reduction," European Journal of Operational Research, Elsevier, vol. 252(2), pages 573-586.
    4. repec:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602577 is not listed on IDEAS
    5. Tipparat Pongthanapanich, 2005. "Options and Tradeoffs in Krabi's Coastal Land Use," Working Papers 66/2005, University of Southern Denmark, Department of Sociology, Environmental and Business Economics.
    6. Miettinen, Kaisa & Eskelinen, Petri & Ruiz, Francisco & Luque, Mariano, 2010. "NAUTILUS method: An interactive technique in multiobjective optimization based on the nadir point," European Journal of Operational Research, Elsevier, vol. 206(2), pages 426-434, October.
    7. Kirlik, Gokhan & Sayın, Serpil, 2014. "A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 479-488.
    8. 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.
    9. Dhaenens, C. & Lemesre, J. & Talbi, E.G., 2010. "K-PPM: A new exact method to solve multi-objective combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 200(1), pages 45-53, January.
    10. repec:spr:jglopt:v:69:y:2017:i:3:d:10.1007_s10898-017-0534-9 is not listed on IDEAS
    11. 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.
    12. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "A new method for optimizing a linear function over the efficient set of a multiobjective integer program," European Journal of Operational Research, Elsevier, vol. 260(3), pages 904-919.
    13. Pérez-Moreno, Salvador & Rodríguez, Beatriz & Luque, Mariano, 2016. "Assessing global competitiveness under multi-criteria perspective," Economic Modelling, Elsevier, vol. 53(C), pages 398-408.
    14. O. D. Marcenaro-Gutierrez & M. Luque & L. A. Lopez-Agudo, 2016. "Balancing Teachers’ Math Satisfaction and Other Indicators of the Education System’s Performance," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 129(3), pages 1319-1348, December.
    15. Ana Ruiz & Rubén Saborido & Mariano Luque, 2015. "A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm," Journal of Global Optimization, Springer, vol. 62(1), pages 101-129, May.
    16. Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.
    17. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    18. Weihua Zhang & Marc Reimann, 2014. "Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 591-622, December.
    19. Luque, Mariano & Miettinen, Kaisa & Eskelinen, Petri & Ruiz, Francisco, 2009. "Incorporating preference information in interactive reference point methods for multiobjective optimization," Omega, Elsevier, vol. 37(2), pages 450-462, April.
    20. Gokhan Kirlik & Serpil Sayın, 2015. "Computing the nadir point for multiobjective discrete optimization problems," Journal of Global Optimization, Springer, vol. 62(1), pages 79-99, May.

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.