Representing the Non-dominated Set of Multi-objective Optimization Problems with Polyhedral Ordering Cones
Year: 2026
Type: preprint
Abstract: In the literature, research on representing the non-dominated set has focused almost exclusively on multi-objective optimization problems with Pareto-dominance. However, general ordering cones are used to incorporate preferences of decision makers into the optimization process and to model other specific types of optimization problems, such as ordinal optimization problems. In this work, we consider several representation approaches based on representation relations in the context of multi-objective optimization problems with polyhedral ordering cones. Our main research question is whether existing theory and solution approaches developed for the Pareto case can be used to address the more general setting.
Source: arXiv (Cornell University)
Authors: Weuste, Chiara, Stiglmayr, Michael
Institution: University of Wuppertal
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221505279