Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems

This paper studies a class of multiobjective generalized fractional programming problems,where the numerators of objective functions are the sum of differentiable function and convex function,while the denominators are the difference of differentiable function and convex function.Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given,and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of(F,α,ρ,d)-V -convexity.Subsequently,the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.