Home > Research > Publications & Outputs > A dual variant of Benson’s outer approximation ...
View graph of relations

A dual variant of Benson’s outer approximation algorithm for multiple objective linear programming

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>04/2012
<mark>Journal</mark>Journal of Global Optimization
Issue number4
Number of pages22
Pages (from-to)757-778
Publication StatusPublished
<mark>Original language</mark>English


Outcome space methods construct the set of nondominated points in the objective (outcome) space of a multiple objective linear programme. In this paper, we employ results from geometric duality theory for multiple objective linear programmes to derive a dual variant of Benson’s “outer approximation algorithm” to solve multiobjective linear programmes in objective space. We also suggest some improvements of the original version of the algorithm and prove that solving the dual provides a weight set decomposition. We compare both algorithms on small illustrative and on practically relevant examples.