COMPARISON OF PRIORITIZATION METHODS IN ANALYTIC HIERARCHY PROCESS

被引:0
|
作者
Jablonsky, Josef [1 ]
机构
[1] Univ Econ, Prague Fac Informat & Stat, Prague 13067 3, Czech Republic
关键词
analytic hierarchy process; goal programming; optimization;
D O I
暂无
中图分类号
F [经济];
学科分类号
02 ;
摘要
A crucial problem in the analytic hierarchy/network process is how to derive priorities form pairwise comparison matrices. The most popular methods for deriving priorities are eigenvector method proposed originally by T. Saaty, logarithmic least square method and least square method. The paper deals with other alternative approaches using methodology of goal programming - 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.
引用
收藏
页码:98 / 102
页数:5
相关论文
共 50 条