Generalized invexity and duality in multiobjective programming problems

被引:80
|
作者
Aghezzaf, B [1 ]
Hachimi, M [1 ]
机构
[1] Fac Sci Ain Chock, Dept Math & Informat, Casablanca, Morocco
关键词
multiobjective programming; efficient solution; convexity; invexity; type I; weak; strong; converse duality;
D O I
10.1023/A:1008321026317
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we are concerned with the multiobjective programming problem with inequality constraints. We introduce new classes of generalized type I vector-valued functions. Duality theorems are proved for Mond-Weir and general Mond-Weir type duality under the above generalized type I assumptions.
引用
收藏
页码:91 / 101
页数:11
相关论文
共 50 条