# http://www.knu.edu.

%B8%E8%B3%87%E6%96%99/2011%E5%B9%B4%E7%A0%94%E7%A9%B6%E6%96%B9%E6%B3%95%E5%A4%8F
%E4%BB%A4%E7%87%9F/110705%E4%B8%8A%E8%AA%B2%E8%B3%87%E6%96%99/AHP,%20ANP,%20Fuzzy
%20AHP/AHP%20and%20Fuzzy%20AHP.doc
AHP and Fuzzy AHP

Concepts of Pairwise Comparison for Solving AHP
1
1 1 1 1 1 1 1
1
1
/ / /
/ / /
/ / /
j n
j n
i i j i n i j i
n n j n n n n n
w w w
w w w w w w w w w
w w w w w w w w n w
w w w w w w w w w
1 1 1
1 1 1
1 1 1
1 1 1 · ·
1 1 1
1 1 1
1 1 1
¸ ] ¸ ] ¸ ]
L L
L L
M M M M M M
L L
M M M M M M
L L
W
n · Ww w
⇒( ) n − · 0 W I w
In real situations,
/
i j
w w
is unknown, but
/
ij i j
a w w ≅
and
1/
ij ji
a a ·
(positive
reciprocal), and let
[ ]
ij n n
a
×
· A
.
a. n ≅ Aw w

max
( ) λ − · 0 A I w
, find
max
λ
and find
w
with
max
λ
, and calculate
max
. . ( ) /( 1) C I n n λ · − −

1 2
( , ,..., )
n
w w w · w
b.
2
1 1
min ( )
n n
i
ij
i j
j
w
a
w · ·

∑∑
s.t.
1
1
n
i
i
w
·
·

c.
1/
1
( )
n
n
i ij
j
r a
·
·
Π

1
/
n
i i i
i
w r r
·
·

(normalization)

1 2
( , ,..., )
n
w w w · w
d. When
max
λ · Aw w
, then
max
λ
can be estimated by
max
1
( ) 1
n
i
i
i
n w
λ
·
·

Aw

Concepts of Pairwise Comparison for Solving Fuzzy AHP
(1) Fuzzy [ ]
ij n n
a
×
·
%
% A

Fuzzy
1 2
( , ,..., )
n
w w w · % % % % w
a.
%
A

solve
max
λ
%

solve
i
w%
, i.e.
max
( ) λ − · 0
% %
% A I w
b.
1/
1 2
[ ]
n
i i i in
r a a a · ⊗ ⊗ ⊗ % % % % L ⇒
1
1 2
[ ]
i i n
w r r r r

· ⊗ ⊕ ⊕ ⊕ % % % % % L
Inverse operation of triangular fuzzy number:
1
( , , ) (1/ ,1/ ,1/ ) a b c c b a

·
(2) Fuzzy [ ]
ij n n
a
×
·
%
% A

Crisp
1 2
( , ,..., )
n
w w w · w

%B8%E8%B3%87%E6%96%99/2011%E5%B9%B4%E7%A0%94%E7%A9%B6%E6%96%B9%E6%B3%95%E5%A4%8F
%E4%BB%A4%E7%87%9F/110705%E4%B8%8A%E8%AA%B2%E8%B3%87%E6%96%99/AHP,%20ANP,%20Fuzzy
%20AHP/AHP%20and%20Fuzzy%20AHP.doc
c. [ ] ,
ij n n
a
×
·
%
% A
,
i
ij
j
w
a
w
≅ %

,
i
ij ij
j
w
l u
w
≤ ≤
% %

1, 2,..., 1; 1, 2,..., i n j n · − ·
;
i j <

( ) ( )
i
ij ij
j
w
l u
w
α α ≤ ≤
% %
in level
, α
then fuzzy constraints:
( ) 0
( ) 0
i j ij
i j ij
w w u
w w l
α
α
− ≤
− + ≤
%
%

≤ 0
%
Rw
where, the matrix ,
m n ×
∈R R ( 1) m n n · −
then
( )
k k
µ R w
=
1 ,
0,
k
k k
k
k k
d
d
d
¹
− ≤
¹
'
¹

¹
R w
R w
R w
( )
D
λ µ · w
=
1
1 1
1,2,...,
max{ min [ ( ),..., ( )] | ,
n
m m
k m
Q µ µ

·

w
Rw R w w
1 2
1}
n
w w w + + + · L
The max-min prioritization problem:
max λ
s. t,
1
k
k
d
λ ≤ −
R w

1
1,
n
i
i
w
·
·

0,
i
w > 1, 2,..., i n ·
;
1, 2,..., 2 k m ·
(3) Crisp
[ ]
ij n n
a
×
· A →
Fuzzy
1 2
( , ,..., )
n
w w w · % % % % w

1 2
( , ,..., ),
k k k
n
w w w ·
k
w 1, 2,..., k K ·
;

1
( ,..., ,..., )
j n
w w w · % % % % w
;

( , , )
j j j j
w l m u · %
;
where,
min { | 1, 2,..., };
k
j j
k
l w k K · ·
1
1
K
k
j j
k
m w
K ·
·

or
1/
1
[ ] ;
K
k K
j j
k
m w
·
· Π
max { | 1, 2,..., }.
k
j j
k
u w k K · ·