Balancing pairwise comparison matrices by transitive matrices

DOI10.3233/FI-2016-1343MaRDI QIDQ2968849zbMATH OpenFDO

Authors András Farkas

Publication date 22 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2016-1343

zbMATH Keywords

diagonal similarity scalingleast squares optimization problemmatrix balancingnumerical mathematicspairwise comparison matrix

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• MATRIX BALANCING PROBLEM AND BINARY AHP(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Consistency adjustments for pairwise comparison matrices
• A recursive least-squares algorithm for pairwise comparison matrices
• Ranking alternatives - comparison of different methods based on binary comparison matrices
• Data perturbations of matrices of pairwise comparisons

Cited in

(7)

• Transitive matrices and their applications
• A method for approximating symmetrically reciprocal matrices by transitive matrices
• Minimization of the Perron eigenvalue of incomplete pairwise comparison matrices by Newton iteration
• A recursive least-squares algorithm for pairwise comparison matrices
• MATRIX BALANCING PROBLEM AND BINARY AHP(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Data perturbations of matrices of pairwise comparisons
• Scaling binary comparison matrices: A comment on Narasimhan's proposal and other methods

This page was built for publication: Balancing pairwise comparison matrices by transitive matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968849)