1:02:27 Lec-1 Introduction and Linear Programming

57:53 Lec-2 Revised Simplex Algorithm

49:30 Lec-3 Simplex Method for Bounded Variables

58:35 Lec-4 One Dimensional Cutting Stock Problem

58:20 Lec-5 One Dimensional Cutting Stock Problem(Contd)

58:38 Lec-6 Dantzig-Wolfe Decomposition Algorithm

57:08 Lec-7 Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm

57:37 Lec-8 Primal-Dual Algorithm

50:12 Lec-9 Goal Programming-Formulations

49:12 Lec-10 Goal Programming Solutions Complexity of Simplex Algorithm

50:35 Lec-11 Complexity of Simplex Algorithm(Contd) Integer Programming

50:49 Lec-12 Integer Programming-Formulations

49:05 Lec-13 Solving Zero-One Problems

49:09 Lec-14 Solving Zero-One Problems(Contd)

47:50 Lec-15 Branch And Bond Algorithm For Integer Programming

48:39 Lec-16 Cutting Plane Algorithm

50:38 Lec-17 All Integer Primal Algorithm

50:48 Lec-18 All Integer Dual Algorithm

58:16 Lec-19 Network Models

58:04 Lec-20 Shortest Path Problem

58:35 Lec-21 Successive Shortest Path Problem

58:21 Lec-22 Maximum Flow Problem

58:32 Lec-23 Minimum Cost Flow Problem

58:30 Lec-24 Traveling Salesman Problem(TSP)

58:06 Lec-25 Branch and Bound Algorithms for TSP

58:08 Lec-26 Heuristics for TSP

57:55 Lec-27 Heuristics for TSP(Contd)

58:23 Lec-28 Chinese Postman Problem

59:08 Lec-29 Vehicle Routeing Problem

58:32 Lec-30 Queueing Models

56:56 Lec-31 Single Server Queueing Models

56:13 Lec-32 Multiple Server Queueing Models

58:36 Lec-33 Game Theory

57:56 Lec-34 Critical Path Method

52:07 Lec-35 Quadratic Programming