Numerical continuation methods: an introduction
Numerical continuation methods: an introduction
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Stochastic method for the solution of unconstrained vector optimization problems
Journal of Optimization Theory and Applications
Numerical Analysis in Modern Scientific Computing: An Introduction
Numerical Analysis in Modern Scientific Computing: An Introduction
Multicriteria Optimization
A new approach for online multiobjective optimization of mechatronic systems
International Journal on Software Tools for Technology Transfer (STTT)
Covering pareto sets by multilevel evolutionary subdivision techniques
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A new data structure for the nondominance problem in multi-objective optimization
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A variational approach to define robustness for parametric multiobjective optimization problems
Journal of Global Optimization
| Hi-index | 0.00 |
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.