Abstract:

The problem of the satisfying consistency of linguistic judgment matrix with strict preference relation and the approach for regulating consistency are studied in this paper. Firstly， we judge whether a linguistic judgment matrix has satisfying consistency according to whether its0-1permutation preference relation matrix is upper triangular matrix. Then， a definition of cyclic matrix is presented， we can get all the teams of judgment elements that are illegitimate in the linguistic judgment matrix form the cyclic matrix and thereby efficiently adjust circle according to row preference value. The ranking of alternatives and linguistic judgment matrix with satisfying consistency are gotten. Finally， we present an example to demonstrate the validity and the practicality of this method.