Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Covering Pareto sets by multilevel subdivision techniques
Ist Teil von
Journal of optimization theory and applications, 2005, Vol.124 (1), p.113-136
Ort / Verlag
New York, NY: Springer
Erscheinungsjahr
2005
Link zum Volltext
Quelle
SpringerLink (Online service)
Beschreibungen/Notizen
In this work, we present a new set-oriented numerical method for the numerical solution of multiobjective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure, we use this result as a basis for the development of three different algorithms. We consider also appropriate combinations of them in order to improve the total performance. Finally, we illustrate the efficiency of these techniques via academic examples plus a real technical application, namely, the optimization of an active suspension system for cars.