Combining discrete and continuous information for multi-criteria optimization problems
Authors:
Open Access
- 23 February 2024
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (1) , 153-173
Abstract
In multi-criteria optimization problems that originate from real-world decision making tasks, we often find the following structure: There is an underlying continuous, possibly even convex model for the multiple outcome measures depending on the design variables, but these outcomes are additionally assigned to discrete categories according to their desirability for the decision maker. Multi-criteria deliberations may then take place at the level of these discrete labels, while the calculation of a specific design remains a continuous problem. In this work, we analyze this type of problem and provide theoretical results about its solution set. We prove that the discrete decision problem can be tackled by solving scalarizations of the underlying continuous model. Based on our analysis we propose multiple algorithmic approaches that are specifically suited to handle these problems. We compare the algorithms based on a set of test problems. Furthermore, we apply our methods to a real-world radiotherapy planning example.Keywords
Funding Information
- Fraunhofer-Institut für Techno- und Wirtschaftsmathematik ITWM
This publication has 15 references indexed in Scilit:
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizationsEuropean Journal of Operational Research, 2018
- Scalarizations for adaptively solving multi-objective optimization problemsComputational Optimization and Applications, 2007
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- Intensity-modulated radiotherapy - a large scale multi-criteria programming problemOR Spectrum, 2003
- Unbiased approximation in multicriteria optimizationMathematical Methods of Operations Research, 2003
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programmingMathematical Programming, 2000
- Towards finding global representations of the efficient set in multiple objective mathematical programmingNaval Research Logistics (NRL), 1997
- Multi‐objective combinatorial optimization problems: A surveyJournal of Multi-Criteria Decision Analysis, 1994
- Scalarizing vector optimization problemsJournal of Optimization Theory and Applications, 1984
- An interactive weighted Tchebycheff procedure for multiple objective programmingMathematical Programming, 1983