Research Institute of Information and System Computation Science, Beifang University of Nationalities, Yinchuan 750021, China
Copyright © 2012 GuoLin Yu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
In the setting of Ben-Tal's generalized algebraic operations, this paper deals with Mond-Weir type dual theorems of multiobjective programming problems involving generalized invex functions. Two classes of functions, namely, -pseudoinvex and -quasi-invex, are defined for a vector function. By utilizing these two classes of functions, some dual theorems are established for conditionally proper
efficient solution in -multiobjective programming problems.