Scribd
Upload
420 views2 pages

Tutorial Sheet 3 PDF

This document contains 11 problems involving linear programming techniques like the simplex method, algebraic method, and two-phase method. The problems include maximizing and minimizing linear objective functions subject to various inequality and equality constraints, determining optimal solutions, unboundedness, and formulation in standard form. Graphical and algebraic solutions are required for some problems.

Uploaded by

naman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
420 views2 pages

Tutorial Sheet 3 PDF

This document contains 11 problems involving linear programming techniques like the simplex method, algebraic method, and two-phase method. The problems include maximizing and minimizing linear objective functions subject to various inequality and equality constraints, determining optimal solutions, unboundedness, and formulation in standard form. Graphical and algebraic solutions are required for some problems.

Uploaded by

naman
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

School of Mathematics, Thapar University

Optimization Techniques (UMA-031)


Tutorial Sheet # 3
1. Find an optimal solution to the following linear program using (a) simplex algorithm (b) algebraic method.
Min z x 1 2x 2 3x 3 , s / t x 1 3x 2 6x 3 6 , x 1 x 2 , x 3 0 .

2. Use the Simplex method to solve


Max z 5x1 4 x2 , s / t 6 x1 4 x2 24 , x1 2 x2 6, x1 x2 1, x2 6, x1 , x2 0 ,

3. Consider the following Linear programming problem


Max z x 1 x 2 , s / t x 1 2x 2 3 , 2x 1 x 2 3, x1 , x 2 0 ,
Answer the following questions:

1. Convert the problem into standard form and find all Basic solutions and identify Basic feasible solution.
2. Plot the feasible region.
3. Identify relation between BFS and corner points of the feasible region of above LPP.
4. Construct the simplex table corresponding to the corner point (3/2,0) of the feasible region.
5. Using the simplex table obtained in Part-4 above, find optimal Basic feasible solution of LPP.
6. Identify all the simplex tables obtained in Part 5 above on the graph of the feasible region.
7. 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


Min z x 1 x 2 , s / t x 1 2x 2 3 , x 1 x 2 2 , 3x1 2x 2 6 , x1 , x 2 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 Sol.
Z 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.

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


Min z x1 2 x2 3x3 , s / t 2 x1 2 x2 2 x3 2 x4 6 , 4 x1 5 x2 2 x3 2 x4 12 , x1 , x2 , x3 , x4 0
7. Two consecutive simplex tableaus of a LPP are

B.V. x1 x2 x3 x4 x5 Soln.( XB)


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)


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:
Max z x 1 x 2 , s / t 3x 1 4x 2 3 , x 1 x 2 x 3 0 , x 1 , x 2 , x 3 0 .

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


(a) 2x 1 x 2 x 3 1 , 2x 1 2x 2 x 3 2 , x 1 x 3 3 , x 1 , x 2 , x 3 0 .
(b) x 1 x 2 x 3 1, x 1 x 3 2 , 2x 1 x 2 2x 3 3 .

10. Solve by the Simplex method (without using artificial variables)


(a) Min z 5x 1 3x 2 s/t
x 1 x 2 x 3 2 , 5x 1 2x 2 x 4 10
3x 1 8x 2 x 5 12 , x 1 , x 2 , x 3 , x 4 , x 5 0
Verify your result graphically.
(b) Max z 3x 1 x 2 2x 3
12x 1 3x 2 6x 3 3x 4 9 , 8x 1 x 2 4x 3 2x 5 10
3x 1 x 6 0 , x 1 , . . . , x 6 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) Min z 3x 1 5x 2 , s / t x 1 3x 2 3 , x 1 x 2 2 , x 1 , x 2 0 .
(b) Max z 4x 2 3x 1 , s / t x1 x 2 0 , 2x1 x 2 2 , x 1 , x 2 0 .
(c ) Max z 3x 1 2x 2 , s / t 2x 1 x 2 2 , 3x 1 4x 2 12 , x 1 , x 2 0 .

You might also like