Inner approximation algorithm for solving linear multiobjective optimization problems

Benson's outer approximation algorithm and its variants are the most frequently used methods for solving linear multiobjective optimization problems. These algorithms have two intertwined parts: single-objective linear optimization on one hand, and a combinatorial part closely related to vertex...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 70; číslo 7; s. 1487 - 1511
Hlavný autor:	Csirmaz, Laszlo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis 03.07.2021 Taylor & Francis LLC
Predmet:	Algorithms Approximation Combinatorial analysis Computational geometry Convexity double description duality Enumeration Linear programming Mathematical analysis Multiobjective optimization Multiple objective analysis objective space Optimization vertex enumeration
ISSN:	0233-1934, 1029-4945
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!