On the number of Criteria Needed to Decide Pareto Optimality

  • In this paper we prove a reduction result for the number of criteria in convex multiobjective optimization. This result states that to decide wheter a point x in the decision space is pareto optimal it suffices to consider at most n? criteria at a time, where n is the dimension of the decision space. The main theorem is based on a geometric characterization of pareto, strict pareto and weak pareto solutions

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Matthias Ehrgott, Stefan Nickel
URN:urn:nbn:de:hbz:386-kluedo-4617
Series (Serial Number):Report in Wirtschaftsmathematik (WIMA Report) (2)
Document Type:Preprint
Language of publication:English
Year of Completion:1999
Year of first Publication:1999
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):2000/04/03
Faculties / Organisational entities:Kaiserslautern - Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011