一类广义凸多目标分式规划近似弱有效解的最优性.

The aim of this paper is to study the optimality conditions and saddle point theorems of a class of generalized convex (multi-objective fractional programming) problem ( MFP ) with respect to approximate weakly efficient solutions. Firstly, by using parameter method, the problem ( MFP ) is transformed into a (multi-objective non-fractional programming) problem (MNP) . Secondly, the concepts of type-I function and approximate pseudo-quasi-type-I function are introduced for the objective and constraint functions of problem ( MNP ). Finally, under assumptions of the introduced generalized convexities, the optimality conditions and saddle point theorems to problem ( MNP ) are established. [ABSTRACT FROM AUTHOR]