1 – Introduction and Linear Programming Operations Research 62m 27s Click to view videos

Video Lecture Description Sub-Category Time Click to view video Back to Management Video Lecture Course Page 1 – Introduction and Linear Programming Operations Research 62m 27s Click to view videos 2 – Revised Simplex Algorithm Operations Research 57m 53s Click to view videos 3 – Simplex Method for Bounded Variables Operations Research 49m 30s Click to view videos 4 – One Dimensional Cutting Stock Problem Operations Research 58m 35s Click to view videos 5 – One Dimensional Cutting Stock Problem (Contd) Operations Research 58m 20s Click to view videos 6 – Dantzig-Wolfe Decomposition Algorithm Operations Research 58m 38s Click to view videos 7 – Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm Operations Research 57m 08s Click to view videos 8 – Primal-Dual Algorithm Operations Research 57m 37s Click to view videos 9 – Goal Programming-Formulations Operations Research 50m 12s Click to view videos 10 – Goal Programming Solutions Complexity of Simplex Algorithm Operations Research 49m 12s Click to view videos 11 – Complexity of Simplex Algorithm (Contd) Integer Programming Operations Research 50m 35s Click to view videos 12 – Integer Programming-Formulations Operations Research 50m 49s Click to view videos 13 – Solving Zero-One Problems Operations Research 49m 05s Click to view videos 14 – Solving Zero-One Problems (Contd) Operations Research 49m 09s Click to view videos 15 – Branch And Bond Algorithm For Integer Programming Operations Research 47m 50s Click to view videos 16 – Cutting Plane Algorithm Operations Research 48m 39s Click to view videos 17 – All Integer Primal Algorithm Operations Research 50m 38s Click to view videos 18 – All Integer Dual Algorithm Operations Research 50m 48s Click to view videos 19 – Network Models Operations Research 58m 16s Click to view videos 20 – Shortest Path Problem Operations Research 58m 04s Click to view videos 21 – Successive Shortest Path Problem Operations Research 58m 35s Click to view videos 22 – Maximum Flow Problem Operations Research 58m 21s Click to view videos 23 – Minimum Cost Flow Problem Operations Research 58m 32s Click to view videos 24 – Traveling Salesman Problem (TSP) Operations Research 58m 30s Click to view videos 25 – Branch and Bound Algorithms for TSP Operations Research 58m 06s Click to view videos 26 – Heuristics for TSP Operations Research 58m 08s Click to view videos 27 – Heuristics for TSP (Contd) Operations Research 57m 55s Click to view videos 28 – Chinese Postman Problem Operations Research 58m 32s Click to view videos 29 – Vehicle Routing Problem Operations Research 59m 09s Click to view videos 30 – Queueing Models Operations Research 58m 32s Click to view videos 31 – Single Server Queueing Models Operations Research 56m 56s Click to view videos 32 – Multiple Server Queueing Models Operations Research 56m 13s Click to view videos 33 – Game Theory Operations Research 58m 36s Click to view videos 34 – Critical Path Method Operations Research 57m 56s Click to view videos 35 – Quadratic Programming Operations Research 52m 07s Click to view videos