Completed
Dynamic programming approach to find shortest path in any network (Dynamic Programming III)
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Non Linear Programming
Automatically move to the next video in the Classroom when playback concludes
- 1 Convex sets and Functions
- 2 Properties of Convex functions - I
- 3 Properties of Convex functions - II
- 4 Properties of Convex functions - III
- 5 Convex Programming Problems
- 6 KKT Optimality conditions
- 7 Quadratic Programming Problems - I
- 8 Quadratic Programming Problems - II
- 9 Separable Programming - I
- 10 Separable Programming - II
- 11 Geometric programming I
- 12 Geometric programming II
- 13 Geometric programming III
- 14 Dynamic programming I
- 15 Dynamic programming II
- 16 Dynamic programming approach to find shortest path in any network (Dynamic Programming III)
- 17 Dynamic programming IV
- 18 Search Techniques - I
- 19 Search Techniques - II
- 20 Fourier Series
- 21 Numerical Integration - II (Simpson's Rule)
