On the number of criteria needed to decide Pareto optimality

DOI10.1007/s001860200207zbMath1031.90030OpenAlexW2167953919MaRDI QIDQ1397062

Matthias Ehrgott, Stefan Nickel

Publication date: 16 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-10682

zbMATH Keywords

Pareto optimalityquasi-convex functionsMulticriteria optimizationnumber of objectives

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (12)

ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization ⋮ Multiobjective optimization, scalarization, and maximal elements of preorders ⋮ Approximating the Pareto optimal set using a reduced set of objective functions ⋮ A new algorithm for solving planar multiobjective location problems involving the Manhattan norm ⋮ Robustness in the Pareto-solutions for the multi-criteria minisum location problem ⋮ Algebra of efficient sets for multiobjective complex systems ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ Involving the Helly number in Pareto reducibility ⋮ On the structure of the weakly efficient set for quasiconvex vector minimization ⋮ Free disposal hull condition to verify when efficiency coincides with weak efficiency ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming ⋮ A special class of extended multicriteria location problems

This page was built for publication: On the number of criteria needed to decide Pareto optimality