J 2024

Why We Need Desirable Properties in Pairwise Comparison Methods?

PERZINA, Radomír and Jaroslav RAMÍK

Basic information

Original name

Why We Need Desirable Properties in Pairwise Comparison Methods?

Authors

PERZINA, Radomír (203 Czech Republic, belonging to the institution) and Jaroslav RAMÍK (203 Czech Republic, belonging to the institution)

Edition

JOURNAL OF MULTI-CRITERIA DECISION ANALYSIS, 2024, 1057-9214

Other information

Language

English

Type of outcome

Article in a journal

Field of Study

10102 Applied mathematics

Country of publisher

United States of America

Confidentiality degree

is not subject to a state or trade secret

References:

Impact factor

Impact factor: 2.000 in 2022

Organization unit

School of Business Administration in Karvina

Keywords in English

analytic hierarchy process (AHP); coherence; consistency; intensity; multi-criteria decision-making (MCDM); pairwise comparison matrix; priority vector

Tags

Links

GA21-03085S, research and development project.
Changed: 6/3/2025 14:34, Miroslava Snopková

Abstract

V originále

Pairwise comparison matrices (PCMs) are inevitable tools in some important multiple-criteria decision-making methods, for example AHP/ANP, TOPSIS, PROMETHEE and others. In this paper, we investigate some important properties of PCMs which influence the generated priority vectors for the final ranking of the given alternatives. The main subproblem of the Analytic Hierarchy Process (AHP) is to calculate the priority vectors, that is, the weights assigned to the elements of the hierarchy (criteria, sub-criteria, and/or alternatives or variants), by using the information provided in the form of a pairwise comparison matrix. Given a set of elements, and a corresponding pairwise comparison matrix, whose entries evaluate the relative importance of the elements with respect to a given criterion, the final ranking of the given alternatives is evaluated. We investigate some important and natural properties of PCMs called the desirable properties, particularly, the non-dominance, consistency, intensity and coherence, which influence the generated priority vectors. Usually, the priority vector is calculated based on some well-known method, for example, the Eigenvector Method, the Arithmetic Mean Method, the Geometric Mean Method, the Least Square Method, and so forth. The novelty of our approach is that the priority vector is calculated as the solution of an optimization problem where an error objective function is minimised with respect to constraints given by the desirable properties. The properties of the optimal solution are discussed and some illustrating examples are presented. The corresponding software tool has been developed and demonstrated in some examples.