A comparative study of two key algorithms in multiple objective linear programming. (October 2019)

• Record Type: Journal Article
• Authors: Nyiam, Paschal B; Salhi, Abdellah
• Is Part Of: Journal of algorithms & computational technology. Volume 13(2019)
• Publication Date: 2019-10
• Subjects: Multiple objective linear programming -- parametric simplex algorithm -- outer-approximation algorithm -- most preferred nondominated point -- multiple criteria decision making; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1177/1748302619870424
• Languages: English
• ISSNs: 1748-3018

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.