The complete set of efficient vectors for a reciprocal matrix (2305.05307v2)

Abstract: Efficient vectors are the natural set from which to choose a cardinal ranking vector for a pairwise comparison matrix. Such vectors are the key to certain business project selection models. Many ways to construct specific efficient vectors have been proposed. Yet, no previous method to produce all efficient vectors was known. Here, using some graph theoretic ideas, as well as a numerical extension technique, we show how to generate inductively all efficient vectors for any given pairwise comparison matrix. We apply this method to give a matricial proof of the fact that the set of efficient vectors and other related sets are piecewise linearly connected. In addition, we determine explicitly all efficient vectors for a 4-by-4 pairwise comparison matrix. Several examples are provided.