To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Approximating the Pareto … - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Approximating the Pareto Optimal Set using a Reduced Set of Objective Functions

Journal article
Authors Peter Lindroth
Michael Patriksson
Ann-Brith Strömberg
Published in European Journal of Operational Research
Volume 207
Issue 3
Pages 1519-1534
ISSN 0377-2217
Publication year 2010
Published at Department of Mathematical Sciences, Mathematics
Pages 1519-1534
Language en
Subject categories Optimization, systems theory


Real-world applications of multi-objective optimization often involve numerous objective functions. But while such problems are in general computationally intractable, it is seldom necessary to determine the Pareto optimal set exactly. A significantly smaller computational burden thus motivates the loss of precision if the size of the loss can be estimated. We describe a method for finding an optimal reduction of the set of objectives yielding a smaller problem whose Pareto optimal set w.r.t. a discrete subset of the decision space is as close as possible to that of the original set of objectives. Utilizing a new characterization of Pareto optimality and presuming a finite decision space, we derive a program whose solution represents an optimal reduction. We also propose an approximate, computationally less demanding formulation which utilizes correlations between the objectives and separates into two parts. Numerical results from an industrial instance concerning the configuration of heavy-duty trucks are also reported, demonstrating the usefulness of the method developed. The results show that multi-objective optimization problems can be significantly simplified with an induced error which can be measured.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?