Multi-objective optimization with convex quadratic cost functions: A multi-parametric programming approach
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
2015 Elsevier Ltd. In this note we present an approximate algorithm for the explicit calculation of the Pareto front for multi-objective optimization problems featuring convex quadratic cost functions and linear constraints based on multi-parametric programming and employing a set of suitable overestimators with tunable suboptimality. A numerical example as well as a small computational study highlight the features of the novel algorithm.