群组AHP排序向量加权最小几何距离平方法

A Minimum Weighted Priority Vectors Geometric Distance Square Method in GroupAHP

提出求解群组ＡＨＰ的排序向量加权最小几何距离平方法．对不同的专家给出的判断矩阵得出的排序向量提出向量加权最小几何距离平方和概念，以最优化原理求得最优解。

This paper puts forward a new method of GroupAHP: A minimum weighted priority vectors geometric distance square method. It gives the concept of minimum weighted geometric distance square the vector to the priority vectors calculated with the differences of the judgement matrixes given by experts. Through optimization theory can take the optimum solution. This is a practical and convenient method of groupAHP.