MCDM'12 - paper no. 1


 

Back to MCDM'12 contents
 

ALGORITHM FOR DERIVING PRIORITIES FROM INCONSISTENT PAIRWISE COMPARISON MATRICES

Marcin Anholcer

Abstract:

In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is inconsistence of given PCM. In such a situation it is important to approximate the PCM with a consistent one. The most common way is to minimize the Euclidean distance between the matrices. In the paper we consider minimization of the maximum distance.

Keywords:

Heuristics, nonlinear programming, decision making, pairwise comparison.

Reference index:

Marcin Anholcer, (2012), ALGORITHM FOR DERIVING PRIORITIES FROM INCONSISTENT PAIRWISE COMPARISON MATRICES, Multiple Criteria Decision Making (7), pp. 9-17

Full text:

download