Learn · Nonlinear programming

Lecture 16 of 20Unit-4

Dynamic programming approach to find shortest path in any network.

Prof. S. K. Gupta · IIT Roorkee

Credits and licence

From
Nonlinear programming, IIT Roorkee (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Convex Sets and Functions Video
  2. Properties of Convex Functions-I Video
  3. Properties of Convex Functions-II Video
  4. Properties of Convex Functions- III Video
  5. Convex Programming Problems Video
  6. KKT optimality conditions Video
  7. Quadratic Programming Problems-I Video
  8. Quadratic Programming Problems -II Video
  9. Separable Programming-I Video
  10. Separable Programming-II Video
  11. Geometric Programming-I Video
  12. Geometric Programming-II Video
  13. Geometric Programming-III Video
  14. Dynamic Programming-I Video
  15. Dynamic Programming-II Video
  16. Dynamic programming approach to find shortest path in any network. Video
  17. Dynamic Programming-IV Video
  18. Search Techniques-I Video
  19. Search Techniques-II Video
  20. Search Techniques-III Video