Jahn J (1983)
Publication Type: Journal article, Original article
Publication year: 1983
Publisher: Springer Verlag (Germany)
Book Volume: 25
Pages Range: 343-353
DOI: 10.1007/BF02594784
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. © 1983 The Mathematical Programming Society, Inc.
APA:
Jahn, J. (1983). Duality in Vector Optimization. Mathematical Programming, 25, 343-353. https://doi.org/10.1007/BF02594784
MLA:
Jahn, Johannes. "Duality in Vector Optimization." Mathematical Programming 25 (1983): 343-353.
BibTeX: Download