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

Gespeichert in:
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:
ISSN:1687-9147, 1687-9155
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 also return the corresponding objective values (nondominated points). This paper presents an extension of the multiobjective simplex algorithm (MSA) to generate the set of all nondominated points and no redundant ones. This extended version is compared to Benson’s outer approximation (BOA) algorithm that also computes the set of all nondominated points of the problem. Numerical results on nontrivial MOLP problems show that the total number of nondominated points returned by the extended MSA is the same as that returned by BOA for most of the problems considered.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-9147
1687-9155
DOI:10.1155/2021/1857030