10.

11.

12.

13.

14.

248004

2 D 30562

Write the simplex algorithm for minimum tableaus.

What do you mean by complementary slackness ?

State Duality theorem.

Consider the canonical minimization linear programming problem given below :

Minimize g (31, y2)=— yo subject to
೫1 2 21
‏پیر+ ہر-‎ <2
೫॥ ‏01ھ ول‎

State the dual canonical maximization of the linear programming problem.

Using VAM to obtain an initial basic feasible solution of the transportation problem given below :

Write the Hungarian algorithm for solving assignment problem.

Explain Northwest-corner method for obtaining initial basic feasible solution in transportation
problem.

Section B

Answer any number of questions.
Each question carries 5 marks.
Ceiling is 30.

Solve the following linear programming problem by geometrical method :

Maximize f (x, y) = 5x + 2y subject to
x+3y<14
2x+y<8

x,y 20.

Solve the following canonical linear programming problem using simplex algorithm :

248004