Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions
J.C. Liu · Optimization · 1996
We establish the Kuhn-Tucker necessary and sufficient conditions for an efficient optimum of multiobjective fractional programming problems containing ($si:F$esi:ρ)-convex functions. Bector type dual for multiobjective fractional programming problem is introduced and certain duality results have been derived in the framework of ($si:F$esi:ρ)-convex functions.