A simplified implementation of the least squares solution for pairwise comparisons matrices

DOI10.1007/s10100-010-0134-yzbMath1245.90039OpenAlexW2159678270MaRDI QIDQ441016

Sándor Bozóki, Volodymyr Babiy, Marcin Anholcer, Waldemar W. Koczkodaj

Publication date: 20 August 2012

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/65494/1/AnholcerBabiyBozokiKoczkodaj2011Manuscript.pdf

zbMATH Keywords

least squares methodpairwise comparison matrix

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Paired and multiple comparisons; multiple testing (62J15)

Related Items (5)

Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems ⋮ Efficient Vectors for Block Perturbed Consistent Matrices ⋮ Inconsistency indices for pairwise comparison matrices: a numerical study ⋮ Deriving priorities from inconsistent PCM using network algorithms ⋮ On partial sorting in restricted rounds

Cites Work

• On Saaty's and Koczkodaj's inconsistencies of pairwise comparison matrices
• Solution of the least squares method problem of pairwise comparison matrices
• A new definition of consistency of pairwise comparisons
• Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming

This page was built for publication: A simplified implementation of the least squares solution for pairwise comparisons matrices