HARCOURT BUTLER TECHNICAL UNIVERSITY, KANPUR

ASSSIGNMENT – Unit-5 (OPERATIONS RESEARCH) BMA-351

III -B.Tech. - ET /CE/ CS/ IT 2023-24

1. What is dynamic programming? State the Bellman’s “principle of optimality” in dynamic

programming and give mathematical formulation of D.P.
2. Use dynamic programming to show that:
𝑝1 log 𝑝1 + 𝑝2 log 𝑝2 + ⋯ + 𝑝𝑛 log 𝑝𝑛
Subject to the constraint
𝑝1 + 𝑝2 + ⋯ + 𝑝𝑛 = 1 𝑎𝑛𝑑 𝑝𝑖 ≥ 0, 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑖 𝑖𝑠 𝑚𝑖𝑛𝑖𝑚𝑢𝑚
𝑤ℎ𝑒𝑛 𝑝1 = 𝑝2 = 𝑝3 … . = 𝑝𝑛 = 1/𝑛

3. Use dynamic programming to solve :

Minimize Z = 𝑦12 + 𝑦22 + 𝑦32
Subject to constraints: 𝑦1 + 𝑦2 + 𝑦3 = 10 𝑎𝑛𝑑 𝑦1 , 𝑦2 , 𝑦3 ≥ 0

4. Use dynamic programming to find the maximum value of

Maximize Z = 𝑥1 . 𝑥2 … … 𝑥𝑛
Subject to constraints: 𝑥1 + 𝑥2 + ⋯ + 𝑥𝑛 = 𝐶 𝑎𝑛𝑑 𝑥1 , 𝑥2 , … , 𝑥𝑛 ≥ 0
5. Use dynamic programming to solve the following problem.
Minimize Z = 𝑦12 + 𝑦22 + 𝑦32
Subject to constraints: 𝑦1 + 𝑦2 + 𝑦3 ≥ 15 𝑎𝑛𝑑 𝑦1 , 𝑦2 , 𝑦3 ≥ 0

6. Use the principle of optimality to find the maximum value of

Z= 𝑏1 𝑥1 + 𝑏2 𝑥2 + ⋯ + 𝑏𝑛 𝑥𝑛
When 𝑥1 + 𝑥2 + ⋯ + 𝑥𝑛 = 𝐶, 𝑥1 , 𝑥2 , … , 𝑥𝑛 ≥ 0

7. Use dynamic programming to solve the following LPP:

𝑀𝑎𝑥 𝑧 = 3𝑥1 + 5𝑥2
Subject to the constraints:
𝑥1 ≤ 4, 𝑥2 ≤ 6 , 3𝑥1 + 2𝑥2 ≤ 18
𝑥1 , 𝑥2 ≥ 0
8. Use dynamic programming to solve the following LPP:

𝑀𝑎𝑥 𝑧 = 𝑥1 + 9𝑥2
Subject to the constraints:
2𝑥1 + 𝑥2 ≤ 2 𝑥2 ≤ 11 𝑥1 , 𝑥2 ≥ 0
9. State the various steps involved for solving the multistage problem by dynamic
programming.