Scribd
Upload
5 views3 pages

Unit-V Dynamic Programming Problem

The document outlines key concepts and applications of Dynamic Programming Problems (DPP), including definitions, Bellman's principle of optimality, and various problem-solving techniques. It presents specific optimization problems to maximize or minimize objectives under given constraints, along with examples related to route planning and resource allocation. Additionally, it includes short answer questions to reinforce understanding of DPP concepts such as stages, policies, and recurrence relations.

Uploaded by

techyprompt
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
5 views3 pages

Unit-V Dynamic Programming Problem

The document outlines key concepts and applications of Dynamic Programming Problems (DPP), including definitions, Bellman's principle of optimality, and various problem-solving techniques. It presents specific optimization problems to maximize or minimize objectives under given constraints, along with examples related to route planning and resource allocation. Additionally, it includes short answer questions to reinforce understanding of DPP concepts such as stages, policies, and recurrence relations.

Uploaded by

techyprompt
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

1

UNIT-V
DYNAMIC PROGRAMMING PROBLEM
1) Define Dynamic Programming Problem.
2) Define D.P.P. Also explain Bellman’s principle of optimality.
3) Explain the applications of Dynamic programming problem.
4) explain i) Stage ii) State iii) Return function
5) Use dynamic programming to solve

Minimize Z = + +

Subject to + + =5

And , , ≥0

6) Determine the value of , , , so as to

Maximize Z = . .

Subject to + + = 10

And , , ≥0

7) Maximum Z = 50 x + 80 y
Such that x ≤ 80
Y ≤ 60
5 x + 6 y ≤ 600
1x + 2 y ≤ 160
And x, y ≥ 0
8) Maximum Z = 3 a + 5 b
Such that a ≤ 4
b≤6
3 a + 2 b ≤ 18
And a, b ≥ 0
9) Mr. Banerjee, a sales manager, has decided to travel from city 1 to city 10. He wants to plan for
minimum distance programme and visit maximum number of branch offices as possible on the route.
The route map of the various ways of reaching city 10 from city 1 is shown below. The numbers on
the arrow indicates the distance in km. (× 100). Suggest a feasible minimum path plan to Mr.
Banerjee.
2

10) The following figure shows the route map of various branch offices of a company. The marketing
executive of the company should like to start from Head office at A and reach the branch office at B
by traveling shortest path and visiting as many as branch offices. Help him to plan his journey by
using dynamic programming technique.
3

Short answers
1) Explain i) Stage ii) Policy
2) Define Bellman’s principle in DPP.
3) Explain about Recurrence relation in DPP.
4) Discuss about Shortest path method in DPP.
5) Explain about Capital Budgeting problem.
6) Define State in DPP.
7) Define Dynamic Programming problem.
8) Explain about Return function in DPP.

You might also like