Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative
Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative作者机构:不详
出 版 物:《Applied Mathematics》 (应用数学(英文))
年 卷 期:2011年第2卷第4期
页 面:452-460页
主 题:Multiobjective Programming Nondifferentiable Programming Generalized dI-Univexity Sufficiency Duality
摘 要:In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficient under the generalised dI-univexity requirements. Moreover, weak, strong and strict converse duality theorems are also derived for Mond-Weir type dual programs.