dynamic programming in operational research.pptx

dynamic programming in operational research.pptx

• 1.
  DYNAMIC PROGRAMMING Kirshan ram CS-0122-039
• 2.
  INTRODUCTION Dynamic Programming (DP)is a method in Operational Research used to solve complex problems by breaking them into smaller, simpler sub-problems and then solving them step by step.
• 3.
  USAGE It is mostlyused when: • A problem involves multiple stages/steps. • Each stage has different decisions to make. • The decision in one stage affects the next stage.
• 4.
  EXAMPLE (BEGINNER- FRIENDLY) Imagine youare traveling from city A to city D, and there are cities B and C in between. • From A → B → D or A → C → D, you want to choose the cheapest route. • If you calculate the shortest/cheapest path from each city step by step and then combine, that is dynamic programming.
• 5.
  🔹 IN OPERATIONAL RESEARCH •DP is used for optimization problems (finding best results). • Applications include: ⚬ Shortest path problem (transportation, logistics) ⚬ Resource allocation (dividing resources for maximum profit) ⚬ Inventory management (when to order stock to minimize cost) ⚬ Project scheduling (breaking tasks into stages)
• 6.
  THANK YOU