Solving the Least Squares Method problem in the AHP for 3 X 3 and 4 x 4 matrices

摘要

The Analytic Hierarchy Process (AHP) is one of the most popular methods used in Multi-Attribute Decision Making. The Eigenvector Method (EM) and some distance minimizing methods such as the Least Squares Method (LSM) are of the possible tools for computing the priorities of the alternatives. A method for generating all the solutions of the LSM problem for 3 x 3 and 4x4 matrices is discussed in the paper. Our algorithms a,re based on the theory of resultants.