LINIER PROGRAMMING

METODE SIMPLEX - MAXIMISASI

 A B C KAPASITAS
MESIN 1 24 30 20 1.200
MESIN 2 0 25 15 600
MESIN 3 50 0 25 1.500
PROFIT 6 7 5
Buat pertidak samaan:
24A + 30B + 20C ≤ 1.200
0A + 25B + 15C ≤ 600
50A + 0B + 25C ≤ 1.500
Z = 6A + 7B + 5C
Buat persamaan:
24A + 30B + 20C +1X1 + 0X2 + 0X3 = 1.200
0A + 25B + 15C + 0X1 +1X2 + 0X3 = 600
50A + 0B + 25C + 0X1 + 0X2 +1X3 = 1.500

Z = 6A + 7B + 5C + 0X1 + 0X2 + 0X3

 Cj Ti
Ci s b

Zj
Cj-Zj
 MATRIX 1
Cj 0 0 0 6 7 5 Ti
Ci s b X1 X2 X3 A B C
0 X1 1.200 1 0 0 24 30 20 40
0 X2 600 0 1 0 0 25 15 24
0 X3 1.500 0 0 1 50 0 25 ∞
Zj 0 0 0 0 0 0 0
Cj-Zj 0 0 0 0 6 7 5
 MATRIX 2
Cj 0 0 0 6 7 5 TiTi
Ci 0s b X1 X2 X3 A B C
7 B 24 0 1/25 0 0 1 3/5 ∞
0 X1 480 1 6/5 0 24 0 2 20
0 x3 1.500 0 0 1 50 0 25 30
Zj 168 0 7/25 0 6 0 4215
Cj-Zj 0 -7/25 0 6 0 4/5
 MATRIX 2 BARIS 1
600 : 25 = 24 25
0 : 25 = 0
1 : 25 = 1/25
0 : 25 = 0
0 : 25 = 0
25 : 25 = 1
15 : 25 = 3/5
24 : 0 = ∞
 MATRIX 2 BARIS 2
1.200 – 30 (24) = 480
1 - 30 (0) = 1
0 - 30 (1/25) = -6/5
0 - 30 (0) = 0
24 - 30 (0) = 24
30 - 30 (1) = 0
20 - 30 (3/5) = 2
480 : 24 =20  Ti
 MATRIX 2 BARIS 3
1.500 - 0 ( 24 ) = 1.500
0 -0(0) = 0
0 - 0 ( 1/25 ) = 0
1 -0(0) = 1
50 - 0 ( 0 ) = 50
0 -0(1) = 0
25 - 0 ( 3/5 ) = 25
1.500 : 50 = 30  Ti
 MATRIX 3
Cj 0 0 0 6 7 5 TiTi
Ci 0s b X1 X2 X3 A B C
6 A 20 0,04 0,05 0 1 0 0.08 240
7 B 24 0 0,04 0 0 1 0,6 40
0 X3 500 -2,08 2,5 1 0 0 20,83 24
Zj 288 0,25 -0,16 0 6 7 4,7
Cj-Zj -0,25 0,16 0 0 0 0,3
 MATRIX 4
Cj 0 0 0 6 7 5 TiTi
Ci s b X1 X2 X3 A B C
5 C 24 - 0,1 0,12 0,24 0 0 1
6 A 18 0,05 0,06 0,004 1 0 0
7 B 9,6 0,06 0,032 0,028 0 1 0
Zj 295,2 0,22 0,096 0,014 6 7 5
Cj-Zj -0,22 -0,098 -0,014 0 0 0
 KOMBINASI OPTIMAL
PRODUK JUMLAH PROFIT TOTAL
PER UNIT PROFIT
A 18 6 108
B 9,6 7 67,2
C 24 5 120
295.2
 LINIER PROGRAMMING
METODE SIMPLEX - MINIIMISASI
22A + 12B ≥ 220
8A ≥ 40
6B ≥ 24

Z = 8A +5B

22A + 12B –S1+S4= 220

8A-S2+S5 = 40
6B-S3+S6 = 24

Z = 8A + 5B + 0 + M + 0 + M + 0 + M
 Cj 8 5 0 M 0 M 0 M
Ci s b A B S1 S4 S2 S5 S3 S6 Ti

Zj
Cj-Zj
 Cj 8 5 0 M 0 M 0 M
Ci s b A B S1 S4 S2 S5 S3 S6 Ti
M S4 220 22 12 -1 1 0 0 0 0
M S5 40 8 0 0 0 -1 1 0 0
M S6 24 0 6 0 0 0 0 -1 1
Zj
Cj-Zj
 Cj 8 5 0 M 0 M 0 M
Ci s b A B S1 S4 S2 S5 S3 S6 Ti
M S4 220 22 12 -1 1 0 0 0 0 10
M S5 40 8 0 0 0 -1 1 0 0 5
M S6 24 0 6 0 0 0 0 -1 1 ∞
Zj 284 30M 18M -M M -M M -M M
M
Cj-Zj 8- 5- M 0 M 0 M 0
30M 18M
 Cj 8 5 0 M 0 M 0 M
Ci s b A B S1 S4 S2 S5 S3 S6 Ti
M S4 110 0 12 -1 1 2 3/4 -23/4 0 0 91/6
8 A 5 1 0 0 0 -1/8 1/8 0 0 ∞
M S6 24 0 6 0 0 0 0 -1 1 4
Zj 40+1 8 18M -M M - 1- -M M
34M 1+23 23/4
/4M M
Cj-Zj 0 5- M 0 1- -1 -M 0
18M 23/4 +33/4
M M
 Cj 8 5 0 M 0 M 0 M
Ci s b A B S1 S4 S2 S5 S3 S6 Ti
M S4 62 0 0 -1 1 23/4 - 2 -2 22
23/4 6/11
8 A 5 1 0 0 0 -1/8 1/8 0 0 40
5 B 4 0 1 0 0 0 0 -1/8 1/6 ∞
Zj 60+ 8 5 -M M -1+ 1- -5/6 5/6
62M 23/4 23/4 +2M -2M
Cj-Zj 0 0 M 0 1- -1 5/6- -
23/4 +23/ 2M 5/6+
M 4M 3M
 Cj 8 5 0 M 0 M 0 M
Ci s b A B S1 S4 S2 S5 S3 S6 Ti
0 S2 22 0 0 - 4/11 1 -1 8/11 -
5/11 4/11 8/11
8 A 7 1 0 - 2/11 0 -1/4 1/16 -
9/11 8/11 1/11
5 B 4 0 1 0 0 0 0 -1/6 1/6
Zj 82 8 5 - 16/1 0 2 - 7/16
6/11 16/1 1 7/16
1
Cj-Zj 0 0 16/ M- 0 M+2 7/66 M-
11 16/1 7/66
1
Kombinasi optimal:
A = 7,81
B=4
Biaya minimal = Rp 82,55