Abstract
A new class of generalized V-type I invex functions is introduced for nonsmooth multiobjective programming problem. Based upon these generalized invex functions, we establish sufficient optimality conditions for a feasible point to be an efficient or a weakly efficient solution. Weak, strong, and strict converse duality theorems are proved for Mond-Weir type dual program in order to relate the weakly efficient solutions of primal and dual programs.
| Original language | English |
|---|---|
| Article number | 898626 |
| Journal | Journal of Inequalities and Applications |
| Volume | 2010 |
| DOIs | |
| State | Published - 2010 |
ASJC Scopus subject areas
- Analysis
- Discrete Mathematics and Combinatorics
- Applied Mathematics