Epsilon-Optimality Conditions for a Class of F epsilon-G Convex Fractional Semi-infinite Programming

Abstract

A class of fractional semi-infinite programming is concerned; a new class of generalized convex function called Fε-G Convex function and related nonconvex functions are defined, which generalize some of the present convex functions. In the framework of the new concept, some interesting sufficient conditions of ε-optimality solutions are derived for the programming. These results obtained not only extend some of the present researches, but also can be apply to the questions occur in resource allocation, stock cutting problem in paper industry, agricultural planning and portfolio selection etc. Theoretically, they are helpful to studying fractional semiinfinite programming.