St Nova Meirizha
X1 + X 2 ≤ 6
X2 ≤ 3
X1, X2 ≥ 0
X1 + X 2 + S 1 =6
X2 + S2= 3
X1, X2, S1, S2 ≥ 0
b = 6 X= X1
X
3 2
S1
S2
Metode Simpleks (#4) 6
BFS dicari dari B (m x n) = (2 x 2)
XB = B-1b yang nonnegatif
1 1
1. B = (a1, a2) =
0 1
X1
XB = = B-1.b =
1 1 6 3
;0 1 3 3
=
X2
S1 0
XN = =
S2 0
X1 1 0 6 6
XB = = B-1.b =
S 2
0; 1 3 =
3
X 2 0
XN = =
S1 0
1 1
3. B = (a2, a3) = 1 0
X2 0 1 6 3
XB = = B-1.b = 3
S1
1 1 3 =
;
X1
XN = = 0
S2
Metode Simpleks (#4) 8
0
1 0
4 . B = (a2, a4) = 1 1
X2 6
XB = = B-1.b = 1 0 = 6
S2
1; 1 3 3
X1
XN = = 0
0
S1
1 0
5. B = (a3, a4) = 0 1
S1 1 0 6 6
XB = = B-1.b = 0; 1 3 =
3
S2
X1 0
XN = =
X 2
Metode Simpleks (#4) 9
0
Banyak BFS ≤
BFS ≤
c
n
m
n!
=
m!(n m)!
Z0 = CB . B-1.b ………(1)
Metode Simpleks (#4) 11
Misal : ada sembarang titik feasible
XB
X = dengan XB ≥ 0 & XN ≥ 0
XN
dan
b = AX A = [B, N]
b = BXB + NXN
XB = B-1 b- B
jR
1
aj Xj ..... ( 2 )
= CB. B-1.b –
jR
1
CB B a jX j
+ C X
jR
j j
Z = Z0 – ( ZK – CK) XK
…..... ( 4 )
XB 1 b1 y1K
y
XB 2 2
b 2K
. . .
.
.... ( 5 )
. .
. .
.
= - XK
XB r b rK
y
r
. .
.
. .
.
.
. .
XB
m
m
b y mK
br
= min
1i m
bi : yiK > 0 = XK .... ( 6 )
y rK YiK
XBi = b i - YiK b r, i = 1, 2, …, m
YrK
br
XK =
YrK Metode Simpleks (#4) 17
Semua Xj yang lain = 0 (variabel non basis lain)
& XBr = 0 berubah menjadi variabel non basis baru