Programming (LP)
Bab III
X1 + X2 +S1
2X1 + 3X2 +S2
X1 + 4X2
+S3
X1,X2,S1,S2,S3
= 1200
= 3000
= 3600
0
Grafik?
Extreme points
Extreme
points
Koordinat
X1
X2
S1
S2
S3
1200
3000
3600
900
300
300
240
840
120
600
600
600
1200
600
2400
Basic Solution
Basic Solution
Feasible/
Infeasible
X1
X2
S1
S2
S3
1200
3000
3600
Feasible
900
300
300
Feasible
240
840
120
Feasible
600
600
600
Feasible
1200
600
2400
Feasible
1200
-600
-1200
Infeasible
1000
200
-400
Infeasible
3600
-2400
-4200
Infeasible
1500
-300
2100
Infeasible
400
800
-200
Infeasible
Metode Simplex
Proses penyelesaian masalah dengan
menggunakan pendekatan simplex
didasarkan pada ekstreme point dalam
basic feasible solution pada persamaan
linear
X1 + X2 + S1
= 1200
2X1 + 3X2 +S2 = 3000
X1 + 4X2
+S3 = 3600
X1, X2, S1, S2, S3 0
C2
Cn
a11
a21
am1
a12
a22
am2
a1n
a2n
amn
b1
b2
bm
Cj
X1
X2
S1
S2
S3
1200
3000
3600
Basis
X1
X2
S1
S2
S3
Solusi
S1
1200
S2
3000
S3
3600
Zj
Cj-Zj
Basis
X1
X2
S1
S2
S3
Solusi
Rasio
S1
1200
1200/1=
1200
S2
3000
3000/3=
1000
S3
3600
3600/4=
900
Zj
Cj-Zj
Pivot colomn
Pivot row
1
0
0
0
-1/4
300
300
1200)
900)
Basis
X1
X2
S1
S2
S3
Solusi
S1
-1/4
300
S2
5/4
-3/4
300
X2
900
Zj
3600
Cj-Zj
-1
Cj
Cb
Basis
X1
X2
S1
S2
S3
Solusi
Rasio
S1
-1/4
300
400
S2
5/4
-3/4
300
240
X2
900
3600
Zj
3600
Cj-Zj
-1
Cj
Cb
Iterasi selanjutnya?
X1
X2
S1
S2
S3
Solusi
Rasio
Cj
Cb
Basis
S1
-0.6
0.2
120
600
X1
0.8
-0.6
240
X2
-0.2
0.4
840
2100
Zj
1.6
-0.2
4080
Cj-Zj
-1.6
0.2
X1
X2
S1
S2
S3
Solusi
Cj
Cb
Basis
S3
-3
600
X1
-1
600
X2
-2
600
Zj
4200
Cj-Zj
-1
-1
Cj Zj 0
Rasio