Constructing a Pareto front approximation for decision making
2011 (English)In: Mathematical Methods of Operations Research, ISSN 1432-2994, E-ISSN 1432-5217, Vol. 73, no 2, 209-234 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2011. Vol. 73, no 2, 209-234 p.
Multiobjective optimization; Multiple criteria decision making; Pareto optimality; Interactive decision making; Interpolation; Delaunay triangulation
IdentifiersURN: urn:nbn:se:kth:diva-66391DOI: 10.1007/s00186-010-0343-0ISI: 000291041000004OAI: oai:DiVA.org:kth-66391DiVA: diva2:483910
Qc 201201272012-01-272012-01-262012-02-12Bibliographically approved