Multiobjective fractional duality

The concept of efficiency (Pareto optimum) is used to formulate duality for multiobjective fractional programming problems. We consider programs where the components of the objective function have non-negative and convex numerators while the denominators are concave and positive. For this case the Mond-Weir extension of Bector dual analogy is given. We also give the Schaible type vector dual. The case where functions are ρ-convex (weakly or strongly convex) is also considered.