Solving the least squares method problem in the AHP for 3X3 and 4X4 matrices

Bozóki, Sándor and Lewis, RH (2005) Solving the least squares method problem in the AHP for 3X3 and 4X4 matrices. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 13. pp. 255-270.

Full text not available from this repository.

Abstract

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 × 3 and 4 × 4 matrices is discussed in the paper. Our algorithms are based on the theory of resultants.

Item Type: Article
Uncontrolled Keywords: decision theory, pairwise comparison matrix, least squares method, polynomial system
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:17
Last Modified: 11 Dec 2012 15:17
URI: http://eprints.sztaki.hu/id/eprint/3948

Update Item Update Item