Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
840959 | Nonlinear Analysis: Theory, Methods & Applications | 2011 | 9 Pages |
Abstract
In this paper, a class of nonsmooth multiobjective programming problems with inequality constraints is considered. We introduce the concepts of V–rV–r-pseudo-invex, strictly V–rV–r-pseudo-invex and V–rV–r-quasi-invex functions, in which the involved functions are locally Lipschitz. Based upon these generalized V–rV–r-invex functions, sufficient optimality conditions for a feasible point to be an efficient or a weakly efficient solution are derived. Appropriate duality theorems are proved for a Mond–Weir-type dual program of a nonsmooth multiobjective programming under the aforesaid functions.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Engineering (General)
Authors
I. Ahmad, S.K. Gupta, Anurag Jayswal,