A comparative study of two key algorithms in multiple objective linear programming

Multiple objective linear programming problems are solved with a variety of algorithms. While these algorithms vary in philosophy and outlook, most of them fall into two broad categories: those that are decision space-based and those that are objective space-based. This paper reports the outcome of...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of algorithms & computational technology Ročník 13
Hlavní autori:	Nyiam, Paschal B, Salhi, Abdellah
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London, England SAGE Publications 01.10.2019 Sage Publications Ltd SAGE Publishing
Predmet:	Algorithms Comparative studies Linear programming Multiple objective analysis Simplex method outer-approximation algorithm multiple criteria decision making parametric simplex algorithm most preferred nondominated point Multiple objective linear programming
ISSN:	1748-3018, 1748-3026
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!