Sufficient optimality conditions and duality in multiobjective optimization involving generalized convexity

被引：8
|
作者：
Aghezzaf, B [1 ]
Hachimi, M [1 ]
机构：
[1] Univ Hassan II, Fac Sci Ain Chock, Dept Math & Informat, Casablanca, Morocco
来源：
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION | 2001年 / 22卷 / 7-8期
关键词：
multiobjective programming; Pareto minimal solutions; sufficient conditions; convexity; invexity; duality; converse duality;
D O I：
10.1081/NFA-100108308
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We are concerned with nonlinear multiobjective programming problem with inequality constraints. We introduce some classes of nonconvex. functions by relaxing the definitions of invex and preinvex functions. Examples are given to shows relationship between them. Various first and second order sufficient optimality theorems are obtained. Moreover, we prove duality and converse duality results for Mond-Weir type dual.
引用
收藏
页码：775 / 788
页数：14
相关论文
共 50 条
12345