New generalized invexity for duality in multiobjective programming problems involving N-set functions

被引:0
作者
Mishra, SK [1 ]
Wang, SY [1 ]
Lai, KK [1 ]
Shi, J [1 ]
机构
[1] GB Pant Univ Agr & Technol, Dept Math Stat & Comp Sci, Patanagar, India
来源
GENERALIZED CONVEXITY, GENERALIZED MONOTONICITY AND APPLICATIONS | 2005年 / 77卷
关键词
multiobjective programming; n-set function; optimality; duality; generalized convexity;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we introduce four types of generalized convexity for an n-set function and discuss optimality and duality for a multiobjective programming problem involving n-set functions. Under some mild assumption on the new generalized convexity, we present a few optimality conditions for an efficient solution and a weakly efficient solution to the problem. Also we prove a weak duality theorem and a strong duality theorem for the problem and its Mond-Weir and general Mond-Weir dual problems respectively.
引用
收藏
页码:321 / 339
页数:19
相关论文
共 30 条