Multi-objective optimization with convex quadratic cost functions: A multi-parametric programming approach
2016
Abstract 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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
17
Citations
NaN
KQI