Article ID: | iaor1996582 |
Country: | United Kingdom |
Volume: | 46 |
Issue: | 5 |
Start Page Number: | 641 |
End Page Number: | 648 |
Publication Date: | May 1995 |
Journal: | Journal of the Operational Research Society |
Authors: | Bryson Noel |
Keywords: | programming: goal, analytic hierarchy process |
The generation of priority vectors from pairwise comparison information is an integral part of the Analytic Hierarchy Process. Traditionally, either the right eigenvector method or the logarithmic least squares method have been used. In this paper, a goal programming method (GPM) is presented that has, as its objective, the generation of the priority vector whose associated comparison values are, on average, the closest to the pairwise comparison information provided by the evaluator. The GPM possesses the properties of correctness in the consistent case, comparison order invariance, smoothness, and power invariance. Unlike other methods, it also possesses the additional property that the presence of a single outlier cannot prevent the identification of the correct priority vector. The GPM also has a pair of naturally meaningful consistency indicators that offer the opportunity for empowering the decision maker. The GPM is thus an attractive alternative to other proposed methods.