A duality theorem for a nondifferentiable nonlinear fractional programming problem
B. Mond, B. D. Craven · Bulletin of the Australian Mathematical Society · 1979
A duality theorem, and a converse duality theorem, are proved for a nonlinear fractional program, where the numerator of the objective function involves a concave function, not necessarily differentiable, and also the support function of a convex set, and the denominator involves a convex function, and the support function of a convex set. Various known results are deduced as special cases.