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
Main Authors: Paschal B Nyiam, Abdellah Salhi
Format: Article
Language:English
Published: SAGE Publishing 2019-10-01
Series:Journal of Algorithms & Computational Technology
Online Access:https://doi.org/10.1177/1748302619870424