Research Repository

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

Nyiam, Paschal B and Salhi, Abdellah (2019) 'A comparative study of two key algorithms in multiple objective linear programming.' Journal of Algorithms & Computational Technology, 13. ISSN 1748-3026

[img]
Preview
Text
1748302619870424.pdf - Published Version
Available under License Creative Commons Attribution.

Download (348kB) | Preview

Abstract

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 a computational investigation of two key representative algorithms, one of each category, namely the parametric simplex algorithm which is a prominent representative of the former and the primal variant of Bensons Outer-approximation algorithm which is a prominent representative of the latter. The paper includes a procedure to compute the most preferred nondominated point which is an important feature in the implementation of these algorithms and their comparison. Computational and comparative results on problem instances ranging from small to medium and large are provided.

Item Type: Article
Uncontrolled Keywords: Multiple objective linear programming, parametric simplex algorithm, outer-approximation algorithm, most preferred nondominated point, multiple criteria decision making
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: Elements
Date Deposited: 11 Jul 2020 09:33
Last Modified: 11 Jul 2020 09:33
URI: http://repository.essex.ac.uk/id/eprint/28185

Actions (login required)

View Item View Item