b)

7 (a)

b)

8 (a)

H192146 Pages: 4

Solve the following transhipment problem.

S1 S2 D1 D2 supply

51 bad 4 5
52 2 25
01 3
02 4

PART (^
Answer any two full questions, each carries 20 marks.

Tasks A, B, C,....... , H, I constitute a project. The precedence relationships are
Aproject and find the minimum time of completion of the project when time, in
days, of each task is as follows:

Task: A 8 மழ ‏يم‎ © H I

Time: 8 10 8 10 16 17 18 14 9

Also identify the critical path and determine the total, free and independent floats

Find the shortest path ‘a’ to “മ for the following graph using Dijkstra’s algorithm.
b 2 d
a ங்கு 2
ಖು
34
௦ 1 2

Use dynamic programming solve Minimise 7 = y? + y3 + y# subject to the
constraints

21 + 22 + 23 2 15 and 9, 92, 93 2 0
Using dynamic programming solve the LPP Maximise Z = x, + 9x2 such that
22൮ + ‏جع ,25 > ود‎ > 11. 21,22 20

In the network shown below find the maximum flow and verify your answer using
max flow min cut theorem

Page 3084

(8)

(10)

(10)

(10)

(10)

(10)