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

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of algorithms & computational technology Ročník 15
Hlavní autoři:	Nyiam, Paschal B, Salhi, Abdellah
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London, England SAGE Publications 01.10.2021 Sage Publications Ltd SAGE Publishing
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!