Revised Simplex Method Solution
Iteration 1: Initial Tableau
This is the starting setup based on the problem data provided.
B1−1
Basic Variables (1) (1) XB
E1 (z) β1 β2
Z 1 0 0 0
s1 0 1 0 6
s2 0 0 1 3
(1) (1)
α1 α2
−2 −1
3 4
6 1
Iteration 1: Pivot Selection
The most negative reduced cost is −2, so x1 enters the basis. We calculate the entering column (Xk ) and
perform the minimum ratio test to find the leaving variable.
B1−1
Basic Variables (1) (1) XB Xk Ratio
E1 (z) β1 β2 for x1 XB /Xk
s1 0 1 0 6 3 6/3 = 2
s2 ← Leaves 0 0 1 3 6 3/6 = 0.5 (min)
1
Iteration 2: Tableau after Pivot
After pivoting, the new basis is {s1 , x1 }. The new inverse matrix, solution, and reduced costs are calcu-
lated.
B2−1
Basic Variables (2) (2) XB
E1 (z) β1 β2
Z ... 1
s1 0 1 − 12 4.5
1
x1 0 0 6 0.5
New Reduced Costs
for s2 for x2
1
3 − 23
Iteration 2: Pivot Selection
The new negative reduced cost is − 23 , so x2 enters. We calculate the new Xk column and perform the
ratio test again.
B2−1
Basic Variables (2) (2) XB Xk Ratio
E1 (z) β1 β2 for x2 XB /Xk
s1 ← Leaves 0 1 − 21 4.5 3.5 4.5/3.5 ≈ 1.286 (min)
1 1
x1 0 0 6 0.5 6 0.5/(1/6) = 3
Final Optimal Tableau
All reduced costs are now non-negative, indicating an optimal solution.
Bf−1
inal
Basic Variables (3) (3)
XB
E1 (z) β1 β2
13
Z ... 7
2
x2 0 7 − 17 9
7
1 4 2
x1 0 − 21 21 7