Necessary conditions for efficient solution of vector optimization problems

被引:0
作者
Xunhua Gong
机构
[1] Nanchang University,Department of Mathematics
来源
Journal of Systems Science and Complexity | 2012年 / 25卷
关键词
Efficient solution; Fréchet derivative; necessary conditions; vector optimization;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:514 / 520
页数:6
相关论文
共 21 条
[1]  
Yu P. L.(1974)Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives Journal of Optimization Theory and Applications 14 319-377
[2]  
Borwein J. M.(1977)Proper efficient points for maximizations with respect to cones SIAM J. Control Optim. 15 57-63
[3]  
Corley H. W.(1981)Duality theory for maximizations with respect to cones Journal of Mathematical Analysis and Applications 84 560-568
[4]  
Chen G. Y.(1984)Necessary conditions of nondominates solutions in multicriteria decision making Journal of Mathematical Analysis and Applications 104 38-46
[5]  
Tanino T.(1979)Duality theorem in multiobjective programming Journal of Optimization Theory and Applications 27 509-529
[6]  
Sawaragi Y.(1992)Generalizations of Slater’s constraint qualification for infinite convex programs Mathematical Programming 57 85-101
[7]  
Jeyakumar V.(1997)Lagrange multiplies, saddle points and duality in vector optimization of set-valued maps Journal of Mathematical Analysis and Applications 215 297-316
[8]  
Wolkowicz H.(1999)The optimality condition for vector optimization of set-valued maps Journal of Mathematical Analysis and Applications 237 413-424
[9]  
Li Z. F.(1994)Optimization of set-valued function Journal of Mathematical Analysis and Applications 86 30-51
[10]  
Chen G. Y.(1991)Contingent derivatives of set-valued maps and applications to vector optimization Mathematical Programming 50 99-111