Beruflich Dokumente
Kultur Dokumente
School of Mathematics
Optimization Techniques (UMA031)
Tutorial sheet No. 4
1. Find an optimal solution to the following linear program using (a) simplex algorithm (b) algebraic method.
CB B.V↓ x1 x2 x3 s1 s2 Soln.
z-row→ 0 0 17/7 6/7 4/7 2
4 x2 0 1 1/7 2/7 −1/7 0
2 x1 1 0 17/7 −1/7 4/7 1
M in. z = x1 − 2x2 + 3x3 , S.T. 2x1 + 2x2 + 2x3 + 2x4 = 6, 4x1 + 5x2 + 2x3 + 2x4 = 12, x1 , x2 , x3 , x4 ≥ 0.
B.V↓ x1 x2 x3 x4 x5 Soln.(XB )
z-row→ A −1 3 0 0
x4 B C D I 0 6
x5 −1 2 E 0 1 1
B.V↓ x1 x2 x3 x4 x5 Soln.(XB )
z-row→ 0 −4 J K 0
x1 G 2/3 2/3 1/3 0 F
x5 H 8/3 −1/3 1/3 1 3