摘要
Ｓａａｔｙ提出的特征向量排序方法（ＥＭ）已被广泛应用于层次分析（ＡＨＰ）中．本文提出一种判断矩阵排序的最小扰动法（ＬＰＭ），并给出一个收敛性迭代算法和一些算例．ＬＰＭ在几个重要方面优于ＥＭ．理论分析和数据结果表明：ＬＰＭ是一种可行且有效的排序方法．
The eigenvector method (EM) proposed by T.L.Saaty has been popularly used at each branching of the Analytic Hierarchy Process (AHP). It is an especially effective tool for analyzing hierarchical problems. In this paper, we present a least perturbations method (LPM) to derive the priority vectors of judgement matrices and give a simple convergent iterative algorithm and some numerical examples. The LPM is preferable to the EM in several important respects. Theoretical analysis and the numerical results all show that the LPM is feasible and effective.
出处
《运筹学学报》
CSCD
2000年第4期47-54,共8页
Operations Research Transactions
基金
Research supported by NSF of China and Shandong.
关键词
层次分析法
判断矩阵
最小扰动法
the Analytic Hierarchy Process
judgement matrix
the least perturbations method
