Thapar Institute of Engineering and Technology, Patiala

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.

M in. z = x1 + 2x2 + 3x3 , S.T. x1 + 3x2 + 6x3 = 6, x1 , x2 , x3 ≥ 0.

2. Use the Simplex method to solve

M ax. z = 5x1 + 4x2 , S.T. 6x1 + 4x2 ≤ 24, x1 + 2x2 ≤ 6, −x1 + x2 ≤ 1, x2 ≤ 6, x1 , x2 ≥ 0.

3. Consider the following Linear programming problem

M ax. z = x1 + x2 , S.T. x1 + 2x2 ≤ 3, 2x1 + x2 ≤ 3, x1 , x2 ≥ 0.

Answer the following questions:

(a) Convert the problem into standard form and find all Basic solutions and identify Basic feasible solution.
(b) Plot the feasible region.
(c) Identify relation between BFS and corner points of the feasible region of above LPP.
(d) Construct the simplex table corresponding to the corner point (3/2, 0) of the feasible region.
(e) Using the simplex table obtained in Part-(d) above, find optimal Basic feasible solution of LPP.
(f) Identify all the simplex tables obtained in Part-(e) above on the graph of the feasible region.
(g) What happens if a non basic variable with most positive zj − cj enters into the basis for the given the problem.
4. Use the simplex method to solve

M in. z = −x1 − x2 , S.T. x1 + 2x2 ≤ 3, x1 + x2 ≤ 2, 3x1 + 2x2 ≤ 6, x1 , x2 ≥ 0.

Find an alternate optimal solution if one exists.

5. Formulate the LPP from the following Optimal table;

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

6. Without using Simplex/Two-phase/Big-M, Solve the following problem,

M in. z = x1 − 2x2 + 3x3 , S.T. 2x1 + 2x2 + 2x3 + 2x4 = 6, 4x1 + 5x2 + 2x3 + 2x4 = 12, x1 , x2 , x3 , x4 ≥ 0.

7. Two consecutive simplex tableaus of a LPP are

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

Find the values of “A to K”.

8. Use the Simplex method to show that the following problem has unbounded solution:

M ax. z = x1 + x2 , S.T. 3x1 − 4x2 ≥ −3, x1 − x2 − x3 = 0, x1 , x2 , x3 ≥ 0.

 9. Solve the following systems of equations using Simplex method:

(a) 2x1 + x2 − x3 = 1, −2x1 + 2x2 − x3 = −2, x1 + x3 = 3, x1 , x2 , x3 ≥ 0.

(b) x1 − x2 + x3 = 1, x1 + x3 = 2, 2x1 + x2 + 2x3 = 3
10. Solve the following by the Simplex method, without using artificial variables:
(a) M in. z = −5x1 − 3x2 , S.T. x1 + x2 + x3 = 2, 5x1 + 2x2 + x4 = 10,
3x1 + 8x2 + x5 = 12, x1 , x2 , x3 , x4 , x5 ≥ 0.
Verify your result graphically.
(b) M ax. z = 3x1 + x2 + 2x3 , S.T. 12x1 + 3x2 + 6x3 + 3x4 = 9,
8x1 + x2 − 4x3 + 2x5 = 10, 3x1 − x6 = 0, x1 , . . . , x6 ≥ 0.
11. Describe the big M and the two phase methods. Which should be preferred and why? Solve the following problems
by both these methods:
(a) M in. z = 3x1 + 5x2 , S.T. x1 + 3x2 ≥ 3, x1 + x2 ≥ 2, x1 , x2 ≥ 0.
(b) M ax. z = 4x2 − 3x1 , S.T. x1 − x2 ≥ 0, 2x1 − x2 ≥ 2, x1 , x2 ≥ 0.
(c) M ax. z = 3x1 + 2x2 , S.T. 2x1 + x2 ≤ 2, 3x1 + 4x2 ≥ 12, x1 , x2 ≥ 0.