An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1) that has both nonlinear objective functions and a convex, nonpolyhedral feasible regi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 52; číslo 3; s. 553 - 574
Hlavný autor:	Benson, Harold P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.03.2012 Springer Nature B.V
Predmet:	Algorithms Approximation Computer Science Mathematics Mathematics and Statistics Nonlinear programming Operations management Operations Research/Decision Theory Optimization Pareto optimum Real Functions Studies Global optimization Multiple objective nonlinear programming Branch and bound Weakly efficient set
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!