-OPTIMALITY AND DUALITY FOR FRACTIONAL PROGRAMMING

We use the parametric approach and exact penalty function to establish the Karush-Kuhn-Tucker type necessary and sucient conditions for an ɛ-optimum of nondierentiable fractional objective function subject to nondierentiable convex inequality constraint, linear equality constraints and abstract constraints. Subsequently, these optimality criteria are utilized as a basis for constructing one dual problem, and duality theorems are presented.