This paper presents a method for solving discrete choice problems characterized by multiple evaluative criteria. The proposed method, known as MAPPAC, is based on a pairwise comparison of alternatives relative to each pair of criteria, defining the two relations P (preference) and I (indifference), which constitute a complete preorder. Moreover, by aggregating these preferences, it is possible to obtain a variety of relations on a set of feasible actions.