# Optimal Inconsistency Repairing of Pairwise Comparison Matrices Using Integrated Linear Programming and Eigenvector Methods

Authors: Haiqing Zhang; Aicha Sekhari; Yacine Ouzrout; Abdelaziz Bouras
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

Satisfying consistency requirements of pairwise comparison matrix (PCM) is a critical step in decision making methodologies. An algorithm has been proposed to find a new modified consistent PCM in which it can replace the original inconsistent PCM in analytic hierarchy process (AHP) or in fuzzy AHP. This paper defines the modified consistent PCM by the original inconsistent PCM and an adjustable consistent PCM combined. The algorithm adopts asegment tree to gradually approach the greatest lower bound of the distance with the original PCM to obtain the middle value of an adjustable PCM. It also proposes a theorem to obtain the lower value and the upper value of an adjustable PCM based on two constraints. The experiments for crisp elements show that the proposed approach can preserve more of the original information than previous works of the same consistent value. The convergence rate of our algorithm is significantly faster than previous works with respect to different parameters. The experiments for fuzzy elements show that our method could obtain suitable modified fuzzy PCMs.


---

## Body

## 1. Introduction

Analytic Hierarchy Process (AHP) is developed by Saaty [1], which is a multicriterion decision-making methodology widely used in many real problems [2, 3]. The AHP methodology expresses the relative importance of criteria by pairwise comparisons and converts the values of pairwise comparisons to priorities. Fuzzy AHP methodology [4] is an advanced AHP methodology, which is used to tackle the uncertainty and inaccurate problems in multicriteria decision-making process. Fuzzy AHP derives the fuzzy priorities of criteria from pairwise comparisons matrix with triangular (or trapezoidal) fuzzy elements. To make sure the priorities of each criterion are accurate and sensible, consistency of pairwise comparison matrix (PCM) with crisp or fuzzy elements must be achieved.Several works [5–8] focus on reducing inconsistent PCMs with crisp numbers. Karapetrovic and Rosenbloom [5] revised the single entry of a ratio’s value till the consistency of relative matrix was at an acceptable level. Xu and Wei [6] preserved the initial ratios’ value in the pairwise comparison matrix while obtaining satisfactory consistency requirements. Cao et al. [7] developed a heuristic approach, which can preserve more of the original information compared to Xu and Wei [6]. However, for these three works, when the consistency requirement is increased, the computing times will be largely increased and the information on the original matrix cannot be well preserved. Anholcer’s [8] work is used to minimize the distance between inconsistent PCMs and their corresponding consistent PCM. The aim of this work is to find out a new modified PCM which is consistent and has the closest resemblance to the optimal one. But the modified new matrix has a long distance with the original matrix according to the analysis of the parameters given in [6, 7].Some works used to solve the inconsistency of PCMs with fuzzy elements are given in [9–12]. Xu and Wang [9] repaired incomplete and inconsistent fuzzy preference relations by finding out the unusual and false element until the consistency ratio was at a satisfactory level. Leung and Cao [10] proposed a new definition of fuzzy positive reciprocal matrix by setting deviation tolerances based on an idea of allowing inconsistent information. Morteza and Bafandeh [11] further discussed Leung and Cao’s work and proposed a new method of fuzzy consistency tests by direct fuzzification of a QR (quick response) algorithm, which is one of the methods for the eigenvalues calculation of an arbitrary matrix. Wang and Chen [12] applied fuzzy linguistic preference relations to construct consistent PCMs by considering reducing the number of pairwise comparisons. However, these works do not have standard parameters to verify the reliability of their theory so far. Therefore, it is very important to prove the feasibility of a methodology that can reduce the inconsistency of the original matrix and preserve the original matrix’s information as much as possible.In this research work, we propose a modified consistent PCM as a combination of original inconsistent PCM and an adjustable consistent PCM. In order to achieve the modified PCM, this paper is structured in the following way: Section2 and Section 3 give the basic concepts of the PCM with fuzzy and crisp elements, consistency indices for crisp and fuzzy elements, and parameters to judge the effectiveness of the modified matrix. Section 4 and Section 5 propose an algorithm to obtain the middle value, upper value, and lower value of the adjustable matrix. The main idea of our algorithm is to find the optimum priority vector by solving a linear programming problem and use the eigenvector method to obtain the adjustable matrix based on the optimum priority vector. In Section 6, the algorithm was applied to obtain the adjustable PCM by adopting the same illustrating PCM in [6, 7]; the comparison results show that our algorithm can preserve more original information than Cao et al. [7] and Xu and Wei [6]. In Section 7, the algorithm was used to find the sensible and the closest consistent modified PCM with fuzzy elements. The experiments show that the new modified matrix can satisfy consistent indices’ requirements of NI [13] and CCI [14, 15] and also can preserve more original information under parameters of σ
fuzzy and δ
fuzzy. Section 8 concludes with effective and efficient analysis to show that our algorithm can be performed easily.


## 2. State of the Art

### 2.1. Notations and Definitions

Them
×
n pairwise comparison matrix A
~ with triangular fuzzy elements can be described in the following:
(1)
A
~
=
(
(
a
11
L
,
a
11
M
,
a
11
U
)
⋯
(
a
1
n
L
,
a
1
n
M
,
a
1
n
U
)
⋮
⋱
⋮
(
a
m
1
L
,
a
m
1
M
,
a
m
1
U
)
⋯
(
a
m
n
L
,
a
m
n
M
,
a
m
n
U
)
)
,
where for each element a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
), a
i
j
L is the lower value, a
i
j
M is the middle value, and a
i
j
U is the upper value. In the particular situation, if m
=
n, when the following condition is satisfied, then A
~ is a reciprocal matrix:
(2)
a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
)
hh
implies
a
~
j
i
=
(
1
a
i
j
U
,
1
a
i
j
M
,
1
a
i
j
L
)
hhhhhhhhhhhhhhhhhhhhhhhh
∀
i
,
j
=
1,2
,
…
,
n
,
where 1
/
σ
<
a
i
j
L
<
a
i
j
M
<
a
i
j
U
<
σ and S
=
[
1
/
σ
,
σ
], σ
>
1. S is an interval of real numbers called fuzzy scale. Crisp numbers (nonfuzzy numbers) are special cases of A
~ when a
i
j
L
=
a
i
j
M
=
a
i
j
U.Definition 1.
Asit was proposed by Buckley [16], a fuzzy positive reciprocal matrix A
~
=
[
a
~
i
j
]
n
×
n is consistent if and only if a
~
i
k
⊙
a
~
k
j
≈
a
~
i
j, {
∀
i
,
j
,
k
∣
1
≤
i
,
j
,
k
≤
n
}.Where the operator⊙ is one of the operation rules of triangular fuzzy elements, this operation can be calculated by the following equation:
(3)
a
~
i
k
⊙
a
~
k
j
=
(
a
i
k
L
,
a
i
k
M
,
a
i
k
U
)
⊙
(
a
k
j
L
,
a
k
j
M
,
a
k
j
U
)
=
(
a
i
k
L
·
a
k
j
L
,
a
i
k
M
·
a
k
j
M
,
a
i
k
U
·
a
k
j
U
)
≈
a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
)
.When positive reciprocal matrixA
~ is crisp numbers A, then the consistent condition is a
i
k
·
a
k
j
=
a
i
j, {
∀
i
,
j
,
k
∣
1
≤
i
,
j
,
k
≤
n
}.However, this definition is too strict, because it is unrealistic to reach perfect consistency of a PCM (crisp or fuzzy elements). Some works [10, 13, 17–23] have developed consistency indices to accept a certain level of deviations. We will adopt consistency indices in Section 2.2 to determine whether the current PCM matrix is at an acceptable consistency level.


### 2.2. Consistency Indices

Several consistency indices have been proposed for crisp numbers: for instance, geometric consistency index [17], singular value decomposition method [18], and harmonic consistency index [19]. However, it was proven that all these consistency indices are linear or nonlinear transformations of Satty’s CR [20]. Therefore, we use Satty’s CR in this paper for measuring consistency of crisp numbers.The consistency index of CR [20] is defined as follows:
(4)
CR
=
λ
max
⁡
-
n
n
-
1
·
1
RI
,
where λ
max
⁡ is the principle eigenvalue of A. RI is random index, which can be gotten by searching a defined table. When the value of 0
<
CR
<
0.1, the consistency can be accepted.Several important works focus on the consistency of pairwise comparison matrix with fuzzy elements. The first one is Leung and Cao [10], who proposed a notion with consideration of a tolerance deviation. However, the notion is strongly related to Satty’s CR and it has shortcomings to calculate consistency of pairwise comparison matrix with fuzzy elements [11]. The second one is Ramík and Korviny’s [13] work, which proposes a new consistency index NI to examine fuzzy elements based on the distance of the matrix to a special ratio matrix and compare the properties with CR. This work has been further studied and has been used by several important works [21–23]. We have tested this work’s performance. The results indicated that it can satisfy reasonable results with fuzzy elements, although it has some shortcomings [23].The consistency index of NI [13] is defined as follows:
(5)
N
I
n
σ
=
γ
n
σ
·
max
⁡
i
,
j
{
max
⁡
{
|
ω
i
L
ω
j
U
-
a
i
j
L
|
,
|
ω
i
M
ω
j
M
-
a
i
j
M
|
,
{
|
ω
i
L
ω
j
U
a
i
j
L
|
,
,
|
ω
i
M
ω
j
M
|
|
ω
i
U
ω
j
L
-
a
i
j
U
|
}
}
(
1
≤
i
,
j
≤
n
)
,
where γ
n
σ is a normalization factor and the values of ω
i
L, ω
i
M, and ω
i
U can be obtained from a
i
j
L, a
i
j
M, and a
i
j
U.Another successful index that can be extracted from [14, 15] is that they extend GCI (geometric consistency index) [24] to CCI (centric consistency index) to deal with PCM with triangle fuzzy elements. The consistency index CCI is defined as follows:
(6)
CCI
(
A
~
)
=
2
(
n
-
1
)
(
n
-
2
)
×
∑
i
<
j
(
(
ω
i
L
+
ω
i
M
+
ω
i
U
ω
j
L
+
ω
j
M
+
ω
j
U
)
log
⁡
(
a
i
j
L
+
a
i
j
M
+
a
i
j
U
3
)
-
log
⁡
(
ω
i
L
+
ω
i
M
+
ω
i
U
ω
j
L
+
ω
j
M
+
ω
j
U
)
)
2
,
where A
~
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
) are the elements for fuzzy PCM; ω
~
=
(
ω
~
i
) is a priority vector derived by logarithmic least squares. When CCI
(
A
~
)
=
0, A
~ is considered fully consistent. Thresholds remain identical with index GCI as CCI being a fuzzy extension of GCI. The thresholds are provided as follows: CCI
=
0.3147 for n
=
3, CCI
=
0.3526 for n
=
4, and CCI
=
0.370 for n
>
4 based on Aguarón and Moreno-Jiménez [24].In conclusion, we will adopt CR to examine the consistency of crisp elements and use NI and CCI to examine the consistency of fuzzy elements.


### 2.3. Parameters to Judge the Effectiveness of Modified Matrix

Next, we are going to describe the necessary parameters which can be used to measure the effectiveness of modified PCMB. Xu and Wei [6] have given two parameters in the following:
(7)
δ
=
max
⁡
i
,
j
{
|
b
i
j
-
a
i
j
|
}
,
i
,
j
=
1,2
,
…
,
n
,
(8)
σ
=
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
-
a
i
j
)
2
n
.
σ and δ are used as the parameters of modificatory effectiveness. The authors of [6, 7] argue that a modified matrix that preserves the most information of the original one must satisfy the following condition: 0
<
δ
<
2 and 0
<
σ
<
1. Extending these two parameters to be suitable to judge modificatory effectiveness of fuzzy elements so the range is identical with σ and δ, σ
fuzzy and δ
fuzzy are
(9)
δ
fuzzy
=
max
⁡
i
,
j
{
|
b
i
j
~
-
a
i
j
~
|
}
=
max
⁡
i
,
j
{
|
b
i
j
L
-
a
i
j
L
|
,
|
b
i
j
M
-
a
i
j
M
|
,
hhhhh
|
b
i
j
U
-
a
i
j
U
|
}
,
hh
i
,
j
=
1,2
,
…
,
n
,
σ
fuzzy
=
(
max
⁡
{
(
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
L
-
a
i
j
L
)
2
)
,
hhhhhhh
(
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
M
-
a
i
j
M
)
2
)
,
hhhhhhh
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
U
-
a
i
j
U
)
2
}
)
1
/
2
n
-
1
.Besidesσ and δ, two parameters proposed by Xu and Wei [6], we propose a third parameter should be added, which is Condition of Order Preservation (COP) (Table 3) [25]. For example, suppose the original matrix A has alternatives (a
1, a
2, a
3, and a
4); it has that the relationship a
1 dominates a
2 and a
3 dominates a
4, and the judgments indicate that the extent to which a
1 dominates a
2 is greater than the extent to which a
3 dominates a
4; then the priority vector ω should satisfy ω
(
a
1
)
>
ω
(
a
2
) and ω
(
a
3
)
>
ω
(
a
4
) (preservation of order of preference) and ω
(
a
1
)
/
ω
(
a
2
)
>
ω
(
a
3
)
/
ω
(
a
4
) (preservation of order of intensity of preference).


## 2.1. Notations and Definitions

Them
×
n pairwise comparison matrix A
~ with triangular fuzzy elements can be described in the following:
(1)
A
~
=
(
(
a
11
L
,
a
11
M
,
a
11
U
)
⋯
(
a
1
n
L
,
a
1
n
M
,
a
1
n
U
)
⋮
⋱
⋮
(
a
m
1
L
,
a
m
1
M
,
a
m
1
U
)
⋯
(
a
m
n
L
,
a
m
n
M
,
a
m
n
U
)
)
,
where for each element a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
), a
i
j
L is the lower value, a
i
j
M is the middle value, and a
i
j
U is the upper value. In the particular situation, if m
=
n, when the following condition is satisfied, then A
~ is a reciprocal matrix:
(2)
a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
)
hh
implies
a
~
j
i
=
(
1
a
i
j
U
,
1
a
i
j
M
,
1
a
i
j
L
)
hhhhhhhhhhhhhhhhhhhhhhhh
∀
i
,
j
=
1,2
,
…
,
n
,
where 1
/
σ
<
a
i
j
L
<
a
i
j
M
<
a
i
j
U
<
σ and S
=
[
1
/
σ
,
σ
], σ
>
1. S is an interval of real numbers called fuzzy scale. Crisp numbers (nonfuzzy numbers) are special cases of A
~ when a
i
j
L
=
a
i
j
M
=
a
i
j
U.Definition 1.
Asit was proposed by Buckley [16], a fuzzy positive reciprocal matrix A
~
=
[
a
~
i
j
]
n
×
n is consistent if and only if a
~
i
k
⊙
a
~
k
j
≈
a
~
i
j, {
∀
i
,
j
,
k
∣
1
≤
i
,
j
,
k
≤
n
}.Where the operator⊙ is one of the operation rules of triangular fuzzy elements, this operation can be calculated by the following equation:
(3)
a
~
i
k
⊙
a
~
k
j
=
(
a
i
k
L
,
a
i
k
M
,
a
i
k
U
)
⊙
(
a
k
j
L
,
a
k
j
M
,
a
k
j
U
)
=
(
a
i
k
L
·
a
k
j
L
,
a
i
k
M
·
a
k
j
M
,
a
i
k
U
·
a
k
j
U
)
≈
a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
)
.When positive reciprocal matrixA
~ is crisp numbers A, then the consistent condition is a
i
k
·
a
k
j
=
a
i
j, {
∀
i
,
j
,
k
∣
1
≤
i
,
j
,
k
≤
n
}.However, this definition is too strict, because it is unrealistic to reach perfect consistency of a PCM (crisp or fuzzy elements). Some works [10, 13, 17–23] have developed consistency indices to accept a certain level of deviations. We will adopt consistency indices in Section 2.2 to determine whether the current PCM matrix is at an acceptable consistency level.


## 2.2. Consistency Indices

Several consistency indices have been proposed for crisp numbers: for instance, geometric consistency index [17], singular value decomposition method [18], and harmonic consistency index [19]. However, it was proven that all these consistency indices are linear or nonlinear transformations of Satty’s CR [20]. Therefore, we use Satty’s CR in this paper for measuring consistency of crisp numbers.The consistency index of CR [20] is defined as follows:
(4)
CR
=
λ
max
⁡
-
n
n
-
1
·
1
RI
,
where λ
max
⁡ is the principle eigenvalue of A. RI is random index, which can be gotten by searching a defined table. When the value of 0
<
CR
<
0.1, the consistency can be accepted.Several important works focus on the consistency of pairwise comparison matrix with fuzzy elements. The first one is Leung and Cao [10], who proposed a notion with consideration of a tolerance deviation. However, the notion is strongly related to Satty’s CR and it has shortcomings to calculate consistency of pairwise comparison matrix with fuzzy elements [11]. The second one is Ramík and Korviny’s [13] work, which proposes a new consistency index NI to examine fuzzy elements based on the distance of the matrix to a special ratio matrix and compare the properties with CR. This work has been further studied and has been used by several important works [21–23]. We have tested this work’s performance. The results indicated that it can satisfy reasonable results with fuzzy elements, although it has some shortcomings [23].The consistency index of NI [13] is defined as follows:
(5)
N
I
n
σ
=
γ
n
σ
·
max
⁡
i
,
j
{
max
⁡
{
|
ω
i
L
ω
j
U
-
a
i
j
L
|
,
|
ω
i
M
ω
j
M
-
a
i
j
M
|
,
{
|
ω
i
L
ω
j
U
a
i
j
L
|
,
,
|
ω
i
M
ω
j
M
|
|
ω
i
U
ω
j
L
-
a
i
j
U
|
}
}
(
1
≤
i
,
j
≤
n
)
,
where γ
n
σ is a normalization factor and the values of ω
i
L, ω
i
M, and ω
i
U can be obtained from a
i
j
L, a
i
j
M, and a
i
j
U.Another successful index that can be extracted from [14, 15] is that they extend GCI (geometric consistency index) [24] to CCI (centric consistency index) to deal with PCM with triangle fuzzy elements. The consistency index CCI is defined as follows:
(6)
CCI
(
A
~
)
=
2
(
n
-
1
)
(
n
-
2
)
×
∑
i
<
j
(
(
ω
i
L
+
ω
i
M
+
ω
i
U
ω
j
L
+
ω
j
M
+
ω
j
U
)
log
⁡
(
a
i
j
L
+
a
i
j
M
+
a
i
j
U
3
)
-
log
⁡
(
ω
i
L
+
ω
i
M
+
ω
i
U
ω
j
L
+
ω
j
M
+
ω
j
U
)
)
2
,
where A
~
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
) are the elements for fuzzy PCM; ω
~
=
(
ω
~
i
) is a priority vector derived by logarithmic least squares. When CCI
(
A
~
)
=
0, A
~ is considered fully consistent. Thresholds remain identical with index GCI as CCI being a fuzzy extension of GCI. The thresholds are provided as follows: CCI
=
0.3147 for n
=
3, CCI
=
0.3526 for n
=
4, and CCI
=
0.370 for n
>
4 based on Aguarón and Moreno-Jiménez [24].In conclusion, we will adopt CR to examine the consistency of crisp elements and use NI and CCI to examine the consistency of fuzzy elements.


## 2.3. Parameters to Judge the Effectiveness of Modified Matrix

Next, we are going to describe the necessary parameters which can be used to measure the effectiveness of modified PCMB. Xu and Wei [6] have given two parameters in the following:
(7)
δ
=
max
⁡
i
,
j
{
|
b
i
j
-
a
i
j
|
}
,
i
,
j
=
1,2
,
…
,
n
,
(8)
σ
=
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
-
a
i
j
)
2
n
.
σ and δ are used as the parameters of modificatory effectiveness. The authors of [6, 7] argue that a modified matrix that preserves the most information of the original one must satisfy the following condition: 0
<
δ
<
2 and 0
<
σ
<
1. Extending these two parameters to be suitable to judge modificatory effectiveness of fuzzy elements so the range is identical with σ and δ, σ
fuzzy and δ
fuzzy are
(9)
δ
fuzzy
=
max
⁡
i
,
j
{
|
b
i
j
~
-
a
i
j
~
|
}
=
max
⁡
i
,
j
{
|
b
i
j
L
-
a
i
j
L
|
,
|
b
i
j
M
-
a
i
j
M
|
,
hhhhh
|
b
i
j
U
-
a
i
j
U
|
}
,
hh
i
,
j
=
1,2
,
…
,
n
,
σ
fuzzy
=
(
max
⁡
{
(
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
L
-
a
i
j
L
)
2
)
,
hhhhhhh
(
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
M
-
a
i
j
M
)
2
)
,
hhhhhhh
∑
i
=
1
n
∑
j
=
1
n
(
b
i
j
U
-
a
i
j
U
)
2
}
)
1
/
2
n
-
1
.Besidesσ and δ, two parameters proposed by Xu and Wei [6], we propose a third parameter should be added, which is Condition of Order Preservation (COP) (Table 3) [25]. For example, suppose the original matrix A has alternatives (a
1, a
2, a
3, and a
4); it has that the relationship a
1 dominates a
2 and a
3 dominates a
4, and the judgments indicate that the extent to which a
1 dominates a
2 is greater than the extent to which a
3 dominates a
4; then the priority vector ω should satisfy ω
(
a
1
)
>
ω
(
a
2
) and ω
(
a
3
)
>
ω
(
a
4
) (preservation of order of preference) and ω
(
a
1
)
/
ω
(
a
2
)
>
ω
(
a
3
)
/
ω
(
a
4
) (preservation of order of intensity of preference).


## 3. Main Theories to Obtain Modified PCM

### 3.1. Distance Analysis between Original Matrix and Modified Matrix

To measure the distance from original PCMA (or A
~), several methods can be used [26–30]. The PCM A
~ can be considered as the combination of three matrixes of PCM A. If the measuring distance methodologies for crisp A have been properly handled, then they can be suitable for fuzzy A
~ as well. We will first discuss the distance methods for crisp numbers. The measurement has logarithmic least square method (LSM) [26, 31], eigenvector method [27, 28], and least squares method [29, 30]. The optimum eigenvector should be as close as possible to the original eigenvector (derived from the original matrix). The adjustable matrix could strongly resemble the original matrix once the optimum eigenvector has been determined. Therefore, eigenvector can be used to calculate adjustable PCM B
′
(
B
~
′
).According to [27, 28, 32], if matrix A is consistent, then we could find positive weights ω
=
{
ω
1
,
ω
2
,
…
,
ω
n
}
T which can satisfy such condition a
i
j
=
ω
i
/
ω
j, ∀
i
,
j
∈
(
1,2
,
…
,
n
). Therefore, if matrix A is close to consistent, then it must have (
ω
i
/
ω
j
)
-
a
i
j
≈
0. On the basis of this idea, we want to obtain the minimum value of the fastest distance between ω
i
/
ω
j and a
i
j. The fastest distance between ω
i
/
ω
j and a
i
j is defined as follows:
(10)
f
=
max
⁡
(
|
a
i
j
-
ω
i
ω
j
|
)
.The issue of finding the optimal modified matrix can be portrayed as resolving the minimum value of functionf, which can be expressed in the following equation:
(11)
G
(
A
,
ω
)
=
min
⁡
(
f
)
=
min
⁡
(
max
⁡
(
|
a
i
j
-
ω
i
ω
j
|
)
)
.This equation can reach the absolute minimum value (lowest point) when even the worst situation of proportion ofω
i
/
ω
j is closest to a
i
j. The method to obtain the optimum positive eigenvector ω is to find out all possible constraints and obtain feasible solutions by selecting a suitable linear programming pattern.


### 3.2. Constraints Analysis for Achieving Modified Matrix

The new modified PCMB (or B
~) should satisfy three conditions: (1) the consistent value should be at an acceptable level; (2) the farthest distance between new PCM B (or B
~) and orginal PCM A (or A
~) should be as small as possible; (3) the obtained new matrix should have a strong similarity with the original matrix. These three conditions can guarantee a new consistent PCM B (or B
~) which has the closest and maximal similarity with the orginal inconsistent PCM A (or A
~). To suit these conditions, we provide an adjustable PCM which can reduce the inconsistency of original PCM as much as possible. On the basis of the adjustable matrix, we propose the definition of the modified matrix.Definition 2.
The new modified PCMB is defined as a combination of the original PCM A and an adjustable matrix called B
′, which is derived from A; the modified PCM B is defined in
(12)
B
=
a
i
j
β
(
b
i
j
′
)
1
-
β
.For fuzzy elements, the new modified PCMB
~ is defined as follows:
(13)
B
~
=
{
(
(
a
i
j
L
)
β
·
(
b
i
j
L
′
)
1
-
β
)
,
(
(
a
i
j
M
)
β
·
(
b
i
j
M
′
)
1
-
β
)
,
(
(
a
i
j
U
)
β
·
(
b
i
j
U
′
)
1
-
β
)
}
.The properties of the adjustable PCMB (or B
~) and the way to obtain them will be studied in Section 4.


## 3.1. Distance Analysis between Original Matrix and Modified Matrix

To measure the distance from original PCMA (or A
~), several methods can be used [26–30]. The PCM A
~ can be considered as the combination of three matrixes of PCM A. If the measuring distance methodologies for crisp A have been properly handled, then they can be suitable for fuzzy A
~ as well. We will first discuss the distance methods for crisp numbers. The measurement has logarithmic least square method (LSM) [26, 31], eigenvector method [27, 28], and least squares method [29, 30]. The optimum eigenvector should be as close as possible to the original eigenvector (derived from the original matrix). The adjustable matrix could strongly resemble the original matrix once the optimum eigenvector has been determined. Therefore, eigenvector can be used to calculate adjustable PCM B
′
(
B
~
′
).According to [27, 28, 32], if matrix A is consistent, then we could find positive weights ω
=
{
ω
1
,
ω
2
,
…
,
ω
n
}
T which can satisfy such condition a
i
j
=
ω
i
/
ω
j, ∀
i
,
j
∈
(
1,2
,
…
,
n
). Therefore, if matrix A is close to consistent, then it must have (
ω
i
/
ω
j
)
-
a
i
j
≈
0. On the basis of this idea, we want to obtain the minimum value of the fastest distance between ω
i
/
ω
j and a
i
j. The fastest distance between ω
i
/
ω
j and a
i
j is defined as follows:
(10)
f
=
max
⁡
(
|
a
i
j
-
ω
i
ω
j
|
)
.The issue of finding the optimal modified matrix can be portrayed as resolving the minimum value of functionf, which can be expressed in the following equation:
(11)
G
(
A
,
ω
)
=
min
⁡
(
f
)
=
min
⁡
(
max
⁡
(
|
a
i
j
-
ω
i
ω
j
|
)
)
.This equation can reach the absolute minimum value (lowest point) when even the worst situation of proportion ofω
i
/
ω
j is closest to a
i
j. The method to obtain the optimum positive eigenvector ω is to find out all possible constraints and obtain feasible solutions by selecting a suitable linear programming pattern.


## 3.2. Constraints Analysis for Achieving Modified Matrix

The new modified PCMB (or B
~) should satisfy three conditions: (1) the consistent value should be at an acceptable level; (2) the farthest distance between new PCM B (or B
~) and orginal PCM A (or A
~) should be as small as possible; (3) the obtained new matrix should have a strong similarity with the original matrix. These three conditions can guarantee a new consistent PCM B (or B
~) which has the closest and maximal similarity with the orginal inconsistent PCM A (or A
~). To suit these conditions, we provide an adjustable PCM which can reduce the inconsistency of original PCM as much as possible. On the basis of the adjustable matrix, we propose the definition of the modified matrix.Definition 2.
The new modified PCMB is defined as a combination of the original PCM A and an adjustable matrix called B
′, which is derived from A; the modified PCM B is defined in
(12)
B
=
a
i
j
β
(
b
i
j
′
)
1
-
β
.For fuzzy elements, the new modified PCMB
~ is defined as follows:
(13)
B
~
=
{
(
(
a
i
j
L
)
β
·
(
b
i
j
L
′
)
1
-
β
)
,
(
(
a
i
j
M
)
β
·
(
b
i
j
M
′
)
1
-
β
)
,
(
(
a
i
j
U
)
β
·
(
b
i
j
U
′
)
1
-
β
)
}
.The properties of the adjustable PCMB (or B
~) and the way to obtain them will be studied in Section 4.


## 4. Calculation Processes of Obtaining Adjustable Matrix

### 4.1. Problem Statement

The aim of this paper is to find out a consistent matrixB
~
=
[
b
~
i
j
]
n
×
n which can preserve the most information of the original matrix A
~
=
[
a
~
i
j
]
n
×
n and be the closest to A
~. One method to achieve this aim is that setting one element of B
~ is b
~
i
j
=
(
b
i
j
L
,
b
i
j
M
,
b
i
j
U
) and one element of A
~ is a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
), by making every element of B
~ closely resemble the elements of A
~, which is b
i
j
L
≐
a
i
j
L, b
i
j
M
≐
a
i
j
M, and b
i
j
U
≐
a
i
j
U. Therefore, we go to find b
i
j
L
,
b
i
j
M
,
b
i
j
U separately. After finding out b
i
j
L
,
b
i
j
M
,
b
i
j
U, combine them together to get the new matrix B
~.On the basis of this idea, we build an adjustable matrixB
~
′
=
[
b
~
i
j
′
]
n
×
n which can reduce the inconsistency of the original matrix. The new modified matrix is constructed by two parts. (1) One is the original matrix. The function of this matrix is to keep the original information and make sure the two matrixes are in an acceptable distance. (2) One is the adjustable matrix. The function of this matrix is to modify the inconsistency level to make sure the new modified matrix’s consistency is based on consistency indexes. The mathematical expression objective is as follows:
(14)
B
~
=
A
~
⊙
B
~
′
.The mathematical expression objective can be developed as(15)
B
~
=
{
(
(
a
i
j
L
)
β
·
(
b
i
j
L
′
)
1
-
β
)
,
(
(
a
i
j
M
)
β
·
(
b
i
j
M
′
)
1
-
β
)
,
(
(
a
i
j
U
)
β
·
(
b
i
j
U
′
)
1
-
β
)
}
.This equation is also suitable whena
i
j
L
=
a
i
j
M
=
a
i
j
U, which is for crisp elements.


### 4.2. Stage 1: Specify Formulas to Obtain the Middle Valueb
i
j
M
′ of the Adjustable Matrix B
~
′

First, we go to calculateb
i
j
M
′ of adjustable matrix B
~
′. b
i
j
M
′ should have a strong relationship with a
i
j
M. ω
~
M is the eigenvector matrix of a
i
j
M. b
i
j
M
′ can be gotten in the following equation:
(16)
b
i
j
M
′
≈
ω
i
M
ω
j
M
.The value can be gotten when the proportion is closest toa
i
j
M. Equation (17) has feasible solutions which means the following equation reaches the minimum based value on (11):
(17)
G
(
a
i
j
M
,
ω
~
M
)
=
min
⁡
(
max
⁡
(
|
a
i
j
M
-
ω
i
M
ω
j
M
|
)
)
.We can simply write the variable by introducing an additional variableZ
=
G
(
a
i
j
M
,
ω
~
M
). Then, the problem is as follows:minZ
s.t.(18)
|
a
i
j
M
-
ω
i
M
ω
j
M
|
≤
Z
,
∀
i
,
j
∈
(
1,2
,
.
.
.
,
n
)
(19)
1
σ
≤
ω
i
M
,
ω
j
M
≤
σ
,
j
=
1,2
,
.
.
.
,
n
. (The calculation steps of (19) are given in the appendix.)Assume the value ofZ is given, and then the constraint (18) can be rewritten as follows:
(20)
-
Z
≤
(
a
i
j
M
-
ω
i
M
ω
j
M
)
≤
Z
,
(21)
(
a
i
j
M
-
Z
)
·
ω
j
M
-
ω
i
M
≤
0
,
(22)
ω
i
M
≤
(
a
i
j
M
+
Z
)
·
ω
j
M
.Take the reciprocal of constraint (22); then the new constraints (23), (24), and (25) can be gotten:
(23)
ω
j
M
ω
i
M
≥
1
(
a
i
j
M
+
Z
)
,
(24)
1
(
a
i
j
M
+
Z
)
·
ω
i
M
-
ω
j
M
≤
0
,
(25)
1
(
a
j
i
M
+
Z
)
·
ω
j
M
-
ω
i
M
≤
0
.Combine constraint (21) and constraint (25) and remove one of the inequalities, and then the new inequality can be gotten:
(26)
-
ω
i
M
+
(
max
⁡
{
(
a
i
j
M
-
Z
)
,
1
(
a
j
i
M
+
Z
)
}
)
ω
j
M
≤
0
.Analogously, a similar inequality can be gotten:(27)
-
ω
j
M
+
(
max
⁡
{
(
a
j
i
M
-
Z
)
,
1
(
a
i
j
M
+
Z
)
}
)
ω
i
M
≤
0
.Next, we add slack variableS, T, and objective function H
=
S
+
T, to change the constraints (26)-(27) to equality constraints
(28)
-
ω
i
M
+
(
max
⁡
{
(
a
i
j
M
-
Z
)
,
1
(
a
j
i
M
+
Z
)
}
)
ω
j
M
+
S
=
0
,
-
ω
j
M
+
(
max
⁡
{
(
a
j
i
M
-
Z
)
,
1
(
a
i
j
M
+
Z
)
}
)
ω
i
M
+
T
=
0
,
H
=
S
+
T
,
0
≤
S
,
T
,
H
.Now we specify constraints, propose formulas to calculateω
i
M, ω
j
M, and add additional stopping parameter X. Then constraints (28) correspond to the following linear programming problem:minX
s.t.(29)
-
ω
i
M
+
(
max
⁡
{
(
a
i
j
M
-
Z
)
,
1
(
a
j
i
M
+
Z
)
}
)
ω
j
M
+
S
=
0
(30)
-
ω
j
M
+
(
max
⁡
{
(
a
j
i
M
-
Z
)
,
1
(
a
i
j
M
+
Z
)
}
)
ω
i
M
+
T
=
0
(31)
H
=
S
+
T
(32)
ω
1
M
+
X
=
1
(33)
1
σ
≤
ω
i
M
,
ω
j
M
≤
σ
i
,
j
=
1,2
,
…
,
n
(34)
0
≤
Z
,
S
,
T
,
H
.Note 1.
(1) In constraint (29), we define ω
1
M
=
1 to normalize vector ω
~
M. If the stopping parameter X
=
0, then it means constraint (29) has a solution, and the problem (29)–(34) has a feasible solution; the value of ω
i
M is the optimal solution. If the stopping parameter is X
=
1 which contradicts with constraint (32), then the problem (29)–(34) is inconsistent; then the value of ω
i
M is not the optimal solution.
(2) The equalities (29)–(34) can be solved bysimplex algorithm [33]. The main idea of this algorithm is to walk along edges of the polytope to find out extreme points with lower and lower objective values till the minimum value is reached or an unbounded edge is visited. If the extreme point is reached, then the problem (29)–(34) has feasible solutions.
(3) IfZ
=
Z
′ can make problem (29)–(34) have a feasible solution, then it must have Z
≥
Z
′ that can also make the problem (29)–(34) have a feasible solution. In order to find thegreatest lower bound of
Z, we investigate it in Section 4.3.
(4) Ifi
=
j, then a
i
i
M
=
1; then constraint (29) can be rewritten as follows: -
ω
i
M
+
(
max
⁡
{
(
a
i
i
M
-
Z
)
,
1
/
(
a
i
i
M
+
Z
)
}
)
+
S
=
0. This equality must always be satisfied. Analogously, constraint (30) is always satisfied. Then the equalities (29)–(34) can be used to find adjustable PCM B
′ for original PCM A.
(5) In this section, we aim to find out the least absolute worst distance by setting a more precise priority weights range and adding slack variables, and an iterative way to obtain feasible solutions will be proposed in Section4.3.


### 4.3. Stage 2: Find Feasible Solutions to Obtain the Middle Valueb
i
j
M
′ of Adjustable Matrix B
~
′

Next, we focus on how to find out thegreatest lower bound of
Z. The problem can be described as storing intervals of [
0
,
Z
max
⁡
], analyzing the corresponding X value, and finding thegreatest lower bound of
Z that makes X
=
0. This problem can be solved bysegment tree.Substep
1 (sets the initial value). Assume the accuracy level is ξ; let the initial value of ω
i
M be (
∏
j
=
1
n
a
i
j
M
)
1
/
n, and ω
1
M
=
1; let Z
max
⁡
=
Z
=
G
(
a
i
j
M
,
ω
~
M
), and Z
min
⁡
=
Z
=
0.Substep
2 (builds a segment tree by using interval
[
0
,
Z
]
). For example, in Figure 1, [
0
,
Z
] is the interval, and P1, P2, P3, P4 is the list of distinct interval endpoints. We separate intervals into two parts in every division and terminate this process till the value of the interval is less than the accuracy level (ξ). Then obtain the X value in problem (29)–(34) by setting the current Z value. If X
=
0, then the next Z value is equal to the lower bound of the current node. The calculation steps will end till it reaches endpoints (P1; P2; P3; P4) based on accuracy level ξ.Figure 1
The structure of thesegment tree.Substep
3. Select the greatest lower value of Z when X
=
0; obtain the feasible solution of ω
i
M, ω
j
M to achieve b
i
j
M
′.Note 2.
Thesegment tree is special for storing intervals. The built time is O
(
n
log
⁡
n
) for n intervals, and it uses O
(
n
log
⁡
n
) storage. The reason we adapted to thesegment tree is because the segments can be stored in any arbitrary manner, it can easily be adapted to counting queries, and it helps us to query the number of segments that contain a given point.


### 4.4. Stage 3: Obtain theb
i
j
L
′ and b
i
j
U
′ of the Adjustable Matrix B
~
′

Once the optimal solution (b
i
j
M
′) has been obtained, next, we focus on obtaining the value of b
i
j
L
′ and b
i
j
U
′. The modified matrix is a combination of the adjustable matrix and the original matrix based on Definition 2; then the adjustable matrix should have the minimum fuzziness and maximum preservation of the original matrix’s pattern. If B
~
′ is minimum fuzziness, then fuzziness of B
~ will mostly come from A
~, and B
~ will be more similar with A
~. In fact, the minimum fuzziness of B
~
′ could reduce uncertainty factors of B
~. If B
~
′ could maximally preserve the pattern of A
~, then the combination of B
~
′ and A
~ could reach the most potential of similarity with A
~. We propose Theorem 3 to obtain the value of b
i
j
L
′ and b
i
j
U
′ based on the above theory.Theorem 3.
The optimal solution vector isω
i
M; then B
i
j
M
′
=
ω
i
M
/
ω
j
M, i
=
1,2
,
…
,
n. Set C
L, C
U as arbitrary positive constants. Define the value of ω
i
L, ω
i
U in the following formulas:
(35)
ω
i
L
=
C
L
·
ω
i
M
,
w
h
e
r
e
C
L
=
min
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
L
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
L
)
1
/
n
}
,
ω
i
U
=
C
U
·
ω
i
M
,
w
h
e
r
e
C
U
=
max
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
U
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
U
)
1
/
n
}Then the value ofb
i
j
L
′ and b
i
j
U
′ is defined as follows:
(36)
b
i
j
L
′
=
ω
i
L
ω
j
L
,
b
i
j
U
′
=
ω
i
U
ω
j
U
.Proof.
The value ofC
L and C
U should satisfy two conditions: one is minimum fuzziness of ω
i
M, and the other one is maximally maintaining similarity of original matrix A
~.
By the first condition, we can get(37)
ω
i
L
≤
ω
i
M
≤
ω
i
U
,
ω
i
L
=
C
min
⁡
ω
i
M
,
ω
i
U
=
C
max
⁡
ω
i
M
.
By the second condition, we need to consider the distance betweena
i
j
L, a
i
j
M, and a
i
j
U, maintain the relationship among the original matrix, and make the new matrix closest to the original matrix’s pattern. It means to find out the smallest coefficient between a
i
j
L and a
i
j
M and the smallest coefficient between a
i
j
M and a
i
j
U. We can get the following formulas based on the second condition:
(38)
C
min
⁡
=
min
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
L
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
L
)
1
/
n
}
,
C
max
⁡
=
max
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
U
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
U
)
1
/
n
}
.
Therefore, we can prove formula (35) exists and prove that it is correct by (38). To be more precise, for instance, in Figure 2, (
b
~
i
j
)
2
′ is not satisfied with condition 1, and then it is not the minimum fuzziness of associated weights. If (
b
~
i
j
)
1
′ is not satisfied with condition 2, then it does not have the same pattern with matrix A
~. (
b
~
i
j
)
3
′ is the optimal solution.Choosing optimal matrixB
~
′ which is closest to matrix A
~.
(a)
(b)


## 4.1. Problem Statement

The aim of this paper is to find out a consistent matrixB
~
=
[
b
~
i
j
]
n
×
n which can preserve the most information of the original matrix A
~
=
[
a
~
i
j
]
n
×
n and be the closest to A
~. One method to achieve this aim is that setting one element of B
~ is b
~
i
j
=
(
b
i
j
L
,
b
i
j
M
,
b
i
j
U
) and one element of A
~ is a
~
i
j
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
), by making every element of B
~ closely resemble the elements of A
~, which is b
i
j
L
≐
a
i
j
L, b
i
j
M
≐
a
i
j
M, and b
i
j
U
≐
a
i
j
U. Therefore, we go to find b
i
j
L
,
b
i
j
M
,
b
i
j
U separately. After finding out b
i
j
L
,
b
i
j
M
,
b
i
j
U, combine them together to get the new matrix B
~.On the basis of this idea, we build an adjustable matrixB
~
′
=
[
b
~
i
j
′
]
n
×
n which can reduce the inconsistency of the original matrix. The new modified matrix is constructed by two parts. (1) One is the original matrix. The function of this matrix is to keep the original information and make sure the two matrixes are in an acceptable distance. (2) One is the adjustable matrix. The function of this matrix is to modify the inconsistency level to make sure the new modified matrix’s consistency is based on consistency indexes. The mathematical expression objective is as follows:
(14)
B
~
=
A
~
⊙
B
~
′
.The mathematical expression objective can be developed as(15)
B
~
=
{
(
(
a
i
j
L
)
β
·
(
b
i
j
L
′
)
1
-
β
)
,
(
(
a
i
j
M
)
β
·
(
b
i
j
M
′
)
1
-
β
)
,
(
(
a
i
j
U
)
β
·
(
b
i
j
U
′
)
1
-
β
)
}
.This equation is also suitable whena
i
j
L
=
a
i
j
M
=
a
i
j
U, which is for crisp elements.


## 4.2. Stage 1: Specify Formulas to Obtain the Middle Valueb
i
j
M
′ of the Adjustable Matrix B
~
′

First, we go to calculateb
i
j
M
′ of adjustable matrix B
~
′. b
i
j
M
′ should have a strong relationship with a
i
j
M. ω
~
M is the eigenvector matrix of a
i
j
M. b
i
j
M
′ can be gotten in the following equation:
(16)
b
i
j
M
′
≈
ω
i
M
ω
j
M
.The value can be gotten when the proportion is closest toa
i
j
M. Equation (17) has feasible solutions which means the following equation reaches the minimum based value on (11):
(17)
G
(
a
i
j
M
,
ω
~
M
)
=
min
⁡
(
max
⁡
(
|
a
i
j
M
-
ω
i
M
ω
j
M
|
)
)
.We can simply write the variable by introducing an additional variableZ
=
G
(
a
i
j
M
,
ω
~
M
). Then, the problem is as follows:minZ
s.t.(18)
|
a
i
j
M
-
ω
i
M
ω
j
M
|
≤
Z
,
∀
i
,
j
∈
(
1,2
,
.
.
.
,
n
)
(19)
1
σ
≤
ω
i
M
,
ω
j
M
≤
σ
,
j
=
1,2
,
.
.
.
,
n
. (The calculation steps of (19) are given in the appendix.)Assume the value ofZ is given, and then the constraint (18) can be rewritten as follows:
(20)
-
Z
≤
(
a
i
j
M
-
ω
i
M
ω
j
M
)
≤
Z
,
(21)
(
a
i
j
M
-
Z
)
·
ω
j
M
-
ω
i
M
≤
0
,
(22)
ω
i
M
≤
(
a
i
j
M
+
Z
)
·
ω
j
M
.Take the reciprocal of constraint (22); then the new constraints (23), (24), and (25) can be gotten:
(23)
ω
j
M
ω
i
M
≥
1
(
a
i
j
M
+
Z
)
,
(24)
1
(
a
i
j
M
+
Z
)
·
ω
i
M
-
ω
j
M
≤
0
,
(25)
1
(
a
j
i
M
+
Z
)
·
ω
j
M
-
ω
i
M
≤
0
.Combine constraint (21) and constraint (25) and remove one of the inequalities, and then the new inequality can be gotten:
(26)
-
ω
i
M
+
(
max
⁡
{
(
a
i
j
M
-
Z
)
,
1
(
a
j
i
M
+
Z
)
}
)
ω
j
M
≤
0
.Analogously, a similar inequality can be gotten:(27)
-
ω
j
M
+
(
max
⁡
{
(
a
j
i
M
-
Z
)
,
1
(
a
i
j
M
+
Z
)
}
)
ω
i
M
≤
0
.Next, we add slack variableS, T, and objective function H
=
S
+
T, to change the constraints (26)-(27) to equality constraints
(28)
-
ω
i
M
+
(
max
⁡
{
(
a
i
j
M
-
Z
)
,
1
(
a
j
i
M
+
Z
)
}
)
ω
j
M
+
S
=
0
,
-
ω
j
M
+
(
max
⁡
{
(
a
j
i
M
-
Z
)
,
1
(
a
i
j
M
+
Z
)
}
)
ω
i
M
+
T
=
0
,
H
=
S
+
T
,
0
≤
S
,
T
,
H
.Now we specify constraints, propose formulas to calculateω
i
M, ω
j
M, and add additional stopping parameter X. Then constraints (28) correspond to the following linear programming problem:minX
s.t.(29)
-
ω
i
M
+
(
max
⁡
{
(
a
i
j
M
-
Z
)
,
1
(
a
j
i
M
+
Z
)
}
)
ω
j
M
+
S
=
0
(30)
-
ω
j
M
+
(
max
⁡
{
(
a
j
i
M
-
Z
)
,
1
(
a
i
j
M
+
Z
)
}
)
ω
i
M
+
T
=
0
(31)
H
=
S
+
T
(32)
ω
1
M
+
X
=
1
(33)
1
σ
≤
ω
i
M
,
ω
j
M
≤
σ
i
,
j
=
1,2
,
…
,
n
(34)
0
≤
Z
,
S
,
T
,
H
.Note 1.
(1) In constraint (29), we define ω
1
M
=
1 to normalize vector ω
~
M. If the stopping parameter X
=
0, then it means constraint (29) has a solution, and the problem (29)–(34) has a feasible solution; the value of ω
i
M is the optimal solution. If the stopping parameter is X
=
1 which contradicts with constraint (32), then the problem (29)–(34) is inconsistent; then the value of ω
i
M is not the optimal solution.
(2) The equalities (29)–(34) can be solved bysimplex algorithm [33]. The main idea of this algorithm is to walk along edges of the polytope to find out extreme points with lower and lower objective values till the minimum value is reached or an unbounded edge is visited. If the extreme point is reached, then the problem (29)–(34) has feasible solutions.
(3) IfZ
=
Z
′ can make problem (29)–(34) have a feasible solution, then it must have Z
≥
Z
′ that can also make the problem (29)–(34) have a feasible solution. In order to find thegreatest lower bound of
Z, we investigate it in Section 4.3.
(4) Ifi
=
j, then a
i
i
M
=
1; then constraint (29) can be rewritten as follows: -
ω
i
M
+
(
max
⁡
{
(
a
i
i
M
-
Z
)
,
1
/
(
a
i
i
M
+
Z
)
}
)
+
S
=
0. This equality must always be satisfied. Analogously, constraint (30) is always satisfied. Then the equalities (29)–(34) can be used to find adjustable PCM B
′ for original PCM A.
(5) In this section, we aim to find out the least absolute worst distance by setting a more precise priority weights range and adding slack variables, and an iterative way to obtain feasible solutions will be proposed in Section4.3.


## 4.3. Stage 2: Find Feasible Solutions to Obtain the Middle Valueb
i
j
M
′ of Adjustable Matrix B
~
′

Next, we focus on how to find out thegreatest lower bound of
Z. The problem can be described as storing intervals of [
0
,
Z
max
⁡
], analyzing the corresponding X value, and finding thegreatest lower bound of
Z that makes X
=
0. This problem can be solved bysegment tree.Substep
1 (sets the initial value). Assume the accuracy level is ξ; let the initial value of ω
i
M be (
∏
j
=
1
n
a
i
j
M
)
1
/
n, and ω
1
M
=
1; let Z
max
⁡
=
Z
=
G
(
a
i
j
M
,
ω
~
M
), and Z
min
⁡
=
Z
=
0.Substep
2 (builds a segment tree by using interval
[
0
,
Z
]
). For example, in Figure 1, [
0
,
Z
] is the interval, and P1, P2, P3, P4 is the list of distinct interval endpoints. We separate intervals into two parts in every division and terminate this process till the value of the interval is less than the accuracy level (ξ). Then obtain the X value in problem (29)–(34) by setting the current Z value. If X
=
0, then the next Z value is equal to the lower bound of the current node. The calculation steps will end till it reaches endpoints (P1; P2; P3; P4) based on accuracy level ξ.Figure 1
The structure of thesegment tree.Substep
3. Select the greatest lower value of Z when X
=
0; obtain the feasible solution of ω
i
M, ω
j
M to achieve b
i
j
M
′.Note 2.
Thesegment tree is special for storing intervals. The built time is O
(
n
log
⁡
n
) for n intervals, and it uses O
(
n
log
⁡
n
) storage. The reason we adapted to thesegment tree is because the segments can be stored in any arbitrary manner, it can easily be adapted to counting queries, and it helps us to query the number of segments that contain a given point.


## 4.4. Stage 3: Obtain theb
i
j
L
′ and b
i
j
U
′ of the Adjustable Matrix B
~
′

Once the optimal solution (b
i
j
M
′) has been obtained, next, we focus on obtaining the value of b
i
j
L
′ and b
i
j
U
′. The modified matrix is a combination of the adjustable matrix and the original matrix based on Definition 2; then the adjustable matrix should have the minimum fuzziness and maximum preservation of the original matrix’s pattern. If B
~
′ is minimum fuzziness, then fuzziness of B
~ will mostly come from A
~, and B
~ will be more similar with A
~. In fact, the minimum fuzziness of B
~
′ could reduce uncertainty factors of B
~. If B
~
′ could maximally preserve the pattern of A
~, then the combination of B
~
′ and A
~ could reach the most potential of similarity with A
~. We propose Theorem 3 to obtain the value of b
i
j
L
′ and b
i
j
U
′ based on the above theory.Theorem 3.
The optimal solution vector isω
i
M; then B
i
j
M
′
=
ω
i
M
/
ω
j
M, i
=
1,2
,
…
,
n. Set C
L, C
U as arbitrary positive constants. Define the value of ω
i
L, ω
i
U in the following formulas:
(35)
ω
i
L
=
C
L
·
ω
i
M
,
w
h
e
r
e
C
L
=
min
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
L
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
L
)
1
/
n
}
,
ω
i
U
=
C
U
·
ω
i
M
,
w
h
e
r
e
C
U
=
max
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
U
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
U
)
1
/
n
}Then the value ofb
i
j
L
′ and b
i
j
U
′ is defined as follows:
(36)
b
i
j
L
′
=
ω
i
L
ω
j
L
,
b
i
j
U
′
=
ω
i
U
ω
j
U
.Proof.
The value ofC
L and C
U should satisfy two conditions: one is minimum fuzziness of ω
i
M, and the other one is maximally maintaining similarity of original matrix A
~.
By the first condition, we can get(37)
ω
i
L
≤
ω
i
M
≤
ω
i
U
,
ω
i
L
=
C
min
⁡
ω
i
M
,
ω
i
U
=
C
max
⁡
ω
i
M
.
By the second condition, we need to consider the distance betweena
i
j
L, a
i
j
M, and a
i
j
U, maintain the relationship among the original matrix, and make the new matrix closest to the original matrix’s pattern. It means to find out the smallest coefficient between a
i
j
L and a
i
j
M and the smallest coefficient between a
i
j
M and a
i
j
U. We can get the following formulas based on the second condition:
(38)
C
min
⁡
=
min
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
L
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
L
)
1
/
n
}
,
C
max
⁡
=
max
⁡
{
∑
j
=
1
n
a
i
j
M
∑
j
=
1
n
a
i
j
U
,
(
∏
j
=
1
n
a
i
j
M
)
1
/
n
(
∏
j
=
1
n
a
i
j
U
)
1
/
n
}
.
Therefore, we can prove formula (35) exists and prove that it is correct by (38). To be more precise, for instance, in Figure 2, (
b
~
i
j
)
2
′ is not satisfied with condition 1, and then it is not the minimum fuzziness of associated weights. If (
b
~
i
j
)
1
′ is not satisfied with condition 2, then it does not have the same pattern with matrix A
~. (
b
~
i
j
)
3
′ is the optimal solution.Choosing optimal matrixB
~
′ which is closest to matrix A
~.
(a)
(b)


## 5. An Algorithm to Obtain Modified PCMB
~

After analysis in Sections4.2, 4.3, and 4.4, we propose an algorithm to conclude how to obtain the modified PCM B
~ (see Algorithm 1).Algorithm 1:Find modified PCM.
Algorithm Find Modified_Matrix(
Z
max
⁡
,
Z
min
⁡
,
ξ
,
A
~
)
Input:
Z
max
⁡, Z
min
⁡, ξ, original matrix A
~
Output:
Z
max
⁡, Z
min
⁡, optimal matrix B
~
BEGIN
(1)If (
Z
max
⁡
-
Z
min
⁡
<
ξ) & (X
=
0)
Then
The currentω
i
M is the desired optimal solution of weight vector.
Adopt (16) to get b
i
j
M
′.
Use Theorem3 to obtain b
i
j
L
′ and b
i
j
U
′.
Adjustable PCMB
~
′
=
(
b
i
j
L
′
,
b
i
j
M
′
,
b
i
j
U
′
).
Obtain Modified PCMB
~ by Definition 2.
Stop.
(2)Else Search segment tree
Find the greatest lower value of Z when X
=
0
Z
max
⁡ = upper bound of the interval; Z
min
⁡ = lower bound of the interval
Solvethe problem (29)–(34),
Save the new value of ω
i
M
END


## 6. Numerical Illustration and Comparison with Crisp Numbers

### 6.1. Calculation of an Illustration by Using Proposed Algorithm

We run the experiments by software Matlab (R2009a) on a personal computer with Intel Core 2.2 GHZ and 4 G RAM. First we test crisp numbers by using Algorithm1 and then compare them with [6, 7].The inconsistent matrix in [6, 7] is the following matrix:(39)
A
=
(
1.0000
5.0000
3.0000
7.0000
6.0000
6.0000
0.3333
0.2500
0.2000
1.0000
0.3333
5.0000
3.0000
3.0000
0.2000
0.1429
0.3333
3.0000
1.0000
6.0000
3.0000
4.0000
6.0000
0.2000
0.1429
0.2000
0.1667
1.0000
0.3333
0.2500
0.1429
0.1250
0.1667
0.3333
0.3333
3.0000
1.0000
0.5000
0.2000
0.1667
0.1667
0.3333
0.2500
4.0000
2.0000
1.0000
0.2000
0.1667
3.0000
5.0000
0.1667
7.0000
5.0000
5.0000
1.0000
0.5000
4.0000
7.0000
5.0000
8.0000
6.0000
6.0000
2.0000
1.0000
)
.For matrixA, λ
max
⁡
=
9.669, CR
=
0.161
>
0.1, and the principal eigenvector is ω = (0.1730  0.0540  0.1881  0.0175  0.0310  0.0363  0.1668  0.3332)T.The value of CR is more than 0.1. Therefore, we will adopt Algorithm1 to obtain the new consistency matrix.Calculation Step
1. Input of the initial value of A
~ and initial value of ξ.(1)
The original matrixA
~
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
); here, crisp number is a specific case of fuzzy number in our model. Set a
i
j
L
=
a
i
j
M
=
a
i
j
U
=
A.
(2)
The acceptable precise degreeξ
=
0.1. (Here, we adopt 0.1 as an example.)Calculation Step
2. Calculation process.(1)
Calculate the initial value ofZ by (17).
(2)
First timeZ
=
10.0725; substitute Z into Algorithm 1; Z
max
⁡
=
10.075, Z
min
⁡
=
0, and Z
max
⁡
-
Z
min
⁡
>
ξ; set new Z
=
(
Z
max
⁡
-
Z
min
⁡
)
/
2.
(3)
The second time,Z
=
(
10.0725
-
0
)
/
2
=
5.0362; substitute new Z into Algorithm 1; solve the problem (29)–(34); the result is X
=
0 and w = (1.0000  0.3469  4.0000  0.5262  0.2902  0.1346  0.9375  1.4637). We put the following calculation in Table 1.Table 1
The values of parameters for each iterative time.
Iterative time
Z
max
⁡
Z
min
⁡
Z
ξ
X
ω
1
10.0725
0
5.0362
10.0725
0
ω1
2
5.0362
2.5181
2.5181
2.5181
1
—
3
3.7772
2.5181
3.7772
1.2591
0
ω2
4
3.7772
3.1476
3.1476
0.6296
1
—
5
3.7772
3.4624
3.4624
0.3148
1
—
6
3.7772
3.6198
3.6198
0.1574
1
—
7
3.7772
3.6985
3.6985
0.0787
0
ω3Calculation Step
3. Description parameters’ meaning. The value of ξ is a stopping sign. If current value of ξ is less than 0.1, stop the calculation process.The value ofX can determine how to change the current Z value. If X
=
0, it means there is a solution for problem (29)–(34); then save the value of vector ω and set Z
max
⁡
=
Z; else X
=
1; it means there is not a solution for problem (29)–(34); then set Z
min
⁡
=
Z, Z
=
Z
max
⁡.Note 3.
Consider(40)
ω
1
=
(
1.0000
0.3469
4.0000
0.5262
0.2902
0.1346
0.9375
1.4637
)
T
,
ω
2
=
(
1.0000
0.4499
1.2228
0.1259
0.4499
0.4499
0.5501
1.4953
)
T
,
ω
3
=
(
1.0000
0.9097
2.6082
0.2677
0.4345
0.4345
1.1620
3.3244
)
T
.Now, we go to discuss the results. When in the 7th iterative time, the gap betweenZ
min
⁡ and Z
max
⁡ is 0.0787, which is less than 0.1; the process stops at this point. In order to better understand, we use thesegment tree to express the changing process in Figure 3.Figure 3
An example of iterative times insegment tree structure.In Figure3, the current Z value is colored with red and bold. The first Z value is 10.0725, and X
=
0, which means there is a solution for inequalities (29)–(34); the second Z value is 5.0362, and X
=
0; by combining the first result, it must have a solution when Z value is between 5.0362 and 10.0725. Therefore, the program goes to search the left subtree of the node; the third Z value is 2.5181, and X
=
1, which means there is not a solution for inequalities (29)–(34); the program needs to search the right subtree of this node, because the right child node is bigger than 2.5181. We continue the process till the gap between two child nodes is less than ξ.The final result of positive vector isω
3 = (1.0000   0.9097   2.6082   0.2677   0.4345   0.4345   1.1620   3.3244)T.On the basis ofω
3, we construct the new consistency matrix B
′ as in the following:(41)
B
′
=
(
1.0000
1.0993
0.3834
3.7354
2.3015
2.3015
0.8606
0.3008
0.9097
1.0000
0.3488
3.3979
2.0936
2.0936
0.7828
0.2736
2.6082
2.8672
1.0000
9.7424
6.0027
6.0027
2.2445
0.7845
0.2677
0.2943
0.1026
1.0000
0.6161
0.6161
0.2304
0.0805
0.4345
0.4777
0.1666
1.6230
1.0000
1.0000
0.3739
0.1307
0.4345
0.4777
0.1666
1.6230
1.0000
1.0000
0.3739
0.1307
1.1620
1.2775
0.4455
4.3406
2.6745
2.6745
1.0000
0.3495
3.3244
3.6546
1.2746
12.4179
7.6512
7.6512
2.8609
1.0000
)
.Here, we adoptβ
=
0.8 as an example in Definition 2. The new matrix B is as follows:(42)
B
=
(
1.0000
3.6932
1.9881
6.1737
4.9536
4.9536
0.4030
0.2594
0.2708
1.0000
0.3364
4.6283
2.7917
2.7917
0.2628
0.1627
0.5030
2.9730
1.0000
6.6108
3.4464
4.3383
4.9288
0.2629
0.1620
0.2161
0.1513
1.0000
0.3769
0.2994
0.1572
0.1145
0.2019
0.3582
0.2902
2.6531
1.0000
0.5743
0.2267
0.1588
0.2019
0.3582
0.2305
3.3397
1.7411
1.0000
0.2267
0.1588
2.4817
3.8058
0.2029
6.3619
4.4119
4.4119
1.0000
0.4655
3.8547
6.1468
3.8041
8.7354
6.2989
6.2989
2.1484
1.0000
)
.


### 6.2. Comparison with References

Xu and Wei [6] defined the original matrix A (the elements are a
i
j) that can be replaced by the new matrix B (the elements are b
i
j), which is showed in the following equation:
(43)
b
i
j
=
a
i
j
α
(
ω
i
ω
j
)
1
-
α
,
where α is the positive value which is less than, but approaching to, 1.Cao et al. [7] proposed an equation to obtain the new matrix B, which is showed by the following:
(44)
b
i
j
=
(
ω
i
ω
j
)
∘
D
′
,
where ∘ is the symbol of Hadamard product. For example, A
=
B
∘
C means a
i
j
=
b
i
j
×
c
i
j
,
∀
i
,
j
=
1
,
…
,
n, and D
′ is the modified deviation matrix, which is showed in the following equation:
(45)
D
′
=
[
d
i
j
′
]
=
γ
D
⊕
(
1
-
γ
)
DI
,
where D is the deviation matrix and DI is a zero deviation matrix when [
d
i
j
]
=
1. The value of γ is between 0 and 1.α and γ has different meanings for two papers, but the two parameters should be as close to 1 as possible. In two papers, they mentioned that α
=
γ
=
0.98 is the most suitable value to get the optimal new matrix. We will discuss β’s meaning and the relationship with α and γ in Section 8. We compare with two references in two situations: one is the required critical ratio (CR) less than 0.1 (Table 2); the other one is the required critical ratio (CR) close to 0 (Table 4).Table 2
α
=
γ
=
0.98. Iteration times, CR ≤ 0.1, δ, σ, λ
max
⁡, and priority weight results.
Methods
Iteration needed for CR ≤ 0.1
CR
δ
σ
λ
max
⁡
Priority weight
Xu and Wei [6]
12
0.0972
1.845
0.589
8.955
ω
XU
,
R
XU
Cao et al. [7]
18
0.0997
1.713
0.448
8.9844
ω
Cao
,
R
Cao
Our method (ξ
=
0.05, β
=
0.8)
8
0.0964
1.1572
0.4710
8.9017
ω
Our
(
0.05
)
R
Our
(
0.05
)
Our method (ξ
=
0.1, β
=
0.8)
7
0.0964
0.7354
0.4689
8.9017
ω
Our
(
0.1
)
R
Our
(
0.1
)
Our method (ξ
=
0.2, β
=
0.8)
6
0.0964
1.2273
0.4993
8.9017
ω
Our
(
0.2
)
R
Our
(
0.2
)
ω
XU
,
R
XU
ω
XU = (1.0000 0.3241 1.0329 0.1034 0.1843 0.2172 0.9804 1.9353)
R
XU = (8 3 1 7 2 6 5 4)
ω
Cao
,
R
Cao
ω
Cao = (1.0000 0.3191 1.0695 0.1019 0.1824 0.2142 0.9699 1.9340)
R
Cao = (8 3 1 7 2 6 5 4)
ω
Our
(
0.05
)
R
Our
(
0.05
)
ω
Our
(
0.05
) = (1.0000 0.3430 1.0856 0.1143 0.2182 0.2493 0.8808 1.9064)
R
Our
(
0.05
) = (8 3 1 7 2 6 5 4)
ω
Our
(
0.1
)
R
Our
(
0.1
)
ω
Our
(
0.1
) = (1.0000 0.3990 1.2401 0.1249 0.2189 0.2501 1.0147 2.1558)
R
Our
(
0.1
) = (8 3 7 1 2 6 5 4)
ω
Our
(
0.2
)
R
Our
(
0.2
)
ω
Our
(
0.2
) = (1.0000 0.3466 1.0657 0.1074 0.2205 0.2518 0.8737 1.8375)
R
Our
(
0.2
) = (8 3 1 7 2 6 5 4)Table 3
COP (condition of order preservation) parameter value.
Original matrixω
ω
XU
ω
Cao
ω
Our
(
0.05
)
ω
Our
(
0.1
)
ω
Our
(
0.2
)
{
a
1
,
a
2
}
3.2055
3.0855
3.2037
2.9152
2.5062
2.8852
{
a
1
,
a
3
}
0.9198
0.9681
0.9197
0.9212
0.8064
0.9383
{
a
1
,
a
4
}
9.8822
9.6712
9.8857
8.7519
8.0060
9.3096
{
a
1
,
a
5
}
5.5733
5.4259
5.5806
4.5830
4.5674
4.5358
{
a
1
,
a
6
}
4.7634
4.6041
4.7658
4.0119
3.9984
3.9706
⋯
⋯
⋯
⋯
⋯
⋯
⋯
Conclusion
Cao et al. [7] are closer to the original matrix ω, but the gap among Cao et al. [7], Xu and Wei [6], and our method is very narrow (less than 1), the three methods almost in the same extends to close to original ω. Thus, our method is acceptable in this parameter.Table 4
α
=
γ
=
0.98. Iteration times, CR = 0, δ, σ, λ
max
⁡, and priority weight results.
Methods
Iteration needed for CR = 0
CR
δ
σ
λ
max
⁡
Priority weight
Xu and Wei [6]
820
0
10.4648
1.9069
8
ω
XU
,
R
XU
Cao et al. [7]
1619
0
11.0308
2.0714
8
ω
Cao, R
Cao
Our method (ξ
=
0.05
,
β
=
0.2)
8
0
3.2554
1.4458
8
ω
Our
(
0.05
)
,
R
Our
(
0.05
)
Our method (ξ
=
0.1
,
β
=
0.2)
7
0
3.5117
1.5088
8
ω
Our
(
0.1
)
,
R
Our
(
0.1
)
Our method (ξ
=
0.2
,
β
=
0.2)
6
0
3.6985
1.7867
8
ω
Our
(
0.2
)
,
R
Our
(
0.2
)
ω
XU
,
R
XU
ω
XU = (1.0000 0.3120 1.0873 0.1012 0.1794 0.2100 0.9644 1.9259)
R
XU = (8 3 1 7 2 6 5 4)
ω
Cao
,
R
Cao
ω
Cao = (1.0000 0.3121 1.0873 0.1012 0.1792 0.2098 0.9642 1.9260)
R
Cao = (8 3 1 7 2 6 5 4)
ω
Our
(
0.05
)
R
Our
(
0.05
)
ω
Our
(
0.05
) = (1.0000 0.4109 1.2324 0.1565 0.3665 0.3796 0.6374 1.8322)
R
Our
(
0.05
) = (8 3 1 7 2 6 5 4)
ω
Our
(
0.1
)
R
Our
(
0.1
)
ω
Our
(
0.1
) = (1.0000 0.7522 2.0985 0.2235 0.3715 0.3848 1.1224 2.9959)
R
Our
(
0.1
) = (8 3 7 1 2 6 5 4)
ω
Our
(
0.2
)
R
Our
(
0.2
)
ω
Our
(
0.2
) = (1.0000 0.4499 1.2228 0.1259 0.4499 0.4499 0.5501 1.4953)
R
Our
(
0.2
) = (8 3 1 7 2 6 5 4)From Table2, we reach the outcome that the CR value is lower than [6, 7]; at the same time, the method could achieve lower values of δ and σ in short iterative times. It means that our method can preserve more original information and obtain a more consistent new matrix in short iterative times. When we rank the priority weight ω derived from A, the ranking results are the same except when ξ
=
0.1 in two similar weights, which means the priority weight ω which is derived from our method is acceptable.On the basis of Table2, we go to discover the difference of COP parameter in our method and two references. The preference value between every two alternatives is gotten from priority weight ω of the column “priority weight” in Table 2. For example, the value of {
a
1
,
a
2
} is obtained in ω
XU = (1.0000   0.3241   1.0329   0.1034   0.1843   0.2172   0.9804   1.9353), which is 1
/
0.3241
=
3.0855.The modified new matrixB
XU, B
Cao, B
Our
(
0.05
), B
Our
(
0.1
), and B
Our
(
0.2
) is in the following: (46)
B
Xu
=
(
1.0000
2.9597
1.0501
9.4467
5.2285
4.4066
1.0207
0.5116
0.3379
1.0000
0.3548
3.1918
1.7666
1.4889
0.3449
0.1729
0.9523
2.8185
1.0000
8.9961
4.9791
4.1964
0.9720
0.4872
0.1059
0.3133
0.1112
1.0000
0.5535
0.4665
0.1080
0.0542
0.1913
0.5661
0.2008
1.8068
1.0000
0.8428
0.1952
0.0978
0.2269
0.6717
0.2383
2.1438
1.1865
1.0000
0.2316
0.1161
0.9797
2.8997
1.0288
9.2553
5.1226
4.3173
1.0000
0.5012
1.9546
5.7851
2.0525
18.4648
10.2197
8.6133
1.9950
1.0000
)
,
B
Cao
=
(
1.0000
3.2055
0.9198
9.8822
5.5733
4.7634
1.0371
0.5193
0.3120
1.0000
0.2869
3.0829
1.7387
1.4860
0.3235
0.1620
1.0872
3.4851
1.0000
10
.
7443
6.0595
5.1789
1.1275
0.5646
0.1012
0.3244
0.0931
1.0000
0.5640
0.4820
0.1049
0.0525
0.1794
0.5751
0.1650
1.7731
1.0000
0.8547
0.1861
0.0932
0.2099
0.6729
0.1931
2.0746
1.1700
1.0000
0.2177
0.1090
0.9643
3.0909
0.8869
9.5290
5.3741
4.5932
1.0000
0.5007
1.9258
6.1729
1.7712
19.0308
10.7329
9.1731
1.9971
1.0000
)
,
B
Our
(
0.05
)
=
(
1.0000
4.2959
2.2710
6.7491
4.9705
4.9705
0.4642
0.2934
0.2328
1.0000
0.3303
4.3498
2.4082
2.4082
0.2602
0.1582
0.4403
3.0273
1.0000
6.3266
3.0273
3.8107
4.9705
0.2602
0.1482
0.2299
0.1581
1.0000
0.3459
0.2748
0.1656
0.1184
0.2012
0.4152
0.3303
2.8906
1.0000
0.5743
0.2602
0.1789
0.2012
0.4152
0.2624
3.6387
1.7411
1.0000
0.2602
0.1789
2.1543
3.8428
0.2012
6.0374
3.8428
3.8428
1.0000
0.4569
3.4088
6.3228
3.8428
8.4449
5.5892
5.5892
2.1886
1.0000
)
,
B
Our
(
0.1
)
=
(
1.0000
3.6932
1.9881
6.1737
4.9536
4.9536
0.4030
0.2594
0.2708
1.0000
0.3364
4.6283
2.7917
2.7917
0.2628
0.1627
0.5030
2.9730
1.0000
6.6108
3.4464
4.3383
4.9288
0.2629
0.1620
0.2161
0.1513
1.0000
0.3769
0.2994
0.1572
0.1145
0.2019
0.3582
0.2902
2.6531
1.0000
0.5743
0.2267
0.1588
0.2019
0.3582
0.2305
3.3397
1.7411
1.0000
0.2267
0.1588
2.4817
3.8058
0.2029
6.3619
4.4119
4.4119
1.0000
0.4655
3.8547
6.1468
3.8041
8.7354
6.2989
6.2989
2.1484
1.0000
)
,
B
Our
(
0.2
)
=
(
1.0000
4.2516
2.3133
7.1790
4.9193
4.9193
0.4680
0.3044
0.2352
1.0000
0.3400
4.6750
2.4082
2.4082
0.2651
0.1658
0.4323
2.9414
1.0000
6.6066
2.9414
3.7026
4.9193
0.2651
0.1393
0.2139
0.1514
1.0000
0.3219
0.2557
0.1570
0.1155
0.2033
0.4152
0.3400
3.1067
1.0000
0.5743
0.2651
0.1876
0.2033
0.4152
0.2701
3.9107
1.7411
1.0000
0.2651
0.1876
2.1369
3.7727
0.2033
6.3702
3.7727
3.7727
1.0000
0.4702
3.2854
6.0312
3.7727
8.6577
5.3315
5.3315
2.1266
1.0000
)
.The gap of elements in every two new matrixes (B
XU, B
Cao, B
Our
(
0.05
), B
Our
(
0.1
) and B
Our
(
0.2
)) is less than 1.5
<
2, which proves these five matrixes are considerably close with each other; but, in Table 2, the CR value of our method is less than the other two methods, which means B
Our
(
0.05
), B
Our
(
0.1
), and B
Our
(
0.2
) are more consistent than B
XU and B
Cao. Meanwhile, the value of δ and σ for B
Our
(
0.05
) is the lowest, which means B
Our
(
0.05
) is the best solution for original matrix A. Next, we go to discuss the second situation when CR is close to 0. The analysis results are in Table 4.The iterative times for [6, 7] 820 and 1619 are quite large, which will cost the running time. The value of δ and σ in these two references is far away from the acceptable value, which means the priority weight of ω
XU and ω
Cao is not acceptable at all; but the iterative times of our method are less than 10 times, the value of δ is less than 4, and the value of σ is less than 2, which means our result is acceptable to some extent.


## 6.1. Calculation of an Illustration by Using Proposed Algorithm

We run the experiments by software Matlab (R2009a) on a personal computer with Intel Core 2.2 GHZ and 4 G RAM. First we test crisp numbers by using Algorithm1 and then compare them with [6, 7].The inconsistent matrix in [6, 7] is the following matrix:(39)
A
=
(
1.0000
5.0000
3.0000
7.0000
6.0000
6.0000
0.3333
0.2500
0.2000
1.0000
0.3333
5.0000
3.0000
3.0000
0.2000
0.1429
0.3333
3.0000
1.0000
6.0000
3.0000
4.0000
6.0000
0.2000
0.1429
0.2000
0.1667
1.0000
0.3333
0.2500
0.1429
0.1250
0.1667
0.3333
0.3333
3.0000
1.0000
0.5000
0.2000
0.1667
0.1667
0.3333
0.2500
4.0000
2.0000
1.0000
0.2000
0.1667
3.0000
5.0000
0.1667
7.0000
5.0000
5.0000
1.0000
0.5000
4.0000
7.0000
5.0000
8.0000
6.0000
6.0000
2.0000
1.0000
)
.For matrixA, λ
max
⁡
=
9.669, CR
=
0.161
>
0.1, and the principal eigenvector is ω = (0.1730  0.0540  0.1881  0.0175  0.0310  0.0363  0.1668  0.3332)T.The value of CR is more than 0.1. Therefore, we will adopt Algorithm1 to obtain the new consistency matrix.Calculation Step
1. Input of the initial value of A
~ and initial value of ξ.(1)
The original matrixA
~
=
(
a
i
j
L
,
a
i
j
M
,
a
i
j
U
); here, crisp number is a specific case of fuzzy number in our model. Set a
i
j
L
=
a
i
j
M
=
a
i
j
U
=
A.
(2)
The acceptable precise degreeξ
=
0.1. (Here, we adopt 0.1 as an example.)Calculation Step
2. Calculation process.(1)
Calculate the initial value ofZ by (17).
(2)
First timeZ
=
10.0725; substitute Z into Algorithm 1; Z
max
⁡
=
10.075, Z
min
⁡
=
0, and Z
max
⁡
-
Z
min
⁡
>
ξ; set new Z
=
(
Z
max
⁡
-
Z
min
⁡
)
/
2.
(3)
The second time,Z
=
(
10.0725
-
0
)
/
2
=
5.0362; substitute new Z into Algorithm 1; solve the problem (29)–(34); the result is X
=
0 and w = (1.0000  0.3469  4.0000  0.5262  0.2902  0.1346  0.9375  1.4637). We put the following calculation in Table 1.Table 1
The values of parameters for each iterative time.
Iterative time
Z
max
⁡
Z
min
⁡
Z
ξ
X
ω
1
10.0725
0
5.0362
10.0725
0
ω1
2
5.0362
2.5181
2.5181
2.5181
1
—
3
3.7772
2.5181
3.7772
1.2591
0
ω2
4
3.7772
3.1476
3.1476
0.6296
1
—
5
3.7772
3.4624
3.4624
0.3148
1
—
6
3.7772
3.6198
3.6198
0.1574
1
—
7
3.7772
3.6985
3.6985
0.0787
0
ω3Calculation Step
3. Description parameters’ meaning. The value of ξ is a stopping sign. If current value of ξ is less than 0.1, stop the calculation process.The value ofX can determine how to change the current Z value. If X
=
0, it means there is a solution for problem (29)–(34); then save the value of vector ω and set Z
max
⁡
=
Z; else X
=
1; it means there is not a solution for problem (29)–(34); then set Z
min
⁡
=
Z, Z
=
Z
max
⁡.Note 3.
Consider(40)
ω
1
=
(
1.0000
0.3469
4.0000
0.5262
0.2902
0.1346
0.9375
1.4637
)
T
,
ω
2
=
(
1.0000
0.4499
1.2228
0.1259
0.4499
0.4499
0.5501
1.4953
)
T
,
ω
3
=
(
1.0000
0.9097
2.6082
0.2677
0.4345
0.4345
1.1620
3.3244
)
T
.Now, we go to discuss the results. When in the 7th iterative time, the gap betweenZ
min
⁡ and Z
max
⁡ is 0.0787, which is less than 0.1; the process stops at this point. In order to better understand, we use thesegment tree to express the changing process in Figure 3.Figure 3
An example of iterative times insegment tree structure.In Figure3, the current Z value is colored with red and bold. The first Z value is 10.0725, and X
=
0, which means there is a solution for inequalities (29)–(34); the second Z value is 5.0362, and X
=
0; by combining the first result, it must have a solution when Z value is between 5.0362 and 10.0725. Therefore, the program goes to search the left subtree of the node; the third Z value is 2.5181, and X
=
1, which means there is not a solution for inequalities (29)–(34); the program needs to search the right subtree of this node, because the right child node is bigger than 2.5181. We continue the process till the gap between two child nodes is less than ξ.The final result of positive vector isω
3 = (1.0000   0.9097   2.6082   0.2677   0.4345   0.4345   1.1620   3.3244)T.On the basis ofω
3, we construct the new consistency matrix B
′ as in the following:(41)
B
′
=
(
1.0000
1.0993
0.3834
3.7354
2.3015
2.3015
0.8606
0.3008
0.9097
1.0000
0.3488
3.3979
2.0936
2.0936
0.7828
0.2736
2.6082
2.8672
1.0000
9.7424
6.0027
6.0027
2.2445
0.7845
0.2677
0.2943
0.1026
1.0000
0.6161
0.6161
0.2304
0.0805
0.4345
0.4777
0.1666
1.6230
1.0000
1.0000
0.3739
0.1307
0.4345
0.4777
0.1666
1.6230
1.0000
1.0000
0.3739
0.1307
1.1620
1.2775
0.4455
4.3406
2.6745
2.6745
1.0000
0.3495
3.3244
3.6546
1.2746
12.4179
7.6512
7.6512
2.8609
1.0000
)
.Here, we adoptβ
=
0.8 as an example in Definition 2. The new matrix B is as follows:(42)
B
=
(
1.0000
3.6932
1.9881
6.1737
4.9536
4.9536
0.4030
0.2594
0.2708
1.0000
0.3364
4.6283
2.7917
2.7917
0.2628
0.1627
0.5030
2.9730
1.0000
6.6108
3.4464
4.3383
4.9288
0.2629
0.1620
0.2161
0.1513
1.0000
0.3769
0.2994
0.1572
0.1145
0.2019
0.3582
0.2902
2.6531
1.0000
0.5743
0.2267
0.1588
0.2019
0.3582
0.2305
3.3397
1.7411
1.0000
0.2267
0.1588
2.4817
3.8058
0.2029
6.3619
4.4119
4.4119
1.0000
0.4655
3.8547
6.1468
3.8041
8.7354
6.2989
6.2989
2.1484
1.0000
)
.


## 6.2. Comparison with References

Xu and Wei [6] defined the original matrix A (the elements are a
i
j) that can be replaced by the new matrix B (the elements are b
i
j), which is showed in the following equation:
(43)
b
i
j
=
a
i
j
α
(
ω
i
ω
j
)
1
-
α
,
where α is the positive value which is less than, but approaching to, 1.Cao et al. [7] proposed an equation to obtain the new matrix B, which is showed by the following:
(44)
b
i
j
=
(
ω
i
ω
j
)
∘
D
′
,
where ∘ is the symbol of Hadamard product. For example, A
=
B
∘
C means a
i
j
=
b
i
j
×
c
i
j
,
∀
i
,
j
=
1
,
…
,
n, and D
′ is the modified deviation matrix, which is showed in the following equation:
(45)
D
′
=
[
d
i
j
′
]
=
γ
D
⊕
(
1
-
γ
)
DI
,
where D is the deviation matrix and DI is a zero deviation matrix when [
d
i
j
]
=
1. The value of γ is between 0 and 1.α and γ has different meanings for two papers, but the two parameters should be as close to 1 as possible. In two papers, they mentioned that α
=
γ
=
0.98 is the most suitable value to get the optimal new matrix. We will discuss β’s meaning and the relationship with α and γ in Section 8. We compare with two references in two situations: one is the required critical ratio (CR) less than 0.1 (Table 2); the other one is the required critical ratio (CR) close to 0 (Table 4).Table 2
α
=
γ
=
0.98. Iteration times, CR ≤ 0.1, δ, σ, λ
max
⁡, and priority weight results.
Methods
Iteration needed for CR ≤ 0.1
CR
δ
σ
λ
max
⁡
Priority weight
Xu and Wei [6]
12
0.0972
1.845
0.589
8.955
ω
XU
,
R
XU
Cao et al. [7]
18
0.0997
1.713
0.448
8.9844
ω
Cao
,
R
Cao
Our method (ξ
=
0.05, β
=
0.8)
8
0.0964
1.1572
0.4710
8.9017
ω
Our
(
0.05
)
R
Our
(
0.05
)
Our method (ξ
=
0.1, β
=
0.8)
7
0.0964
0.7354
0.4689
8.9017
ω
Our
(
0.1
)
R
Our
(
0.1
)
Our method (ξ
=
0.2, β
=
0.8)
6
0.0964
1.2273
0.4993
8.9017
ω
Our
(
0.2
)
R
Our
(
0.2
)
ω
XU
,
R
XU
ω
XU = (1.0000 0.3241 1.0329 0.1034 0.1843 0.2172 0.9804 1.9353)
R
XU = (8 3 1 7 2 6 5 4)
ω
Cao
,
R
Cao
ω
Cao = (1.0000 0.3191 1.0695 0.1019 0.1824 0.2142 0.9699 1.9340)
R
Cao = (8 3 1 7 2 6 5 4)
ω
Our
(
0.05
)
R
Our
(
0.05
)
ω
Our
(
0.05
) = (1.0000 0.3430 1.0856 0.1143 0.2182 0.2493 0.8808 1.9064)
R
Our
(
0.05
) = (8 3 1 7 2 6 5 4)
ω
Our
(
0.1
)
R
Our
(
0.1
)
ω
Our
(
0.1
) = (1.0000 0.3990 1.2401 0.1249 0.2189 0.2501 1.0147 2.1558)
R
Our
(
0.1
) = (8 3 7 1 2 6 5 4)
ω
Our
(
0.2
)
R
Our
(
0.2
)
ω
Our
(
0.2
) = (1.0000 0.3466 1.0657 0.1074 0.2205 0.2518 0.8737 1.8375)
R
Our
(
0.2
) = (8 3 1 7 2 6 5 4)Table 3
COP (condition of order preservation) parameter value.
Original matrixω
ω
XU
ω
Cao
ω
Our
(
0.05
)
ω
Our
(
0.1
)
ω
Our
(
0.2
)
{
a
1
,
a
2
}
3.2055
3.0855
3.2037
2.9152
2.5062
2.8852
{
a
1
,
a
3
}
0.9198
0.9681
0.9197
0.9212
0.8064
0.9383
{
a
1
,
a
4
}
9.8822
9.6712
9.8857
8.7519
8.0060
9.3096
{
a
1
,
a
5
}
5.5733
5.4259
5.5806
4.5830
4.5674
4.5358
{
a
1
,
a
6
}
4.7634
4.6041
4.7658
4.0119
3.9984
3.9706
⋯
⋯
⋯
⋯
⋯
⋯
⋯
Conclusion
Cao et al. [7] are closer to the original matrix ω, but the gap among Cao et al. [7], Xu and Wei [6], and our method is very narrow (less than 1), the three methods almost in the same extends to close to original ω. Thus, our method is acceptable in this parameter.Table 4
α
=
γ
=
0.98. Iteration times, CR = 0, δ, σ, λ
max
⁡, and priority weight results.
Methods
Iteration needed for CR = 0
CR
δ
σ
λ
max
⁡
Priority weight
Xu and Wei [6]
820
0
10.4648
1.9069
8
ω
XU
,
R
XU
Cao et al. [7]
1619
0
11.0308
2.0714
8
ω
Cao, R
Cao
Our method (ξ
=
0.05
,
β
=
0.2)
8
0
3.2554
1.4458
8
ω
Our
(
0.05
)
,
R
Our
(
0.05
)
Our method (ξ
=
0.1
,
β
=
0.2)
7
0
3.5117
1.5088
8
ω
Our
(
0.1
)
,
R
Our
(
0.1
)
Our method (ξ
=
0.2
,
β
=
0.2)
6
0
3.6985
1.7867
8
ω
Our
(
0.2
)
,
R
Our
(
0.2
)
ω
XU
,
R
XU
ω
XU = (1.0000 0.3120 1.0873 0.1012 0.1794 0.2100 0.9644 1.9259)
R
XU = (8 3 1 7 2 6 5 4)
ω
Cao
,
R
Cao
ω
Cao = (1.0000 0.3121 1.0873 0.1012 0.1792 0.2098 0.9642 1.9260)
R
Cao = (8 3 1 7 2 6 5 4)
ω
Our
(
0.05
)
R
Our
(
0.05
)
ω
Our
(
0.05
) = (1.0000 0.4109 1.2324 0.1565 0.3665 0.3796 0.6374 1.8322)
R
Our
(
0.05
) = (8 3 1 7 2 6 5 4)
ω
Our
(
0.1
)
R
Our
(
0.1
)
ω
Our
(
0.1
) = (1.0000 0.7522 2.0985 0.2235 0.3715 0.3848 1.1224 2.9959)
R
Our
(
0.1
) = (8 3 7 1 2 6 5 4)
ω
Our
(
0.2
)
R
Our
(
0.2
)
ω
Our
(
0.2
) = (1.0000 0.4499 1.2228 0.1259 0.4499 0.4499 0.5501 1.4953)
R
Our
(
0.2
) = (8 3 1 7 2 6 5 4)From Table2, we reach the outcome that the CR value is lower than [6, 7]; at the same time, the method could achieve lower values of δ and σ in short iterative times. It means that our method can preserve more original information and obtain a more consistent new matrix in short iterative times. When we rank the priority weight ω derived from A, the ranking results are the same except when ξ
=
0.1 in two similar weights, which means the priority weight ω which is derived from our method is acceptable.On the basis of Table2, we go to discover the difference of COP parameter in our method and two references. The preference value between every two alternatives is gotten from priority weight ω of the column “priority weight” in Table 2. For example, the value of {
a
1
,
a
2
} is obtained in ω
XU = (1.0000   0.3241   1.0329   0.1034   0.1843   0.2172   0.9804   1.9353), which is 1
/
0.3241
=
3.0855.The modified new matrixB
XU, B
Cao, B
Our
(
0.05
), B
Our
(
0.1
), and B
Our
(
0.2
) is in the following: (46)
B
Xu
=
(
1.0000
2.9597
1.0501
9.4467
5.2285
4.4066
1.0207
0.5116
0.3379
1.0000
0.3548
3.1918
1.7666
1.4889
0.3449
0.1729
0.9523
2.8185
1.0000
8.9961
4.9791
4.1964
0.9720
0.4872
0.1059
0.3133
0.1112
1.0000
0.5535
0.4665
0.1080
0.0542
0.1913
0.5661
0.2008
1.8068
1.0000
0.8428
0.1952
0.0978
0.2269
0.6717
0.2383
2.1438
1.1865
1.0000
0.2316
0.1161
0.9797
2.8997
1.0288
9.2553
5.1226
4.3173
1.0000
0.5012
1.9546
5.7851
2.0525
18.4648
10.2197
8.6133
1.9950
1.0000
)
,
B
Cao
=
(
1.0000
3.2055
0.9198
9.8822
5.5733
4.7634
1.0371
0.5193
0.3120
1.0000
0.2869
3.0829
1.7387
1.4860
0.3235
0.1620
1.0872
3.4851
1.0000
10
.
7443
6.0595
5.1789
1.1275
0.5646
0.1012
0.3244
0.0931
1.0000
0.5640
0.4820
0.1049
0.0525
0.1794
0.5751
0.1650
1.7731
1.0000
0.8547
0.1861
0.0932
0.2099
0.6729
0.1931
2.0746
1.1700
1.0000
0.2177
0.1090
0.9643
3.0909
0.8869
9.5290
5.3741
4.5932
1.0000
0.5007
1.9258
6.1729
1.7712
19.0308
10.7329
9.1731
1.9971
1.0000
)
,
B
Our
(
0.05
)
=
(
1.0000
4.2959
2.2710
6.7491
4.9705
4.9705
0.4642
0.2934
0.2328
1.0000
0.3303
4.3498
2.4082
2.4082
0.2602
0.1582
0.4403
3.0273
1.0000
6.3266
3.0273
3.8107
4.9705
0.2602
0.1482
0.2299
0.1581
1.0000
0.3459
0.2748
0.1656
0.1184
0.2012
0.4152
0.3303
2.8906
1.0000
0.5743
0.2602
0.1789
0.2012
0.4152
0.2624
3.6387
1.7411
1.0000
0.2602
0.1789
2.1543
3.8428
0.2012
6.0374
3.8428
3.8428
1.0000
0.4569
3.4088
6.3228
3.8428
8.4449
5.5892
5.5892
2.1886
1.0000
)
,
B
Our
(
0.1
)
=
(
1.0000
3.6932
1.9881
6.1737
4.9536
4.9536
0.4030
0.2594
0.2708
1.0000
0.3364
4.6283
2.7917
2.7917
0.2628
0.1627
0.5030
2.9730
1.0000
6.6108
3.4464
4.3383
4.9288
0.2629
0.1620
0.2161
0.1513
1.0000
0.3769
0.2994
0.1572
0.1145
0.2019
0.3582
0.2902
2.6531
1.0000
0.5743
0.2267
0.1588
0.2019
0.3582
0.2305
3.3397
1.7411
1.0000
0.2267
0.1588
2.4817
3.8058
0.2029
6.3619
4.4119
4.4119
1.0000
0.4655
3.8547
6.1468
3.8041
8.7354
6.2989
6.2989
2.1484
1.0000
)
,
B
Our
(
0.2
)
=
(
1.0000
4.2516
2.3133
7.1790
4.9193
4.9193
0.4680
0.3044
0.2352
1.0000
0.3400
4.6750
2.4082
2.4082
0.2651
0.1658
0.4323
2.9414
1.0000
6.6066
2.9414
3.7026
4.9193
0.2651
0.1393
0.2139
0.1514
1.0000
0.3219
0.2557
0.1570
0.1155
0.2033
0.4152
0.3400
3.1067
1.0000
0.5743
0.2651
0.1876
0.2033
0.4152
0.2701
3.9107
1.7411
1.0000
0.2651
0.1876
2.1369
3.7727
0.2033
6.3702
3.7727
3.7727
1.0000
0.4702
3.2854
6.0312
3.7727
8.6577
5.3315
5.3315
2.1266
1.0000
)
.The gap of elements in every two new matrixes (B
XU, B
Cao, B
Our
(
0.05
), B
Our
(
0.1
) and B
Our
(
0.2
)) is less than 1.5
<
2, which proves these five matrixes are considerably close with each other; but, in Table 2, the CR value of our method is less than the other two methods, which means B
Our
(
0.05
), B
Our
(
0.1
), and B
Our
(
0.2
) are more consistent than B
XU and B
Cao. Meanwhile, the value of δ and σ for B
Our
(
0.05
) is the lowest, which means B
Our
(
0.05
) is the best solution for original matrix A. Next, we go to discuss the second situation when CR is close to 0. The analysis results are in Table 4.The iterative times for [6, 7] 820 and 1619 are quite large, which will cost the running time. The value of δ and σ in these two references is far away from the acceptable value, which means the priority weight of ω
XU and ω
Cao is not acceptable at all; but the iterative times of our method are less than 10 times, the value of δ is less than 4, and the value of σ is less than 2, which means our result is acceptable to some extent.


## 7. Numerical Illustration and Comparison with Fuzzy Numbers

To judge the effectiveness of Algorithm1 for fuzzy PCMs, we analyze several parameters including the inconsistency index NI [13], consistency index CCI [14, 15], δ
fuzzy, σ
fuzzy, COP, iteration times, and running time.We adopt the same inconsistent matrix with Ramík and Korviny [13], which is
(47)
A
~
=
(
(
1,1
,
1
)
(
2,3
,
4
)
(
4,5
,
6
)
(
1
4
,
1
3
,
1
3
)
(
1,1
,
1
)
(
3,4
,
5
)
(
1
6
,
1
5
,
1
4
)
(
1
5
,
1
4
,
1
3
)
(
1,1
,
1
)
)
.For matrixA
~, N
I
3
9
(
A
~
)
=
0.219. It is an inconsistent PCM with fuzzy elements. We adopt Algorithm 1 to obtain the modified new matrix under different parameters. The results are shown in Table 5.Table 5
Effective analysis for Algorithm1 based on nine parameters.
β
=
0
.
5
NI [13]
CCI [14, 15]
δ
fuzzy
σ
fuzzy
COP
Iteration times
Running time (seconds)
ξ
=
0
.
1
0.0887
0.1378
1.2841
0.5688
Keep
5
0.033
ξ
=
0
.
0
1
0.0887
0.1378
1.2841
0.5688
Keep
8
0.031
ξ
=
0
.
00
1
0.0886
0.1378
1.2815
0.5691
Keep
11
0.042
β
=
0
.
6
NI
CCI
δ
fuzzy
σ
fuzzy
COP
Iteration times
Running time (seconds)
ξ
=
0
.
1
0.1007
0.1991
0.9979
0.4692
Keep
5
0.021
ξ
=
0
.
0
1
0.1007
0.1991
0.9979
0.4692
Keep
8
0.034
ξ
=
0
.
00
1
0.1007
0.1991
0.9960
0.4695
Keep
11
0.046For this matrix, the modified matricesB
~ are quite similar when the accurate degrees are ξ
=
0.1 and ξ
=
0.01, and, therefore, we only give the modified matrix B
~ when ξ
=
0.1 and ξ
=
0.001 under β
=
0.5 and β
=
0.6: (48)
B
~
(
ξ
=
0.1
,
β
=
0.5
)
=
(
[
1,1
,
1
]
[
2.021,2.453,2.718
]
[
5.284,5.480,5.800
]
[
0.350,0.407,0.424
]
[
1,1
,
1
]
[
3.202,3.460,3.895
]
[
0.154,0.182,0.211
]
[
0.241,0.288,0.331
]
[
1,1
,
1
]
)
,
B
~
(
ξ
=
0.001
,
β
=
0.5
)
=
(
[
1,1
,
1
]
[
2.017,2.449,2.714
]
[
5.281,5.477,5.797
]
[
0.350,0.408,0.425
]
[
1,1
,
1
]
[
3.205,3.463,3.899
]
[
0.154,0.182,0.211
]
[
0.241,0.288,0.331
]
[
1,1
,
1
]
)
,
B
~
(
ξ
=
0.1
,
β
=
0.6
)
=
(
[
1,1
,
1
]
[
2.016,2.553,2.936
]
[
4.997,5.380,5.839
]
[
0.327,0.391,0.404
]
[
1,1
,
1
]
[
3.1608,3.562,4.094
]
[
0.156,0.185,0.218
]
[
0.232,0.280,0.331
]
[
1,1
,
1
]
)
,
B
~
(
ξ
=
0.001
,
β
=
0.6
)
=
(
[
1,1
,
1
]
[
2.014,2.550,2.933
]
[
4.995,5.378,5.837
]
[
0.327,0.392,0.405
]
[
1,1
,
1
]
[
3.163,3.565,4.098
]
[
0.156,0.185,0.218
]
[
0.232,0.280,0.331
]
[
1,1
,
1
]
)
.In Table5, the inconsistency index NI is less than 0.1 and consistency index CCI is less than 0.3147, which indicates the modified matrix can reach a consistent requirement; δ
fuzzy satisfies 0
<
δ
fuzzy
<
2 and σ
fuzzy satisfies 0
<
σ
fuzzy
<
1, which shows the obtained new matrix is in an acceptable distance with A
~; the value of COP, which is gotten from priority vector ω
~ of B
~, can preserve order of preference and order of intensity preference, which presents B
~ can maintain the pattern of A
~ (similarity). Meanwhile, Algorithm 1 has high convergence speed based on the less iteration times and running time. The gap among these four matrixes is quite narrow; B
~
(
ξ
=
0.1
,
β
=
0.5
) is the best choice when we select the smallest value of the consistency index (NI, CCI), δ
fuzzy, and σ
fuzzy.


## 8. Discussion

Tables2 and 4 conclude the effectiveness of Algorithm 1 by comparing with Cao et al. [7] and Xu and Wei [6] based on PCMs with crisp elements. Algorithm 1 can retain more original information and achieve lower value of δ and σ when both α [6] and γ [7] approach 1. Table 5 summarizes the effectiveness of Algorithm 1 for PCMs with fuzzy elements. The modified PCMs with fuzzy elements can maintain original information and reach acceptable consistency level as well.In Algorithm1, β has different meaning with α and γ. In Cao et al. [7] and Xu and Wei [6], the results gotten by using α and γ equal to 0.98 are significantly better than those by using α and γ less than 0.98. Yet, it is not always the case for β. The true meaning of β is the proportion of the original matrix to adjustable matrix. The approximate prefect range of β is [0.25, 0.8] based on the experiments’ results, and there is no clue which value is the best one for β as the inconsistency level of PCMs is different. As a matter of fact, changing β’s value will not add running time, because this operation runs in constant time. As a future research, it would be interesting to figure out the exact prefect range of β. In this section, we focus on efficiency analysis of Algorithm 1 as effective analysis is done in Sections 6 and 7.


### 8.1. Efficiency Analysis: Algorithm Running Time

To demonstrate the overall efficiency of Algorithm1, we measure the average running time and iteration times for crisp and fuzzy elements. The elements of crisp matrix A and fuzzy A
~ are gotten from randomly generated numbers by programming. The size (n) of matrix A and A
~ varies from 3 to 10 (in real life problems, the size is usually no more than 10). We adopt twenty matrixes for each size.The assumed accuracy levelξ is the following three numbers: 0.1, 0.01, and 0.001. The value of β in the final step (B
=
a
i
j
β
(
b
i
j
′
)
1
-
β) will not affect the running time. The average running time of crisp elements is shown in Figure 4(a). The average running time of fuzzy elements is shown in Figure 4(b). In all cases, the running times are less than half a second, which is acceptable in real experiments. As expected, the higher the accuracy degree, the longer the running time in the same matrix size. The figure shows the growth rate of fuzzy matrixes’ running time is more irregular than crisp matrixes.Average running time with fuzzy and crisp elements (in seconds).
(a)
(b)


### 8.2. Efficiency Analysis: Convergence Rate

The speed of convergence is one important factor of the efficiency for an iterative method. In Algorithm1, the only parameter that can influence iteration times is the accuracy degree (ξ). α and γ are the parameters which can influence the number of iterations for [6, 7], respectively. According to the numerical illustration in Section 6, we study the convergence rate with respect to the values of ξ, α, and γ, by using Algorithm 1 and [6, 7], respectively. Meanwhile, we examine the convergence rate for fuzzy elements based on the data in Section 7. Figure 5 shows the results.Convergence rate of Cao et al. [7], Xu and Wei [6], and Algorithm 1.
(a)
(b)
(c)
(d)The convergence rate of Cao et al. [7] is slower than Xu and Wei [6] when γ
=
α. For these two methods, the lower the parameters value, the higher the rate of convergence. Algorithm 1 can approach its limits faster than Cao et al. [7] and Xu and Wei [6]. The maximum iteration time for Algorithm 1 is less than twenty when ξ
=
0.0001, while the maximum iteration times for Cao et al. [7] and Xu and Wei [6] are 1619 and 820, respectively. For fuzzy elements, the convergence rate of Algorithm 1 has low growth rate as well.


## 8.1. Efficiency Analysis: Algorithm Running Time

To demonstrate the overall efficiency of Algorithm1, we measure the average running time and iteration times for crisp and fuzzy elements. The elements of crisp matrix A and fuzzy A
~ are gotten from randomly generated numbers by programming. The size (n) of matrix A and A
~ varies from 3 to 10 (in real life problems, the size is usually no more than 10). We adopt twenty matrixes for each size.The assumed accuracy levelξ is the following three numbers: 0.1, 0.01, and 0.001. The value of β in the final step (B
=
a
i
j
β
(
b
i
j
′
)
1
-
β) will not affect the running time. The average running time of crisp elements is shown in Figure 4(a). The average running time of fuzzy elements is shown in Figure 4(b). In all cases, the running times are less than half a second, which is acceptable in real experiments. As expected, the higher the accuracy degree, the longer the running time in the same matrix size. The figure shows the growth rate of fuzzy matrixes’ running time is more irregular than crisp matrixes.Average running time with fuzzy and crisp elements (in seconds).
(a)
(b)


## 8.2. Efficiency Analysis: Convergence Rate

The speed of convergence is one important factor of the efficiency for an iterative method. In Algorithm1, the only parameter that can influence iteration times is the accuracy degree (ξ). α and γ are the parameters which can influence the number of iterations for [6, 7], respectively. According to the numerical illustration in Section 6, we study the convergence rate with respect to the values of ξ, α, and γ, by using Algorithm 1 and [6, 7], respectively. Meanwhile, we examine the convergence rate for fuzzy elements based on the data in Section 7. Figure 5 shows the results.Convergence rate of Cao et al. [7], Xu and Wei [6], and Algorithm 1.
(a)
(b)
(c)
(d)The convergence rate of Cao et al. [7] is slower than Xu and Wei [6] when γ
=
α. For these two methods, the lower the parameters value, the higher the rate of convergence. Algorithm 1 can approach its limits faster than Cao et al. [7] and Xu and Wei [6]. The maximum iteration time for Algorithm 1 is less than twenty when ξ
=
0.0001, while the maximum iteration times for Cao et al. [7] and Xu and Wei [6] are 1619 and 820, respectively. For fuzzy elements, the convergence rate of Algorithm 1 has low growth rate as well.


## 9. Conclusions

In this work, an algorithm has been proposed to derive a consistent PCM with crisp or fuzzy elements from an inconsistent one. The presented approach used the same numerical example used by [6, 7, 13]. The experiments reveal that the proposed approach could retain more original information and the convergence rate is faster than Cao et al. [7] and Xu and Wei [6] in different values of CR. Two effective criteria, δ and σ, show that the distance between modified PCM and original PCM is acceptable for both crisp and fuzzy elements. A new effectiveness criterion COP reflects that the modified PCM resembles the original PCM (crisp and fuzzy elements). In conclusion, this approach could enhance the quality of vague and inaccuracy data for decision makers and also could better handle the inconsistency problem of AHP and fuzzy AHP.In the future work, we will apply this approach to different applications. Meanwhile, efforts should be made to explore the prefect range ofβ and study the issue of selecting the situation where we can supply a consistency PCM to an inconsistency one based on real-life meaning.



---

*Source: 989726-2014-03-17.xml*