Weights from the least squares approximation of pairwise comparison matrices

Weights from the least squares approximation of pairwise comparison matrices

0.00 Avg rating0 Votes
Article ID: iaor20081051
Country: Hungary
Volume: 23
Issue: 1
Start Page Number: 121
End Page Number: 137
Publication Date: Jan 2006
Journal: Alkalmazott Matematikai Lapok
Authors:
Keywords: analytic hierarchy process
Abstract:

The method of pairwise comparisons is one of the tools for determining the weights of attributes or evaluating the alternatives in Multi Attribute Decision Making. The decision maker is requested to compare pairwise the importance of the attributes, then the rates are arranged in a matrix. The aim is to find the weight vector which best reflects the values given by the decision maker. There exist many distance minimizing methods, besides the Eigenvector Method (Analytic Hierarchy Process) for determining weights from a pairwise comparison matrix. One of them is the Least Squares Method, the solution of which leads to the optimization of a nonlinear, nonconvex function. In the paper, methods for solving the problem of least squares approximation of pairwise comparison matrices are presented. All methods are suitable for finding all local and global optima.

Reviews

Required fields are marked *. Your email address will not be published.