INVEX OPTIMIZATION PROBLEMS

被引:24
|
作者
LUC, DT [1 ]
MALIVERT, C [1 ]
机构
[1] UNIV LIMOGES,FAC SCI,DEPT MATH,F-87050 LIMOGES,FRANCE
关键词
D O I
10.1017/S0004972700011679
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper we extend the concept of invexity to set-valued maps and study vector optimisation problems with invex set-valued data. Necessary and sufficient optimality conditions are established in terms of contingent derivatives. Wolfe type dual problems are constructed via two recently developed approaches which guarantee the zero-gap duality property.
引用
收藏
页码:47 / 66
页数:20
相关论文
共 50 条