Solving the least squares method problem in the AHP for \(3 \times 3\) and \(4\times 4\) matrices
From MaRDI portal
Publication:2493239
zbMath1136.90396MaRDI QIDQ2493239
Robert H. Lewis, Sándor Bozóki
Publication date: 12 June 2006
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Quadratic programming (90C20) Management decision making, including multiple objectives (90B50) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (7)
On the extraction of weights from pairwise comparison matrices ⋮ Deriving the weights for aggregating judgments in a multi-group problem: an application to curriculum development in entrepreneurship ⋮ An exact global optimization method for deriving weights from pairwise comparison matrices ⋮ A method for approximating pairwise comparison matrices by consistent matrices ⋮ On pairwise comparison matrices that can be made consistent by the modification of a few elements ⋮ On the choice of weights for aggregating judgments in non-negotiable AHP group decision making ⋮ Solution of the least squares method problem of pairwise comparison matrices
This page was built for publication: Solving the least squares method problem in the AHP for \(3 \times 3\) and \(4\times 4\) matrices
