Analysis of selected prioritization methods in the analytic hierarchy process

被引:8
|
作者
Jablonsky, J. [1 ]
机构
[1] Univ Econ, Dept Econometr, Prague 13067 3, Czech Republic
关键词
D O I
10.1088/1742-6596/622/1/012033
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A crucial problem in the analytic hierarchy process (or its extension analytic network process) deriving priorities form pairwise comparison matrices. The most popular methods for deriving priorities are eigenvector method, which is originally proposed by Saaty [5], logarithmic least square method, and least square method. The paper deals with other alternative approaches using goal programming methodology - one of them is based on minimization of sum of absolute or relative deviations and the other one on minimization of maximum deviation. The results of methods are compared on a set of randomly generated matrices of different sizes and consistency levels.
引用
收藏
页数:7
相关论文
共 50 条