All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Some new properties of inconsistent pairwise comparisons matrices

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Some new properties of inconsistent pairwise comparisons matrices

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

    <a href="/en/project/GA18-01246S" target="_blank" >GA18-01246S: Non-standard optimization and decision-making methods in management processes</a><br>

  • Continuities

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

Others

  • Publication year

    2019

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    International Journal of Approximate Reasoning

  • ISSN

    0888-613X

  • e-ISSN

  • Volume of the periodical

    Vol. 113

  • Issue of the periodical within the volume

    October 2019

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    14

  • Pages from-to

    119-132

  • UT code for WoS article

    000487166000007

  • EID of the result in the Scopus database