Computation of robust Pareto points
by M. Dellnitz, K. Witting
International Journal of Computing Science and Mathematics (IJCSM), Vol. 2, No. 3, 2009

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.

Online publication date: Thu, 13-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email