An approximation algorithm for convex multi-objective programming problems

In multi-objective convex optimization it is necessary to compute an infinite set of nondominated points. We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and the feasible set are convex. This method is an ex...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 50; číslo 3; s. 397 - 416
Hlavní autori:	Ehrgott, Matthias, Shao, Lizhen, Schöbel, Anita
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.07.2011 Springer Nature B.V
Predmet:	Algorithms Approximation Computer Science Convex analysis Linear programming Mathematics Mathematics and Statistics Methods Nonlinear programming Objectives Operations Research/Decision Theory Optimization Real Functions Studies nondominated point Multi-objective optimization Approximation algorithm Convex optimization
ISSN:	0925-5001, 1573-2916
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!