Deriving priorities from inconsistent PCM using network algorithms

Anholcer, M and Fülöp, János (2019) Deriving priorities from inconsistent PCM using network algorithms. ANNALS OF OPERATIONS RESEARCH, 274 (1-2). pp. 57-74. ISSN 0254-5330 10.1007/s10479-018-2888-x

[img] Text
Anholcer_57_27653089_z.pdf
Restricted to Registered users only

Download (360kB) | Request a copy
[img] Text
Anholcer_57_27653089_ny.pdf

Download (222kB)

Abstract

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.

Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence > Research Group of Operations Research and Decision Systems
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 25 Sep 2019 09:04
Last Modified: 25 Sep 2019 09:04
URI: http://eprints.sztaki.hu/id/eprint/9778

Update Item Update Item