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á bibliografie

Vydáno v:	Optimization Ročník 70; číslo 7; s. 1487 - 1511
Hlavní autor:	Csirmaz, Laszlo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia Taylor & Francis 03.07.2021 Taylor & Francis LLC
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!