Mond-Weir Type Duality in Nondifferentiable Fractional Programming with Generalized Convexity

Some kinds of generalized convex function are defined, which generalize some of the present convex functions. In the framework of these new concept, a Mond-Weir type dual for a class of fractional programming problem is considered. Appropriate duality results are formulated. The results obtained not only provide a measurement of sensitivity for given problems to perturbations, but also can be apply to the questions occur in resource allocation, stock cutting problem in paper industry, agricultural planning and portfolio selection etc.