REAL

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. ISSN 1435-246X

[img]
Preview
Text
Bozoki2003Manuscript.pdf

Download (1MB) | Preview

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 priorities of elements on the various levels 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), 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 problem for 3 x 3 matrices. We observe non-uniqueness and rank reversals by presenting numerical results.

Item Type: Article
Subjects: H Social Sciences / társadalomtudományok > HB Economic Theory / közgazdaságtudomány
H Social Sciences / társadalomtudományok > HB Economic Theory / közgazdaságtudomány > HB5 Mathematical economics / matematikai közgazdaságtan
Q Science / természettudomány > QA Mathematics / matematika
Q Science / természettudomány > QA Mathematics / matematika > QA72 Algebra / algebra
Depositing User: Dr. Sándor Bozóki
Date Deposited: 11 Sep 2018 13:32
Last Modified: 11 Sep 2018 13:32
URI: http://real.mtak.hu/id/eprint/83514

Actions (login required)

Edit Item Edit Item