Abstract
In this paper, by using Ljusternik’s theorem and the open mapping theorem of convex process, the author gives necessary conditions for the efficient solution to the vector optimization problems without requiring that the ordering cone in the objective space has a nonempty interior.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. L. Yu, Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives, Journal of Optimization Theory and Applications, 1974, 14: 319–377.
J. M. Borwein, Proper efficient points for maximizations with respect to cones, SIAM J. Control Optim., 1977, 15: 57–63.
H. W. Corley, Duality theory for maximizations with respect to cones, Journal of Mathematical Analysis and Applications, 1981, 84: 560–568.
G. Y. Chen, Necessary conditions of nondominates solutions in multicriteria decision making, Journal of Mathematical Analysis and Applications, 1984, 104: 38–46.
T. Tanino and Y. Sawaragi, Duality theorem in multiobjective programming, Journal of Optimization Theory and Applications, 1979, 27: 509–529.
J. Jahn, Mathematical vector optimization in partially ordered linear spaces, Peter Lang, Frankfurt am Main, Germany, 1986.
V. Jeyakumar and H. Wolkowicz, Generalizations of Slater’s constraint qualification for infinite convex programs, Mathematical Programming, 1992, 57: 85–101.
Z. F. Li and G. Y. Chen, Lagrange multiplies, saddle points and duality in vector optimization of set-valued maps, Journal of Mathematical Analysis and Applications, 1997, 215: 297–316.
Z. M. Li, The optimality condition for vector optimization of set-valued maps, Journal of Mathematical Analysis and Applications, 1999, 237: 413–424.
L. J. Lin, Optimization of set-valued function, Journal of Mathematical Analysis and Applications, 1994, 86: 30–51.
D. T. Luc, Contingent derivatives of set-valued maps and applications to vector optimization, Mathematical Programming, 1991, 50: 99–111.
W. Song, Lagrangian duality for minimization of nonconvex multi functions, Journal of Optimization Theory and Applications, 1997, 93: 167–182.
T. Taa, Set-valued derivatives of multifunctions and optimality conditions, Numerical Functional Analysis and Optimization, 1998, 19: 121–140.
X. H. Gong, H. B. Dong, and S. Y. Wang, Optimality conditions for proper efficient solutions of vector set-valued optimization, Journal of Mathematical Analysis and Applications, 2003, 284: 332–350.
X. H. Gong, Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior, Journal of Mathematical Analysis and Applications, 2005, 307: 12–31.
P. J. Bender, An application of Guignard’s generalized Kuhn-Tucker conditions, Journal of Optimization Theory and Applications, 1978, 25: 585–589.
J. W. Nieuwenhuis, Another application of Guignard’s generalized Kuhn-Tucker conditions, Journal of Optimization Theory and Applications, 1980, 30: 117–125.
W. Y. Chen, Nonlinear Functional Analysis, Gansu People Press, 1981 (in Chinese).
J. P. Aubin and H. Frankowska, Set-Valued Analysis, Birkhäuser Boston, 1990.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by the Natural Science Foundation of China under Grant No. 11061023 and Natural Science Foundation of Jiangxi Province, China.
This paper was recommended for publication by Editor Xiaoguang YANG.
Rights and permissions
About this article
Cite this article
Gong, X. Necessary conditions for efficient solution of vector optimization problems. J Syst Sci Complex 25, 514–520 (2012). https://doi.org/10.1007/s11424-012-8096-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-012-8096-x