Abstract
In this paper the problem dual to a convex vector optimization problem is defined. Under suitable assumptions, a weak, strong and strict converse duality theorem are proved. In the case of linear mappings the formulation of the dual is refined such that well-known dual problems of Gale, Kuhn and Tucker [8] and Isermann [12] are generalized by this approach.
Similar content being viewed by others
References
J. Borwein, “Proper efficient points for maximizations with respect to cones,”SIAM Journal on Control and Optimization 15 (1977) 57–63.
J.M. Borwein, “The geometry of Pareto efficiency over cones,”Mathematische Operations-forschung und Statistik 11 (1980) 235–248.
W.W. Breckner, “Dualität bei Optimierungsaufgaben in halbgeordneten topologischen Vektorräumen (I)”,Revue d'Analyse Numérique et de la Théorie de l'Approximation 1 (1972) 5–35.
S. Brumelle, “Duality for multiple objective convex programs,”Mathematics of Operations Research 6 (1981) 159–172.
B.D. Craven, “Strong vector minimization and duality,”Zeitschrift für Angewandte Mathematik und Mechanik 60 (1980) 1–5.
F. di Guglielmo, “Nonconvex duality in multiobjective optimization,”Mathematics of Operations Research 2 (1977) 285–291.
I. Ekeland and R. Teman.Convex analysis and variational problems (North-Holland, Amsterdam, 1976).
D. Gale, H.W. Kuhn and A.W. Tucker, “Linear programming and the theory of games,” in: T.C. Koopmans, ed.,Activity analysis of production and allocation (Wiley, New York, 1951).
A.M. Geoffrion, “Proper efficiency and the theory of vector maximization,”Journal of Mathematical Analysis and Applications 22 (1968) 618–630.
C. Gerstewitz, A. Göpfert and U. Lampe, “Zur Dualität in der Vektoroptimierung”, Vortragsauszug zur Jahrestagung ‘Mathematische Optimierung’, Vitte/Hiddensee (1980).
C. Gros, “Generalization of Fenchel's duality theorem for convex vector optimization,”European Journal of Operational Research 2 (1978) 368–376.
H. Isermann, “On some relations between a dual pair of multiple objective linear programs,”Zeitschrift für Operations Research 22 (1978) 33–41.
H. Isermann, “Duality in Multiple Objective Linear Programming,” in: S. Zionts, ed.,Multiple criteria problem solving, Lecture Notes in Economics and Mathematical Systems No. 155 (Springer, Berlin, 1978).
J.S.H. Kornbluth, “Duality, indifference and sensitivity analysis in multiple objective linear programming,”Operational Research Quarterly 25 (1974) 599–614.
W. Krabs,Optimization and approximation (Wiley, New York, 1979).
R. Lehmann and W. Oettli, “The theorem of the alternative, the key-theorem, and the vector-maximum problem,”Mathematical Programming 8 (1975), 332–344.
H. Nakayama, “Duality and related theorems in convex vector optimization,” Research Report No. 4, Department of Applied Mathematics, Konan University (1980).
J.W. Nieuwenhuis, “Supremal points and generalized duality,”Mathematische Operationsforschung und Statistik 11 (1980) 41–59.
W. Oettli, “A duality theorem for the nonlinear vectormaximum problem,” in: A. Prékopa, ed.,Colloquia Mathematica Societatis János Bolyai, 12. Progress in Operations Research, Eger (Hungary), 1974 (North-Holland, Amsterdam 1976).
R.T. Rockafellar,Conjugate duality and optimization CBMS Lecture Note Series No. 16 (SIAM, Philadelphia, PA 1974).
W. Rödder, “A generalized saddlepoint theory,”European Journal of Operational Research 1 (1977) 55–59.
E.E. Rosinger, “Duality and alternative in multiobjective optimization,”Proceedings of the American Mathematical Society 54 (1977) 307–312.
P. Schönfeld, “Some duality theorems for the non-linear vector maximum problem,”Unternehmensforschung 14 (1970) 51–63.
T. Tanino and Y. Sawaragi, “Duality theory in multiobjective programming,”Journal of Optimization Theory and Applications 27 (1979) 509–529.
R.M. Van Slyke and R.J.-B. Wets, “A duality theory for abstract mathematical programs with applications to optimal control theory,”Journal of Mathematical Analysis and Applications 22 (1968) 679–706.
W. Vogel,Vektoroptimierung in Produkträumen, Mathematical Systems in Economics No. 35 (Verlag Anton Hain, Meisenheim am Glan, 1977).
J. Zowe, “A duality theorem for a convex programming problem in order complete vector lattices,”Journal of Mathematical Analysis and Applications 50 (1975) 273–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jahn, J. Duality in vector optimization. Mathematical Programming 25, 343–353 (1983). https://doi.org/10.1007/BF02594784
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02594784