Optimality and Duality for Complex Nondifferentiable Fractional Programming

Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of complex nondifferentiable fractional programming problems containing generalized convex functions. Subsequently, these optimality criteria are utilized as a basis for constructing one parametric and two other parameter-free dual models with appropriate duality theorems.