Abstract:
Geometric duality theory for multiple objective linear programmes is used 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.