15.

16.

18.

19.

248004

3 D 30562

Solve the following canonical linear programming problem by simplex method :

Solve the non-canonical linear programming problem given below :

Maximize f (x, y) =x + 8y subject to
x+2y <10
3 + ^+ < 15
> 0.

Write the dual simplex algorithm for minimum tableaus.

A company wishes to assign five of its worker to five different jobs (one worker to each job and vice
versa). The rating of each with respect to each job on a scale of 0 to 10 (10 being high rating) is
given by the following table :

فم

= ى ‡

rs

=

Ifthe company wishes to maximize the total rating of the assignment, find the optimal assignment
plan and corresponding maximum total rating.

Apply the minimum entry method to obtain the initial basic feasible solution for the transportation
problem given below :

4 5 5
3 2 7
6 3 9
7 5 4
14 0

Turn over

248004