Saddle-point Condition for Fractional Programming

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.