table simplex

Maximize z = 5x + 4x2 Basic z x1 x2 s1 s2

subject to z 1 -5 -4 0 0
6x1 + 4x2 + s1 = 24 s1 0 6 4 1 0
x1 + 2x2 + s2 = 6 s2 0 1 2 0 1
- x1+x2+s3 = 1 s3 0 -1 1 0 0
x2 + s4 = 2 s4 0 0 1 0 0
x1,x2 >= 0

Iterasi 1
Basic z x1 x2 s1 s2
z 1 0 -0.666667 0.833333 0
x1 0 1 0.666667 0.166667 0
s2 0 0 1.333333 -0.166667 1
s3 0 0 1.666667 0.166667 0
s4 0 0 1 0 0

Iterasi 2
Basic z x1 x2 s1 s2
z 1 0 0 0.75 0.5
x1 0 1 0 0.25 -0.5
x2 0 0 1 -0.125 0.75
s3 0 0 0 0.375 -1.25
s4 0 0 0 0.125 -0.75
s3 s4 solution Ratio
0 0 0 Max Z 1. ambil basic solution berdasarkan nilai koefisien
0 0 24 4 most min 2. pivot row berdasarkan ratio diambil minimum y
0 0 6 6
1 0 1 -1
0 1 2 #DIV/0!

s3 s4 solution
0 0 20
0 0 4 6
0 0 2 1.5 most min
1 0 5 3
0 1 2 2

s3 s4 solution
0 0 21
0 0 3
0 0 1.5
1 0 2.5
0 1 0.5
on berdasarkan nilai koefisien X (neg) yang paling kecil
rkan ratio diambil minimum yang positif