Abstract
In several methods of multiattribute decision making, pairwise comparison matrices are applied to derive implicit weights for a given set of decision alternatives. A class of the approaches is based on the approximation of the pairwise comparison matrix by a consistent matrix. In the paper this approximation problem is considered in the least-squares sense. In general, the problem is nonconvex and difficult to solve, since it may have several local optima. In the paper the classic logarithmic transformation is applied and the problem is transcribed into the form of a separable programming problem based on a univariate function with special properties. We give sufficient conditions of the convexity of the objective function over the feasible set. If such a sufficient condition holds, the global optimum of the original problem can be obtained by local search, as well. For the general case, we propose a branch-and-bound method. Computational experiments are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blankmeyer E.: Approaches to consistency adjustments. J. Optim. Theory Appl. 54, 479–488 (1987)
Bozóki S.: A method for solving the LSM problems of small size in the AHP. Cent. Eur. J. Oper. Res. 11, 17–33 (2003)
Bozóki S.: Weights from the least squares approximation of pairwise comparison matrices (in Hungarian). Alkalmazott Matematikai Lapok. 23, 121–137 (2006)
Bozóki, S.: Weights from pairwise comparisons and evaluation by using utility functions in multi-attribute decision problems. Ph.D. Dissertation, Corvinus University of Budapest, Budapest (2006)
Bozóki S., Lewis R.H.: Solving the Least Squares Method problem in the AHP for 3 × 3 and 4 × 4 matrices. Cent. Eur. J. Oper. Res. 13, 255–270 (2005)
Bryson N.: A goal programming method for generating priority vectors. J. Oper. Res. Soc. 46, 641–648 (1995)
Burkard R.E., Hamacher H.W., Rote G.: Sandwich approximation of univariate convex functions with an application to separable convex programming. Nav. Res. Log. 38, 911–924 (1991)
Carrizosa E.: Deriving weights in multiple-criteria decision making with support vector machines. TOP 14, 399–424 (2006)
Carrizosa E., Messine F.: An exact global optimization method for deriving weights from pairwise comparison matrices. J. Glob. Optimi. 38, 237–247 (2007)
Choo E.U., Wedley W.C.: A common framework for deriving preference values from pairwise comparison matrices. Comp. Oper. Res. 31, 893–908 (2004)
Chu M.T.: On the optimal consistent approximation to pairwise comparison matrices. Linear Algebra Appl. 272, 155–168 (1997)
Chu A.T.W., Kalaba R.E., Spingarn K.: A comparison of two methods for determining the weight belonging to fuzzy sets. J. Optim. Theory Appl. 4, 531–538 (1979)
Crawford G., Williams C.: A note on the analysis of subjective judgment matrices. J. Math. Psychol. 29, 387–405 (1985)
De Jong P.: A statistical approach to Saaty’s scaling method for priorities. J. Math. Psychol. 28, 467–478 (1984)
Farkas, A.: Cardinal Measurement of Consumer’s Preferences. Ph.D. Dissertation, Budapest University of Technology and Economics, Budapest (2004)
Farkas A., Rózsa P.: Data perturbations of matrices of pairwise comparisons. Ann. Oper. Res. 101, 401–425 (2001)
Farkas A., Rózsa P.: On the non-uniqueness of the solution to the least-squares optimization of pairwise comparison matrices, Acta Polytech. Hung. J. Appl. Sci. at Budapest Tech Hungary 1, 1–20 (2004)
Farkas A., Lancaster P., Rózsa P.: Consistency adjustment for pairwise comparison matrices. Numerical Linear Algebra Appl. 10, 689–700 (2003)
Gass S.I., Rapcsák T.: Singular value decomposition in AHP. Eur. J. Oper. Res. 154, 573–584 (2004)
Golany B., Kress M.: A multicriteria evaluation method for obtaining weights from ratio-scale matrices. Eur. J. Oper. Res. 69, 210–220 (1993)
Jensen, R.E.: Comparison of eigenvector, least squares, chi squares and logarithmic least squares methods of scaling a reciprocal matrix. Working paper 153, Trinity University (1983)
Jensen R.E.: Alternative scaling method for priorities in hierarchical structures. J. Math. Psychol. 28, 317–332 (1984)
Kurosh A.G.: Higher Algebra. Mir Publishers, Moscow (1972)
Mészáros, Cs.: BPMPD version 2.21. Optimization Methods and Software. 11-12, CD Supplement, Software section (1999) (http://www.sztaki.hu/~meszaros/bpmpd/)
Mikhailov L.: A fuzzy programming method for deriving priorities in the analytic hiarerchy process. J. Oper. Res. Soc. 51, 341–349 (2000)
Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Pren-tice-Hall, Englewood Cliffs (1982)
Rapcsák, T.: Convexification of functions by nonlinear coordinate transformations. In: Giannessi, F., Pardalos, P., Rapcsák, T. (eds.) Optimization Theory, pp. 179–189. Kluwer (2001)
Saaty T.L.: A scaling method for priorities in hierarchical structures. J. Math. Psychol. 15, 234–281 (1977)
Saaty T.L.: The Analytic Hierarchy Process. McGraw-Hill, New York (1980)
Tawarmalani M, Sahinidis N.V.: Convexification and Global Optimization in Continuous and Mixed-integer Nonlinear Programming. Kluwer, Dordrecht (2002)
Tuy H.: Convex Analysis and Global Optimization. Kluwer, Dordrecht (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fülöp, J. A method for approximating pairwise comparison matrices by consistent matrices. J Glob Optim 42, 423–442 (2008). https://doi.org/10.1007/s10898-008-9303-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-008-9303-0