A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1155/2010/898626 fatcat:tswvgmueybhefdey7fz6dho4ee