Two proofs and one algorithm related to the analytic hierarchy process
Summary: 36 years ago, Thomas Saaty introduced a new mathematical methodology, called Analytic Hierarchy Process (AHP), regarding the decision-making processes. The methodology was widely applied by Saaty and by other authors in the different human activity areas, like planning, business, education, healthcare, etc. but, in general, in the area of management. In this paper, we provide two new proofs for well-known statement that the maximal eigenvalue \(\lambda_{\max}\) is equal to \(n\) for the eigenvector problem \(Aw = \lambda w\), where \(A\) is, so-called, the consistent matrix of pairwise comparisons of type \(n\times n(n\geq 2)\) with the solution vector \(w\) that represents the probability components of disjoint events. Moreover, we suggest an algorithm for the determination of the eigenvalue problem solution \(Aw=nw\) as well as the corresponding flowchart. The algorithm for arbitrary consistent matrix \(A\) can be simply programmed and used.
- scientific article; zbMATH DE number 3943488
- Introduction to the analytic hierarchy process
- The approach to consistency in the analytic hierarchy process
- scientific article; zbMATH DE number 1766730
- A probability distribution and convergence of the consistency index u in the analytic hierarchy process
- Decision-making with the AHP: Why is the principal eigenvector necessary
- Determinants and their applications in mathematical physics
- Eigenvector method, consistency test and inconsistency repairing for an incomplete fuzzy preference relation
- scientific article; zbMATH DE number 3943488 (Why is no real title available?)
This page was built for publication: Two proofs and one algorithm related to the analytic hierarchy process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741699)
