A New Algorithm to Improve the Inconsistent Comparison Matrix
一种新的改进不一致判断矩阵的方法

The inconsistent comparison matrix has to be improved often when using the analytical hierarchy process (AHP). There are three shortcomings in the existing methods . First,the most inconsistent element one can find using these methods is not the same and the result is that the improvement to the inconsistent matrix is not the same,and they cannot offer more suggestions. Second,the improvement extent is not clear after one element is improved. Third,one can not be sure of the improvement step .In this paper, a new algorithm is proposed and it calculates value of the element when the matrix can obtain the best consistency,analyzes the distance of original value and improved value,then find to be an effective way through two examples the most inconsistent element to improve.