Constructing a Pareto front approximation for decision making
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
Julkaistu sarjassa
Mathematical Methods of Operations ResearchPäivämäärä
2011Tekijänoikeudet
© 2011 Springer
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.
Julkaisija
SpringerLinkISSN Hae Julkaisufoorumista
1432-2994Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/20340485
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Approximation method for computationally expensive nonconvex multiobjective optimization problems
Haanpää, Tomi (University of Jyväskylä, 2012) -
Why Use Interactive Multi-Objective Optimization in Chemical Process Design?
Miettinen, Kaisa; Hakanen, Jussi (World Scientific, 2017)Problems in chemical engineering, like most real-world optimization problems, typically, have several conflicting performance criteria or objectives and they often are computationally demanding, which sets special requirements ... -
Why Use Interactive Multi-Objective Optimization in Chemical Process Design?
Miettinen, Kaisa; Hakanen, Jussi (World Scientific, 2009)Problems in chemical engineering, like most real-world optimization problems, typically, have several conflicting performance criteria or objectives and they often are computationally demanding, which sets special requirements ... -
Approximation through interpolation in nonconvex multiobjective optimization
Hartikainen, Markus (University of Jyväskylä, 2011) -
Interactive Multiobjective Robust Optimization with NIMBUS
Zhou-Kangas, Yue; Miettinen, Kaisa; Sindhya, Karthik (Springer, 2018)In this paper, we introduce the MuRO-NIMBUS method for solving multiobjective optimization problems with uncertain parameters. The concept of set-based minmax robust Pareto optimality is utilized to tackle the uncertainty ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.