Constructing a Pareto front approximation for decision making
Abstract
An approach to constructing a Pareto front approximation to computationally expensive multiobjective optimization problems is developed. The approximation is constructed as a sub-complex of a Delaunay triangulation of a finite set of Pareto optimal outcomes to the problem. The approach is based on the concept of inherent nondominance. Rules for checking the inherent nondominance of complexes are developed and applying the rules is demonstrated with examples. The quality of the approximation is quantified with error estimates. Due to its properties, the Pareto front approximation works as a surrogate to the original problem for decision making with interactive methods.
Main Authors
Format
Articles
Research article
Published
2011
Series
Subjects
Publication in research information system
Publisher
SpringerLink
The permanent address of the publication
https://urn.fi/URN:NBN:fi:jyu-201607283689Käytä tätä linkitykseen.
Review status
Peer reviewed
ISSN
1432-2994
DOI
https://doi.org/10.1007/s00186-010-0343-0
Language
English
Published in
Mathematical Methods of Operations Research
Citation
- Hartikainen, M., Miettinen, K., & Wiecek, M. M. (2011). Constructing a Pareto front approximation for decision making. Mathematical Methods of Operations Research, 73(2), 209-234. https://doi.org/10.1007/s00186-010-0343-0
License
Copyright© 2011 Springer