In this paper we present two inexact scalarization proximal point methods to solve quasiconvex multiobjective minimization problems on Hadamard manifolds. Under standard assumptions on the problem we prove that the two sequence generates by the algorithms converge to a Pareto critical point of the problem and for the convex case the sequences converge to a weak Pareto solution. In addition, we give a proof of the linear and superlinear convergence rate of one of these methods.