2019
			
	    
	
	
    Some new properties of inconsistent pairwise comparisons matrices
RAMÍK, Jaroslav and Jiří MAZUREKBasic information
Original name
Some new properties of inconsistent pairwise comparisons matrices
	Authors
RAMÍK, Jaroslav (203 Czech Republic, guarantor, belonging to the institution) and Jiří MAZUREK (203 Czech Republic, belonging to the institution)
			Edition
 International Journal of Approximate Reasoning, Amsterdam, Nizozemí, Elsevier, 2019, 0888-613X
			Other information
Language
English
		Type of outcome
Article in a journal
		Field of Study
10200 1.2 Computer and information sciences
		Country of publisher
Netherlands
		Confidentiality degree
is not subject to a state or trade secret
		References:
Impact factor
Impact factor: 2.678
			RIV identification code
RIV/47813059:19520/19:A0000006
		Organization unit
School of Business Administration in Karvina
			UT WoS
000487166000007
		Keywords in English
AHP; Pairwise comparisons; Pairwise comparisons matrix; Inconsistency; Order of preferences
		Links
GA18-01246S, research and development project. 
			
				
				Changed: 21/4/2020 10:23, Ing. Petra Skoumalová
				
		Abstract
In the original language
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.