Professional Documents
Culture Documents
Metode Big M Simplex (The Big M Simplex Method) : Contoh 7
Metode Big M Simplex (The Big M Simplex Method) : Contoh 7
Contoh 7 :
Selesaikan persoalan program linear berikut :
Maksimumkan Z = 3X1 + 5X2
Dengan batasan
X1 ≤ 4
2X2 ≤ 12
3X1 + 2X2 = 18
X1, X2 ≥ 0
Penyelesaian :
Cara 1.
Bentuk Standard :
Fungsi tujuan
Maksimumkan
Z = 3X1 + 5X2 + 0X3 + 0X4 – MX5
Z - 3X1 - 5X2 - 0X3 - 0X4 + MX5
Batasan-batasan
X1 + X3 = 4
2X2 + X4 = 12
3X1 + 2X2 + X5 = 18
X1, X2, X3, X4, X5 0
Step I
Z X1 X2 X3 X4 X5 RHS
Zj-Cj
1 -3 -5 0 0 M 0
X3 0 1 0 1 0 0 4
X4 0 0 2 0 1 0 12
X5 0 3 2 0 0 1 18
Cara 2.
Bentuk Standard :
Fungsi tujuan
Maksimumkan
Z = 3X1 + 5X2 + 0X3 + 0X4 – MX5
= 3X1 + 5X2 + 0X3 + 0X4 – M (18 – 3X1 – 2X2 )
= (3 + 3M) X1 + (5 + 2M) X2 + 0X3 + 0X4 – 18M
Z – (3 + 3M) X1 - (5 + 2M ) X2 - 0X3 - 0X4 = - 18M
Batasan-batasan
X1 + X3 = 4
2X2 + X4 = 12
3X1 + 2X2 + X5 = 18
X1, X2, X3, X4, X5 0
Step I
Z X1 X2 X3 X4 X5 RHS
Zj-Cj
1 -3-3M -5-2M 0 0 0 -18M
X3 0 1 0 1 0 0 4 4/1=4
X4 0 0 2 0 1 0 12 ~
X5 0 3 2 0 0 1 18 18/3=6
Cara I : Baris Zj - Cj + (3+3M) Baris I
Baris II + (0) Baris I
Baris III + (-3) Baris I
Cara II :
Baris Zj – Cj
-3-3M -5-2M 0 0 0 -18M
-3-3M ( 1 0 1 0 0 4 )
0 -5-2M 3+3M 0 0 12-6M
Baris II
0 2 0 1 0 12
0 ( 1 0 1 0 0 4 )
0 2 0 1 0 12
Baris III
3 2 0 0 1 18
3 ( 1 0 1 0 0 4 )
0 2 -3 0 1 6
Step II
Z X1 X2 X3 X4 X5 RHS
Zj-Cj
1 0 -5-2M 3+3M 0 0 12-6M
X1 0 1 0 1 0 0 4 ~
X4 0 0 2 0 1 0 12 12/2=6
X5 0 0 2 -3 0 1 6 6/2=3
Baris Zj – Cj
0 -5-2M 3+3M 0 0 12-6M
-5-2M ( 0 1 -3/2 0 1/2 3 )
0 0 -9/2 0 5/2+M 27
Baris I
1 0 1 0 0 4
0 ( 0 1 -3/2 0 1/2 3 )
1 0 1 0 0 4
Baris II
0 2 0 1 0 12
2 ( 0 1 -3/2 0 1/2 3 )
0 0 3 1 -1 6
Step III
Z X1 X2 X3 X4 X5 RHS
Zj-Cj
1 0 0 -9/2 0 5/2+M 27
X1 0 1 0 1 0 0 4 4/1=4
X4 0 0 0 3 1 -1 6 6/3=2
X2 0 0 1 -3/2 0 1/2 3 3x-2/3=3
Cara II :
Baris Zj – Cj
0 0 -9/2 0 5/2+M 27
-9/2 ( 0 0 1 1/3 -1/3 2 )
0 0 0 3/2 1+M 36
Baris I
1 0 1 0 0 4
1 ( 0 0 1 1/3 -1/3 2 )
1 0 0 -1/3 1/3 2
Baris III
0 1 -3/2 0 1/2 3
-3/2 ( 0 0 1 1/3 -1/3 2 )
0 1 0 1/2 0 6
Step IV
Z X1 X2 X3 X4 X5 RHS
Zj-Cj
1 0 0 0 3/2 1+M 36
X1 0 1 0 0 -1/3 1/3 2
X3 0 0 0 1 1/3 -1/3 2
X2 0 0 1 0 1/2 0 6
Kesimpulan :
Solusi sudah optimal dengan memberikan nilai X1 = 2, X2 = 6 dan nilai Z =
36.
Contoh 8 :
Diketahui persoalan program linear berikut :
Minimumkan Z = X1 - 2X2
Dengan batasan
X1 + X 2 ≥ 2
-X1 + X2 ≥ 1
X2 ≤ 3
X 1, X 2 ≥ 0
Selesaikan persoalan program linear tersebut!
Penyelesaian :
Bentuk Standard :
Fungsi tujuan
Minimumkan
Z = X1 - 2X2 + 0X3 + 0X4 + 0X5 + MX6 + MX7
Z - X1 + 2X2 - 0X3 - 0X4 - 0X5 - MX6 - MX7
Batasan-batasan
X1 + X 2 - X3 + X6 = 2
-X1 + X2 - X4 + X7 = 1
X2 + X5 = 3
X1, X2, X3, X4, X5, X6, X7 ≥ 0
Step I
Z X1 X2 X3 X4 X5 X6 X7 RHS
Zj-Cj
1 -1 2 0 0 0 -M -M 0
X6 0 1 1 -1 0 0 1 0 2
X7 0 -1 1 0 -1 0 0 1 1
X5 0 0 1 0 0 1 0 0 3
Z X1 X2 X3 X4 X5 X6 X7 RHS
Zj-Cj
1 -1 2+2M -M -M 0 0 0 3M
X6 0 1 1 -1 0 0 1 0 2 2
X7 0 -1 1 0 -1 0 0 1 1 1
X5 0 0 1 0 0 1 0 0 3 3
Baris Zj - Cj + (-2-2M) Baris II
Baris I + (-1) Baris II
Baris III + (-1) Baris II
Step II
Z X1 X2 X3 X4 X5 X6 X7 RHS
Zj-Cj
1 1+2M 0 -M 2+M 0 0 -2-2M -2+M
X6 0 2 0 -1 1 0 1 -1 1 1/2
X2 0 -1 1 0 -1 0 0 1 1 -
X5 0 1 0 0 1 1 0 -1 2 2
Step III
Z X1 X2 X3 X4 X5 X6 X7 RHS
Zj-Cj
1 0 0 1/2 3/2 0 -1/2-M -3/2-M -5/2
Step IV
Z X1 X2 X3 X4 X5 X6 X7 RHS
Zj-Cj
1 -3 0 2 0 0 -2-M -M -4
X4 0 2 0 -1 1 0 1 -1 1 -
X2 0 1 1 -1 0 0 1 0 2 -
X5 0 -1 0 1 0 1 -1 0 1 1
Uji Z = X1 - 2X2
= 0 - 2(3) = -6
Sehingga Z = RHS, -6 = -6 (Terbukti)
Kesimpulan :
Solusi sudah optimal dengan memberikan nilai X1 = 0, X2 = 3 dan nilai Z =
-6.