Deriving priorities from inconsistent PCM using network algorithms

Marcin Anholcer , János Fülöp


In 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.
Author Marcin Anholcer (WIiGE / KBO)
Marcin Anholcer,,
- Department of Operations Research
, János Fülöp - Hungarian Academy of Sciences, Budapest, Hungary
János Fülöp,,
Journal seriesAnnals of Operations Research, ISSN 0254-5330, e-ISSN 1572-9338, (N/A 70 pkt)
Issue year2019
Publication size in sheets0.85
Keywords in EnglishPairwise comparisons, Shortest Path Problem, Network Simplex method, Pareto efficiency
ASJC Classification1800 General Decision Sciences; 1803 Management Science and Operations Research
Languageen angielski
Score (nominal)70
Score sourcejournalList
ScoreMinisterial score = 70.0, 03-04-2020, ArticleFromJournal
Publication indicators WoS Citations = 0; Scopus SNIP (Source Normalised Impact per Paper): 2018 = 1.334; WoS Impact Factor: 2018 = 2.284 (2) - 2018=2.267 (5)
Citation count*2 (2020-09-23)
Additional fields
UwagiFirst online 14 May 2018
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?