Efficient vectors in priority setting methodology

From MaRDI portal
Publication:6435809

arXiv2305.04886MaRDI QIDQ6435809FDOQ6435809


Authors: S. Furtado, Charles R. Johnson Edit this on Wikidata


Publication date: 4 May 2023

Abstract: The Analytic Hierarchy Process (AHP) is a much discussed method in ranking business alternatives based on empirical and judgemental information. We focus here upon the key component of deducing efficient vectors for a reciprocal matrix of pair-wise comparisons. It is not known how to produce all efficient vectors. It has been shown that the entry-wise geometric mean of all columns is efficient for any reciprocal matrix. Here, by combining some new basic observations with some known theory, we 1) give a method for inductively generating large collections of efficient vectors, and 2) show that the entry-wise geometric mean of any collection of distinct columns of a reciprocal matrix is efficient. Based on numerical simulations, there seems to be no clear advantage over either the geometric mean of all columns or the right Perron eigenvector of a reciprocal matrix.













This page was built for publication: Efficient vectors in priority setting methodology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435809)