16040

3 D 10669
15. Solve the canonical linear programming problem using simplex algorithm :
x
2
-1

16. Solve the non-canonical linear programming problem given below
Maximize f (x,y,z) =2x + y—2z subject to
x+ytz<1
3442-2
x,y,z 20.
17. Write the dual simplex algorithm for minimum tableaus.
18. Solve the transportation problem given below :

M, M, 113

W, 2 50
7 7 70
Ws 9 20

40 50 20

19. Apply Northwest-corner method to obtain the initial basic feasible solution of the transportation
problem given below :

7 2 4 10
10 5 9 20
7 3 5 30

20 10 30

(5 x 5 = 25 marks)
Section C

Answer any one question.
The question carries 11 marks.

20. Solve the canonical linear programming problem given below using the simplex algorithm.

Turn over

16040