PRIORITY EIGENVECTORS IN ANALYTIC HIERARCHY/NETWORK PROCESSES WITH OUTER DEPENDENCE BETWEEN ALTERNATIVES AND CRITERIA
This work continues consideration of the relations between Analytic Hierarchy and Network processes. It shows that in the case of a simple network with outer dependence between alternatives and criteria, the priority vectors can be constructed not only via the powered supermatrix but also by the eigenvectors of the supermatrix. The relationship to the AHP least squares approach and other methods of priority estimation are considered as well. An ANP matrix of local eigenvectors includes priorities for all the compared items in the whole network. Here we interpret the complex AHP/ANP connections and show clearly how they result in priority estimations useful for applied decision making.