Local Pareto approximation for multi-objective optimization

Abstract

The design process of complex systems often resorts to solving an optimization problem, which involves different disciplines and where all design criteria have to be optimized simultaneously. Mathematically, this problem can be reduced to a vector optimization problem. The solution of this problem is not unique and is represented by a Pareto surface in the objective function space. Once a Pareto solution is obtained, it may be very useful for the decision-maker to be able to perform a quick local approximation in the vicinity of this Pareto solution for sensitivity analysis. In this article, new linear and quadratic local approximations of the Pareto surface are derived and compared to existing formulas. The case of non-differentiable Pareto points (solutions) in the objective space is also analysed. The concept of a local quick Pareto analyser based on local sensitivity analysis is proposed. This Pareto analysis provides a quantitative insight into the relation between variations of the different objective functions under constraints. A few examples are considered to illustrate the concept and its advantages.

Keywords:

• Pareto surface
• approximation
• multi-objective optimization
• decision-making
• sensitivity analysis

Acknowledgements

The research reported in this article was carried out within the VIVACE Integrated Project (AIP3 CT-2003-502917), which is partly sponsored by the Sixth Framework Programme of the European Community under priority 4 ‘Aeronautics and Space’.