A new approach to duality in vector optimization
- 1 February 2007
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 56 (1-2) , 221-239
Abstract
In this article, we develop a new approach to duality theory for convex vector optimization problems. We modify a given (set-valued) vector optimization problem such that the image space becomes a complete lattice (a sublattice of the power set of the original image space), where the corresponding infimum and supremum are sets that are related to the set of (minimal and maximal) weakly efficient points. In doing so we can carry over the structures of the duality theory in scalar convex programming. Exemplarily this is demonstrated for the case of Fenchel duality. We also show the relationship to set-valued optimization based on the ordering ‘set inclusion’. Finally, some consequences for duality in linear vector optimization are discussed.Keywords
This publication has 16 references indexed in Scilit:
- Optimization with set relations: conjugate dualityOptimization, 2005
- An analysis of some dual problems in multiobjective optimization (I)Optimization, 2004
- A generalization of Fenchel duality in set-valued vector optimizationMathematical Methods of Operations Research, 1998
- Variational Analysis1998
- General duality in vector optimizationOptimization, 1993
- Conjugate duality in vector optimizationJournal of Mathematical Analysis and Applications, 1992
- On supremum of a set in a multi-dimensional spaceJournal of Mathematical Analysis and Applications, 1988
- Duality in vector optimizationMathematical Programming, 1983
- Duality theory for maximizations with respect to conesJournal of Mathematical Analysis and Applications, 1981
- Supremal points and generalized dualityMathematische Operationsforschung und Statistik. Series Optimization, 1980