Sufficient Conditions of e -Optimality Solutions Involving e - Invex Fractional Semi-infinite Programming

Some kinds of generalized convex function are defined, which generalize some of the present convex functions. Then, a class of fractional semi-infinite programming involving these generalized convex functions is studied; some interesting sufficient epsiv - optimality conditions are obtained. These results not only extended several present researches, but also can be applied to fractional programming problems arising from portfolio selection, cargo-loading problem, information transfer, agricultural panning, stochastic processes and numerical analysis etc. Theoretically, they are helpful to studying fractional programming.