Computation of robust Pareto points (Q1037270): Difference between revisions

Summary: 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 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.