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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization Jg. 70; H. 7; S. 1487 - 1511
1. Verfasser:	Csirmaz, Laszlo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Taylor & Francis 03.07.2021 Taylor & Francis LLC
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!