Abstract
The geometric duality theory of Heyde and Löhne (2006) defines a dual to a multiple objective linear programme (MOLP). In objective space, the primal problem can be solved by Benson’s outer approximation method (Benson 1998a,b) while the dual problem can be solved by a dual variant of Benson’s algorithm (Ehrgott et al. 2007). Duality theory then assures that it is possible to find the (weakly) nondominated set of the primal MOLP by solving its dual. In this paper, we propose an algorithm to solve the dual MOLP approximately but within specified tolerance. This approximate solution set can be used to calculate an approximation of the weakly nondominated set of the primal. We show that this set is a weakly ε-nondominated set of the original primal MOLP and provide numerical evidence that this approach can be faster than solving the primal MOLP approximately.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benson HP (1998a) Hybrid approach for solving multiple-objective linear programs in outcome space. J Optim Theory Appl 98: 17–35
Benson HP (1998b) An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J Global Optim 13: 1–24
Chen PC, Hansen P (1991) On-line and off-line vertex enumeration by adjacency lists. Oper Res Lett 10: 403–409
Ehrgott M, Wiecek M (2005) Multiobjective programming. In: Figueira J, Greco S, Ehrgott M (eds) Multicriteria decision analysis: state of the art surveys. Springer Science + Business Media, New York, pp 667–722
Ehrgott M, Löhne A, Shao L (2007) A dual variant of Benson’s outer approximation algorithm. Report 654, Department of Engineering Science, The University of Auckland
Heyde F, Löhne A (2006) Geometric duality in multi-objective linear programming. Reports on Optimization and Stochastics 06-15, Department of Mathematics and Computer Science, Martin-Luther-University, Halle–Wittenberg
Loridan P (1984) ε-solutions in vector minimization problems. J Optim Theory Appl 43(2): 265–276
Rockafellar R (1972) Convex analysis. Princeton University Press, Princeton
Ruzika S, Wiecek MM (2005) Approximation methods in multiobjective programming. J Optim Theory Appl 126(3): 473–501
Shao L, Ehrgott M (2006) Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Report 646, Department of Engineering Science, The University of Auckland. Available online at http://www.esc.auckland.ac.nz/research/tech/esc-tr-646.pdf. Accepted for publication in Mathematical Methods of Operations Research
Webster R (1994) Convexity. Oxford Science Publications, Oxford University Press, Oxford
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shao, L., Ehrgott, M. Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math Meth Oper Res 68, 469–492 (2008). https://doi.org/10.1007/s00186-007-0194-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-007-0194-5