On the simplex, interior-point and objective space approaches to multiobjective linear programming

Most Multiple Objective Linear Programming (MOLP) algorithms working in the decision variable space, are based on the simplex algorithm or interior-point method of Linear Programming. However, objective space based methods are becoming more and more prominent. This paper investigates three algorithm...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algorithms & computational technology Jg. 15
Hauptverfasser:	Nyiam, Paschal B, Salhi, Abdellah
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London, England SAGE Publications 01.10.2021 Sage Publications Ltd SAGE Publishing
Schlagworte:	Algorithms Linear programming Mathematical analysis Multiple objective analysis Simplex method affine scaling interior MOLP algorithm outer-approximation algorithm multiobjective simplex algorithm most preferred nondominated point Multiple objective linear programming
ISSN:	1748-3018, 1748-3026
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!