A method for solving LSM problems of small size in the AHP

Bozóki, Sándor (2003) A method for solving LSM problems of small size in the AHP. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 11. pp. 17-33.

[img] Text
Bozoki2003Abstract.html - Published Version
Restricted to Registered users only

Download (495B)

Abstract

The Analytic Hierarchy Process (AHP) is one of the most popular methods used in Multi-Attribute Decision Making. It provides with ratio-scale measurements of the prioirities of elements on the various leveles of a hierarchy. These priorities are obtained through the pairwise comparisons of elements on one level with reference to each element on the immediate higher level. The Eigenvector Method (EM) and some distance minimizing methods such as the Least Squares Method (LSM), Logarithmic Least Squares Method (LLSM), Weighted Least Squares Method (WLSM) and Chi Squares Method (X2M) are of the tools for computing the priorities of the alternatives. This paper studies a method for generating all the solutions of the LSM problems for 3 × 3 matrices. We observe non-uniqueness and rank reversals by presenting numerical results.

Item Type: Article
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:11
Last Modified: 11 Dec 2012 15:11
URI: http://eprints.sztaki.hu/id/eprint/3210

Update Item Update Item