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

Full description

Bibliographic Details

Published in:	Journal of algorithms & computational technology Vol. 13
Main Authors:	Nyiam, Paschal B, Salhi, Abdellah
Format:	Journal Article
Language:	English
Published:	London, England SAGE Publications 01.10.2019 Sage Publications Ltd SAGE Publishing
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!