Duality theorems for multi-objective fractional programming with a new formulation of generalized convexity

In this paper,we present a new formulation of generalized convex function(F,α,ρ,θ)-b-convex function.Then three duality types of(MFP) which are Mond-Weir type,Lagrange type and Schaible type are discussed.At the same time,the weak duality theorems and strong duality theorems are proved for the three types of duality respectively based on the(F,α,ρ,θ)-b-convexity.