IDEAS home Printed from https://ideas.repec.org/a/spr/anresc/v55y2002i3p329-345.html
   My bibliography  Save this article

On the number of criteria needed to decide Pareto optimality

Author

Listed:
  • Matthias Ehrgott
  • Stefan Nickel

Abstract

In this paper we address the question of how many objective functions are needed to decide whether a given point is a Pareto optimal solution for a multicriteria optimization problem. We extend earlier results showing that the set of weakly Pareto optimal points is the union of Pareto optimal sets of subproblems and show their limitations. We prove that for strictly quasi-convex problems in two variables Pareto optimality can be decided by consideration of at most three objectives at a time. Our results are based on a geometric characterization of Pareto, strict Pareto, and weak Pareto solutions and Helly's Theorem. We also show that a generalization to quasi-convex objectives is not possible and state a weaker result for this case. Furthermore, we show that an analogous result for deciding strict Pareto optimality is impossible, even in the convex case. Copyright Springer-Verlag Berlin Heidelberg 2002

Suggested Citation

  • Matthias Ehrgott & Stefan Nickel, 2002. "On the number of criteria needed to decide Pareto optimality," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 55(3), pages 329-345, June.
    • Handle: RePEc:spr:anresc:v:55:y:2002:i:3:p:329-345
    DOI: 10.1007/s001860200207
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860200207
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860200207?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Alzorba, Shaghaf & Günther, Christian & Popovici, Nicolae & Tammer, Christiane, 2017. "A new algorithm for solving planar multiobjective location problems involving the Manhattan norm," European Journal of Operational Research, Elsevier, vol. 258(1), pages 35-46.
    2. Naoki Hamada & Shunsuke Ichiki, 2022. "Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 248-270, January.
    3. Lindroth, Peter & Patriksson, Michael & Strömberg, Ann-Brith, 2010. "Approximating the Pareto optimal set using a reduced set of objective functions," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1519-1534, December.
    4. Alexander Engau & Margaret M. Wiecek, 2008. "Interactive Coordination of Objective Decompositions in Multiobjective Programming," Management Science, INFORMS, vol. 54(7), pages 1350-1363, July.
    5. Frank Plastria, 2020. "On the Structure of the Weakly Efficient Set for Quasiconvex Vector Minimization," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 547-564, February.
    6. Melissa Gardenghi & Trinidad Gómez & Francisca Miguel & Margaret M. Wiecek, 2011. "Algebra of Efficient Sets for Multiobjective Complex Systems," Journal of Optimization Theory and Applications, Springer, vol. 149(2), pages 385-410, May.
    7. Engau, Alexander, 2009. "Tradeoff-based decomposition and decision-making in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 199(3), pages 883-891, December.

    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:spr:anresc:v:55:y:2002:i:3:p:329-345. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.