Showing math.OCShow all
2 papers · 1 filter
math.OC2023
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems
Stephan Helfrich, Stefan Ruzika, Clemens Thielen
Convex approximation sets for multiobjective optimization problems are a well-studied relaxation of the common notion of approximation sets. Instead of approximating each image of…
math.OC2023
Using Scalarizations for the Approximation of Multiobjective Optimization Problems: Towards a General Theory
Stephan Helfrich, Arne Herzel, Stefan Ruzika +1
We study the approximation of general multiobjective optimization problems with the help of scalarizations. Existing results state that multiobjective minimization problems can be…