A method for solving LSM problems of small size in the AHP
  • Metaadatok
Tartalom: http://real.mtak.hu/83514/
Archívum: REAL
Gyűjtemény: Status = Published
Subject = H Social Sciences / társadalomtudományok: HB Economic Theory / közgazdaságtudomány
Subject = H Social Sciences / társadalomtudományok: HB Economic Theory / közgazdaságtudomány: HB5 Mathematical economics / matematikai közgazdaságtan
Subject = Q Science / természettudomány: QA Mathematics / matematika: QA72 Algebra / algebra
Subject = Q Science / természettudomány: QA Mathematics / matematika
Type = Article
Cím:
A method for solving LSM problems of small size in the AHP
Létrehozó:
Bozóki, Sándor
Kiadó:
Springer
Dátum:
2003
Téma:
HB Economic Theory / közgazdaságtudomány
HB5 Mathematical economics / matematikai közgazdaságtan
QA Mathematics / matematika
QA72 Algebra / algebra
Tartalmi leírás:
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.
Nyelv:
angol
Típus:
Article
PeerReviewed
info:eu-repo/semantics/article
Formátum:
text
Azonosító:
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
Kapcsolat: