Author_Institution :
Coll. of Math. & Comput. Sci., Vanan Univ., Van´an, China
Abstract :
In this paper, new classes of generalized invex functions called B - (p, r, a)-invex, B - (p, r, a)-quasi invex and B -(p, r, a)-pseudo invex functions are introduced, which are defined by relaxing the definitions of B - (p, r)-invex, B - (p, r)-quasi-invex, B - (p, r)-pseudo-invex functions, an incomplete Lagrange function is defined to study saddle point optimality criteria for minimax fractional programming under generalized convexity assumptions, the necessary conditions for saddle point are obtained under weeker convexity. These results further extended generalized fractional programming problems.
Keywords :
convex programming; minimax techniques; vectors; Lagrange function; generalized convexity assumption; generalized fractional programming problem; generalized invex function; minimax fractional programming; pseudo invex function; quasiinvex function; saddle point optimality criteria; saddle-point condition; Computational intelligence; Educational institutions; Mathematical programming; Programming; Security; B - (p; a)-invex function; fractional programming; incomplete Lagrange function; r; saddle point;
