6533b82cfe1ef96bd128edad

RESEARCH PRODUCT

PAINT : Pareto front interpolation for nonlinear multiobjective optimization

Markus HartikainenKaisa MiettinenMargaret M. Wiecek

subject

Pareto optimalityMathematical optimizationMatematikControl and OptimizationApplied MathematicsComputationally expensive problemsMulti-objective optimizationmonitavoiteoptimointiSet (abstract data type)Computational MathematicsPareto optimalNonlinear systemMultiobjective optimization problemapproksimaatioPareto-optimaalisuusapproksimointiAlgorithmApproximationMathematicsInterpolationMathematicsInteger (computer science)Multiobjective optimizationInteractive decision making

description

A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive method is fast with the surrogate problem even though the problem is computationally expensive. Numerical examples of applying the PAINT method for interpolation are included. QC 20220131

yearjournalcountryeditionlanguage
2011-10-18
10.1007/s10589-011-9441-zhttp://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-65275