Consistency adjustments for pairwise comparison matrices

被引：28

作者：

Farkas, A

Lancaster, P ^{[1
]}

Rózsa, P

机构：

[1] Univ Calgary, Dept Math & Stat, Calgary, AB T2N 1N4, Canada

[2] IMC Grad Sch Business Adm, H-1051 Budapest, Hungary

[3] Tech Univ Budapest, Dept Comp Sci & Informat Theory, H-1521 Budapest, Hungary

来源：

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS | 2003年 / 10卷 / 08期

关键词：

symmetrically reciprocal; least squares; Newton-Kantorovich;

D O I：

10.1002/nla.318

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper is concerned with the development of a 'best' rank one transitive approximation to a general paired comparison matrix in a least-squares sense. A direct attack on the non-linear problem is frequently replaced by a sub-optimal linear problem and, here, the best procedure of this kind is obtained. The Newton-Kantorovich method for the solution of the non-linear problem is also studied, including the role of the best linear approximation as a starting point for this method. Numerical examples are included. Copyright (C) 2002 John Wiley Sons, Ltd.

引用

页码：689 / 700

页数：12

共 12 条

[1] APPROACHES TO CONSISTENCY ADJUSTMENT [J].