On the Number of Criteria Needed to Decide Pareto Optimality

  • 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 a generalization to strictly Pareto optimal solutions is impossible, even in the convex case.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Matthias Ehrgott, Stefan Nickel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-10682
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (61)
Document Type:Preprint
Language of publication:English
Year of Completion:2000
Year of Publication:2000
Publishing Institute:Technische Universität Kaiserslautern
Tag:Multicriteria optimization ; Pareto optimality ; number of objectives; strictly quasi-convex functions
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $