Some new properties of inconsistent pairwise comparisons matrices

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19520%2F19%3AA0000006" target="_blank" >RIV/47813059:19520/19:A0000006 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.sciencedirect.com/science/article/abs/pii/S0888613X1830608X" target="_blank" >https://www.sciencedirect.com/science/article/abs/pii/S0888613X1830608X</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ijar.2019.07.002" target="_blank" >10.1016/j.ijar.2019.07.002</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Some new properties of inconsistent pairwise comparisons matrices

Popis výsledku v původním jazyce

Saaty's approach in the AHP framework divides inconsistent pairwise comparisons (PC) matrices into two categories, those with the acceptable inconsistency (with the consistency ratio equal to or under 0.10 threshold) and those with unacceptable inconsistency (above that threshold). The aim of this paper is to show that such a division is not appropriate, hence a new categorization of inconsistent matrices is proposed with respect to a satisfaction/violation of selected logical properties, such as the fundamental selection (FS) condition, the preservation of order preference (POP) condition, and the preservation of order of intensity of preference (POIP) condition. Moreover, a new non-linear optimization method for the derivation of weights (i.e. priority vector) is proposed such that the three aforementioned logical conditions are met. In the numerical part of the paper it is examined how frequently are the FS, POP and POIP conditions satisfied or violated for randomly generated PC matrices.

Název v anglickém jazyce

Some new properties of inconsistent pairwise comparisons matrices

Popis výsledku anglicky

Saaty's approach in the AHP framework divides inconsistent pairwise comparisons (PC) matrices into two categories, those with the acceptable inconsistency (with the consistency ratio equal to or under 0.10 threshold) and those with unacceptable inconsistency (above that threshold). The aim of this paper is to show that such a division is not appropriate, hence a new categorization of inconsistent matrices is proposed with respect to a satisfaction/violation of selected logical properties, such as the fundamental selection (FS) condition, the preservation of order preference (POP) condition, and the preservation of order of intensity of preference (POIP) condition. Moreover, a new non-linear optimization method for the derivation of weights (i.e. priority vector) is proposed such that the three aforementioned logical conditions are met. In the numerical part of the paper it is examined how frequently are the FS, POP and POIP conditions satisfied or violated for randomly generated PC matrices.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

<a href="/cs/project/GA18-01246S" target="_blank" >GA18-01246S: Nestandardní optimalizační a rozhodovací metody v manažerských procesech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Approximate Reasoning

ISSN

0888-613X

e-ISSN

—

Svazek periodika

Vol. 113

Číslo periodika v rámci svazku

October 2019

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

14

Strana od-do

119-132

Kód UT WoS článku

000487166000007

EID výsledku v databázi Scopus

—