A Comparison of Benson’s Outer Approximation Algorithm with an Extended Version of Multiobjective Simplex Algorithm

The multiple objective simplex algorithm and its variants work in the decision variable space to find the set of all efficient extreme points of multiple objective linear programming (MOLP). Other approaches to the problem find either the entire set of all efficient solutions or a subset of them and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in Operations Research Jg. 2021; S. 1 - 11
Hauptverfasser:	Nyiam, Paschal B., Salhi, Abdellah
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Hindawi 05.07.2021 John Wiley & Sons, Inc
Schlagworte:	Algorithms Approximation Comparative analysis Decision making Decomposition Efficiency Linear programming Operations research Simplex method Germany
ISSN:	1687-9147, 1687-9155
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!