Calculating maximum eigenvalues in pairwise comparison matrices for the analytic hierarchy process
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3943488 (Why is no real title available?)
- scientific article; zbMATH DE number 3983521 (Why is no real title available?)
- scientific article; zbMATH DE number 1766730 (Why is no real title available?)
- scientific article; zbMATH DE number 826245 (Why is no real title available?)
- A lexicographically optimal completion for pairwise comparison matrices with missing entries
- An initial value of Newton's method for the characteristic polynomial of 4th order PCM in AHP
- Efficient weight vectors from pairwise comparison matrices
- How to derive priorities in AHP: a comparative study
- Inconsistency indices in pairwise comparisons: an improvement of the consistency index
- Introduction to the analytic hierarchy process
- Numerical analysis for applied science
- On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
- On a maximum eigenvalue of third-order pairwise comparison matrix in analytic hierarchy process and convergence of Newton's method
- On some useful properties of the Perron eigenvalue of a positive reciprocal matrix in the context of the analytic hierarchy process
- On the monotonicity of the eigenvector method
- PROPERTIES OF A POSITIVE RECIPROCAL MATRIX AND THEIR APPLICATION TO AHP
- Right-left asymmetry of the eigenvector method: A simulation study
- Robustness of priority deriving methods for pairwise comparison matrices against rank reversal: a probabilistic approach
- Understanding the analytic hierarchy process
This page was built for publication: Calculating maximum eigenvalues in pairwise comparison matrices for the analytic hierarchy process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019998)