Construction of Consistent Comparison Matrix by Macharis’ Method Revisit

Algorithm 1

(i)	Step 1: the previous consistent comparison matrix is denoted as .
(ii)	Step 2: the new consistent comparison matrix is denoted as .
(iii)	Step 3: the expert wants to change the entry to , with , that is, .
(iv)	Step 4: assume for .
(v)	Step 5: assume for .
(vi)	Step 6: for , and , .
(vii)	Step 7: the order of changing entries is arranged by the descending order of the row index and there is at most one entry that can be revised.