## A consistency improving method in the analytic hierarchy process.(English)Zbl 1009.90513

Summary: We propose a method to modify a given comparison matrix, by which the consistency ratio (CR) value of the modified matrix is less than that of the original one, and give an algorithm to derive a positive reciprocal matrix with acceptable consistency (i.e., CR $$< 0.1$$), then the convergence theorem for the given algorithm is established and its practicality is shown by some examples.

### MSC:

 90B50 Management decision making, including multiple objectives

### Keywords:

analytic hierarchy process; comparison matrices
Full Text:

### References:

 [1] Vargas, L.G., An overview of the analytic hierarchy process and its applications, European journal of operational research, 48, 2-8, (1990) [2] Bryson, N., A goal programming method for generating priority vectors, Journal of operational research, 46, 641-648, (1995) · Zbl 0830.90001 [3] Blankmeyer, E., Approaches to consistency adjustment, Journal of optimization theory and applications, 54, 479-488, (1987) · Zbl 0597.90049 [4] Satty, T.L., Axiomatic foundation of the analytical hierarchy process, Management science, 32, 841-855, (1986) · Zbl 0596.90003 [5] T.L. Saaty, The analytic hierarchy process, McGraw-Hill, New York, 1980 · Zbl 0587.90002 [6] Weiyi, Ma.; Jiangyue, X.; Yixiang, W., A practical approach to modifying pairwise comparison matrices and two criteria of modificatory effectiveness, Systems science and systems engineering, 2, 334-338, (1993) [7] T.L. Saaty, Decision making for leaders, Wadsworth, Belmont, CA, 1982 [8] Ma. Weiye, An approximation method of improving consistency of pairwise comparison matrices, Decision and Analytic Hierarchy Process, Beijing, no. 2, 1990
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.