a)

b)

a)

b)

H1122 Pages: 4

Use dynamic programming solve Maximise Z = 11. 22.13 Subject to the
constraints

21 + 372 + ‏ویر‎ = 5 and 9, 92, 93 > 0

A vessel is to be loaded with stocks of four items. Each unit of item has weight
of w and value r. The maximum cargo weight the vessel can take is 8 and the

details of three items are as follows

Develop recursive equation for the above case and find the most valuable cargo
load without exceeding the maximum cargo weight by using dynamic

programming.

Apply Prim’s method starting from A to obtain a minimum spanning tree for the

graph. Give a trace of the process

Using dynamic programming solve the LPP
Maximise 2 = 221 + 5x2

Subjected to

22൮ + 22 > 0

2x2 ട്‌ 460

21, 2 20

KKK

Page 4of 4

(10)

(10)

(10)

(10)