Geometric duality in multiple objective linear programming

SIAM Journal on Optimization

Volumn 19, Issue 2, 2008, Pages 836-845

  Heyde, Frank ^a   Löhne, Andreas ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Dual polytopes AMS subject classifications; Duality theory; Linear programming; Multiobjective optimization

Indexed keywords

DUAL POLYTOPES AMS SUBJECT CLASSIFICATIONS; DUALITY THEORY; GEOMETRIC APPROACHES; GEOMETRIC DUALITY; MULTIPLE OBJECTIVE LINEAR PROGRAMMING; POLYTOPES;

ALPHA PARTICLE SPECTROMETERS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; TOPOLOGY;

MULTIOBJECTIVE OPTIMIZATION;

EID: 67649563554     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/060674831     Document Type: Article

References (18)

1. H. P. BENSON, 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 (1998), pp. 1-24.
2. S. BRUMELLE, Duality for multiple objective convex programs, Math. Oper. Res., 6 (1981), pp. 159-172.
3. M. EHRGOTT, A. LÖHNE, AND L. SHAO, A dual variant of Benson's outer approximation algorithm, J. Global Optim., submitted.
4. A. GÖPFERT AND R. NEHSE, Vektoroptimι ́erung, Teubner, Leipzig, Germany, 1990.
5. B. GRÜNBAUM, Convex Polytopes, 2nd ed., Grad. Texts in Math. 221, V. Kaibel, V. Klee, and G. M. Ziegler, eds., Springer-Verlag, New York, 2003.
6. A. HAMEL. F. HEYDE, A. LÖHNE, C. TAMMER, AND K. WINKLER, Closing the duality gap in linear vector optimization, J. Convex Anal., 11 (2004), pp. 163-178.
7. F. HEYDE, A. LÖHNE, AND C. TAMMER, The attainment of the solution of the dual program in vertices for vectorial linear programs, Proceedings of the 7th International Conference on Multi-Objective Programming and Goal Programming, Tours, France, 2006, accepted.
8. F. HEYDE, A. LÖHNE, AND C. TAMMER, Set-valued duality theory for multiple objective linear programs and application to mathematical finance, Math. Methods Oper. Res., submitted.
9. H. ISERMANN, On some relations between a dual pair of multiple objective linear programs, Z. Operations Res. Ser. A-B, 22 (1978), pp. A33-A41.
10. H. ISERMANN, Duality in multiple objective linear programming, in Multiple Criteria Problem Solving (Buffalo, NY, 1977), Lect. Notes Econ. Math. Syst. 155, Springer-Verlag, New York, 1978, pp. 274-285.
11. J. JAHN, Mathematical Vector Optimization in Partially Ordered Linear Spaces, Verlag Peter Lang, Frankfurt am Main, Bern, New York, 1986.
12. J. JAHN, Vector Optimization. Theory, Applications, and Extensions, Springer-Verlag, Berlin, 2004.
13. J. S. H. KORNBLUTH, Duality, indifference and sensitivity analysis in multiple objective linear programming, Operational Res. Quart., 25 (1974), pp. 599-614.
14. A. LÖHNE AND C. TAMMER, A new approach to duality in linear vector optimization, Optimization, 56 (2007), pp. 221-239.
15. D. T. Luc, Theory of Vector Optimization, Lect. Notes Econ. Math. Sci. 319, Springer-Verlag, Berlin, 1988.
16. Ft. T. FtOCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1972.
17. W. RÖDDER, A generalized saddlepoint theory; its application to duality theory for linear vector optimum problems, European J. Oper. Res., 1 (1977), pp. 55-59.
18. R. WEBSTER, Convexity, Oxford Sci. Publ., Oxford University Press, New York, 1994.