Global maximization of UTA functions in multi-objective optimization

► We propose an algorithm for globally maximizing UTA function for convex multi-objective optimization problems. ► This is a finite branch and bound algorithm.The most expensive tasks are performed in the space of the objectives. ► The algorithm works well for problems, in which the number of object...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 228; číslo 2; s. 397 - 404
Hlavný autor:	Nguyen, Duy Van
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 16.07.2013 Elsevier Elsevier Sequoia S.A
Predmet:	Algorithms Branch & bound algorithms Branch-and-bound algorithm Decision analysis Global optimization Mathematical programming Multiple criteria decision making Multiple objective optimization Optimization algorithms Studies UTA functions UTA type methods Utility function program Utility functions Utility function program Global optimization UTA type methods UTA functions Multiple objective optimization Branch-and-bound algorithm
ISSN:	0377-2217, 1872-6860
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!