Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems (Q2370032)

This paper considers a class of nondifferentiable multiobjective fractional programming problems where each component of the objective function contains a term that involves the support function of a compact convex set. Necessary and sufficient optimality conditions as well as duality results for a weakly efficient solution are derived under the assumption of the \((V, \rho)\)-invexity concept introduced in Kuk et al. (1998).