Professional Documents
Culture Documents
Or II 02 Network2
Or II 02 Network2
Industrial engineering
NETWORK
A 3
0
1
0 T
0
5 1 0 9
7 0 4
O B D
0
5
4 2 1
0 1
0 0 6
C E
4 0
12/07/2021 Operations Research 9
Iterasi 1: O – B – E – T
A 3
0
1
0 T 5
5
5 1 0 9
2 5 4
5 O B D
0
0
4 2 1
0 1
0 5 1
C E
4 0
12/07/2021 Operations Research 10
Iterasi 2: O – A – D – T
A 0
3
1
3 T 8
5
2 1 3 6
2 5 4
8 O B D
0
0
4 2 1
0 1
0 5 1
C E
4 0
12/07/2021 Operations Research 11
Iterasi 3: O – A – B – D – T
A 0
4
0
4 T 9
5
1 2 3 5
2 5 3
9 O B D
1
0
4 2 1
0 1
0 5 1
C E
4 0
12/07/2021 Operations Research 12
Iterasi 4: O – B – D – T
A 0
4
0
6 T 11
5
1 2 3 3
0 7 1
11 O B D
3
0
4 2 1
0 1
0 5 1
C E
4 0
12/07/2021 Operations Research 13
Iterasi 5: O – C – E – D – T
A 0
4
0
7 T 12
5
1 2 3 2
0 7 1
12 O B D
3
0
3 2 2
0 0
1 5 1
C E
3 1
12/07/2021 Operations Research 14
Iterasi 6: O – C – E – T
A 0
4
0
7 T 13
6
1 2 3 2
0 7 1
13 O B D
3
0
2 2 2
0 0
2 5 0
C E
2 2
12/07/2021 Operations Research 15
Iterasi 7: O – C – E – B – D – T
A 0
4
0
8 T 14
6
1 2 3 1
0 7 0
14 O B D
4
1
1 2 2
0 0
3 4 0
C E
1 3
12/07/2021 Operations Research 16
Solusi Optimal
3-0=3 T 14
5-1=4
1-0=1 9-1=8
7-0=7
14 O B D
4-0=4
6-0=6
5-1=4 1-0=1
4-1=3
C E
4-1=3
12/07/2021 Operations Research 17
MINIMUM COST FLOW
PROBLEM
n n
min Z cij xij
i 1 j 1
x x
j 1
ij
j 1
ji bi ; i
0 xij uij
dimana :
n
x
j 1
ij total aliran yang keluar dari node i
x
j 1
ji total aliran yang masuk ke node i
A D
[0]
2
2 3
C
(uAB = 10)
3 1
(uCE = 80)
B E
[40] [-60]
subject to
XAB + XAC + XAD = 50
-XAB + XBC = 40
-XAC - XBC + XCE = 0
-XAD + XDE - XED = -30
-XCE - XDE + XED = -60
XAB ≤ 10
XCE ≤ 80
Xij ≥ 0; untuk semua i dan j