Abstract
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.
Citation
Jen-Chwan Liu. Kazunori Yokoyama. "ɛ-OPTIMALITY AND DUALITY FOR FRACTIONAL PROGRAMMING." Taiwanese J. Math. 3 (3) 311 - 322, 1999. https://doi.org/10.11650/twjm/1500407131
Information
