In this paper we present some duality assertions to a non-convex
multiobjective fractional optimization problem. To the primal
problem we attach an intermediate multiobjective convex
optimization problem, using an approach due to Dinkelbach, for which we construct then a dual problem. This
is expressed in terms of the conjugates of the numerator and
denominator of the components of the primal objective function as
well as the functions describing the set of constraints. The weak,
strong and converse duality statements for the intermediate
problems allow us to give dual characterizations for the efficient
solutions of the initial fractional problem.