Title: Computation of robust Pareto points

Authors: M. Dellnitz, K. Witting

Addresses: Institute for Mathematics, University of Paderborn, Warburger Str. 100, D-33095 Paderborn, Germany. ' Institute for Mathematics, University of Paderborn, Warburger Str. 100, D-33095 Paderborn, Germany

Abstract: In a multiobjective optimisation problem the aim is to minimise k objective functions simultaneously. The solution of this problem is given by the set of optimal compromises – the so-called Pareto set which locally typically forms a (k − 1)-dimensional manifold. In this work we consider Multiobjective Optimisation Problems (MOPs) which are parameter-dependent. Our aim is to identify |robust| Pareto points. These are points which hardly vary under the variation of the system parameter. For this we employ path following techniques in order to identify curves consisting of those specific points.

Keywords: multiobjective optimisation; Pareto optimisation; path following methods; robust Pareto points; decision making.

DOI: 10.1504/IJCSM.2009.027876

International Journal of Computing Science and Mathematics, 2009 Vol.2 No.3, pp.243 - 266

Published online: 13 Aug 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article