摘要
运用层次分析法(AHP)解决决策问题时,第一步就是要确定问题的递阶层次结构.对此,现有文献中给出的数学方法都是基于可达矩阵的,它通常需要借助计算机来完成.在文中充分考虑到AHP递阶层次结构的特点严格的逐层相关性及元素间无互相关性,给出一种非常简单的方法—划列法(DRM),并严格证明了其正确性,然后通过举例给予说明.该方法使递阶层次结构的确定不必再进行可达矩阵等计算,只依靠手工即可完成.
The first step of applying AHP to make a decision is to determine the hierarchy model. For this, the mathematic method introduced by the present references is based on reachability matrix, which be usually accomplished with a computer. In this paper, the characteristics of hierarchy model of AHP is sufficiently considered, which are strict relativity between two close together layers and non-relativity with each other between two elements. A simple and convenient method is presented and illustrated, named as delete-row method（DRM）. The correctness of the method is strictly proved. It is using the m. ethod to determine the hierarchy model that needn＇t calculate reachability matrix and so on. It can be completed only by artificial calculation.
出处
《数学的实践与认识》
CSCD
北大核心
2005年第6期194-197,共4页
Mathematics in Practice and Theory
关键词
递阶层次结构
层次分析法
AHP
可达矩阵
划列法
analytic hie：archy process
hierarchy model
algorithm
delete-row method （DRM）
