A Comparison of Benson’s Outer Approximation Algorithm with an Extended Version of Multiobjective Simplex Algorithm

Paschal B. Nyiam and Abdellah Salhi

Advances in Operations Research, 2021, vol. 2021, 1-11

Abstract:

The multiple objective simplex algorithm and its variants work in the decision variable space to find the set of all efficient extreme points of multiple objective linear programming (MOLP). Other approaches to the problem find either the entire set of all efficient solutions or a subset of them and also return the corresponding objective values (nondominated points). This paper presents an extension of the multiobjective simplex algorithm (MSA) to generate the set of all nondominated points and no redundant ones. This extended version is compared to Benson’s outer approximation (BOA) algorithm that also computes the set of all nondominated points of the problem. Numerical results on nontrivial MOLP problems show that the total number of nondominated points returned by the extended MSA is the same as that returned by BOA for most of the problems considered.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2021/1857030.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2021/1857030.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:1857030

DOI: 10.1155/2021/1857030

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().