16040

2 D 10669

9. Consider the canonical maximization linear programming problem given below ;

Maximize f (1,22) =<, subject to

1> و2 + 3221

1< ولا - 201

22 - 2] = 1

X1,X_ 20

state the dual canonical minimization of the linear programming problem.

10. Distinguish between balanced and unbalanced transportation problem.

11. Using VAM to obtain a basic feasible solution of the transportation problem given below :

4 5 5
3 2 7
6 3 9
7 5 4
14 11
12. Explain the minimum entry method for obtaining initial basic feasible solution in transportation
problem.

(8 x 3 = 24 marks)
Section B

Answer at least five questions.

Each question carries 5 marks.

All questions can be attended.
Overall Ceiling 25.

13. Solve the following linear programming problem by geometrical method.
Maximize f(x,y) =—2y—x subject to
22८ - + > -1

3+- < 8
2८, + 2 0.

14. Solve the following canonical linear programming problem using simplex algorithm :

xy Xo ர்‌

16040