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 sequences generated 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. Finally, we explore an application of the method to demand theory in economy, which can be dealt with using the proposed algorithm.