A Benson-type algorithm for bounded convex vector optimization problems with vertex selection

We present an algorithm for approximately solving bounded convex vector optimization problems. The algorithm provides both an outer and an inner polyhedral approximation of the upper image. It is a modification of the primal algorithm presented by Löhne, Rudloff, and Ulus in 2014. There, vertices of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization methods & software Jg. 37; H. 3; S. 1006 - 1026
Hauptverfasser:	Dörfler, Daniel, Löhne, Andreas, Schneider, Christopher, Weißing, Benjamin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 04.05.2022 Taylor & Francis Ltd
Schlagworte:	90-08 Algorithms Apexes Approximation convex programming Mathematical analysis multiple objective optimization Optimization polyhedral approximation Vector optimization
ISSN:	1055-6788, 1029-4937
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!