Optimality Conditions and Duality for Nondifferentiable Multiobjective Fractional Programming Problems with (C,α,ρ,d)-convexity

The purpose of this paper is to consider a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function contains a term involving the support function of a compact convex set. Based on the ( C , α , ρ , d )-convexity, sufficient optimality conditions and duality results for weakly efficient solutions of the nondifferentiable multiobjective fractional programming problem are established. The results extend and improve the corresponding results in the literature.