Deriving priorities from inconsistent PCM using network algorithms
Marcin Anholcer , János Fülöp
AbstractIn several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to approximate the PCM with a consistent one. One of the approaches is to minimize the distance between the matrices, most often the Euclidean distance. In the paper we consider the problem of minimizing the maximum distance. After applying the logarithmic transformation we are able to formulate the obtained subproblem as a Shortest Path Problem and solve it more efficiently. We analyze the structure of the set of optimal solutions and prove some of its properties. This allows us to provide an iterative algorithm that results in a unique, Pareto-efficient solution.
|Journal series||Annals of Operations Research, ISSN 0254-5330, e-ISSN 1572-9338, (N/A 70 pkt)|
|Publication size in sheets||0.85|
|Keywords in English||Pairwise comparisons, Shortest Path Problem, Network Simplex method, Pareto efficiency|
|Score||= 70.0, 03-04-2020, ArticleFromJournal|
|Publication indicators||= 0; : 2018 = 1.334; : 2018 = 2.284 (2) - 2018=2.267 (5)|
|Citation count*||2 (2020-09-23)|
|Uwagi||First online 14 May 2018|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.