Advanced Operations Research

Advanced Operations Research
Lecture series on Advanced Operations Research by Prof. G.Srinivasan, Department of Management Studies, IIT Madras.
Lec-1 Introduction and Linear Programming
Lec-2 Revised Simplex Algorithm
Lec-3 Simplex Method for Bounded Variables
Lec-4 One Dimensional Cutting Stock Problem
Lec-5 One Dimensional Cutting Stock Problem(Contd)
Lec-6 Dantzig-Wolfe Decomposition Algorithm
Lec-7 Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm
Lec-8 Primal-Dual Algorithm
Lec-9 Goal Programming-Formulations
Lec-10 Goal Programming Solutions Complexity of Simplex Algorithm
Lec-11 Complexity of Simplex Algorithm(Contd) Integer Programming
Lec-12 Integer Programming-Formulations
Lec-13 Solving Zero-One Problems
Lec-14 Solving Zero-One Problems(Contd)
Lec-15 Branch And Bond Algorithm For Integer Programming
Lec-16 Cutting Plane Algorithm
Lec-17 All Integer Primal Algorithm
Lec-18 All Integer Dual Algorithm
Lec-19 Network Models
Lec-20 Shortest Path Problem
Lec-21 Successive Shortest Path Problem
Lec-22 Maximum Flow Problem
Lec-23 Minimum Cost Flow Problem
Lec-24 Traveling Salesman Problem(TSP)
Lec-25 Branch and Bound Algorithms for TSP
Lec-26 Heuristics for TSP
Lec-27 Heuristics for TSP(Contd)
Lec-28 Chinese Postman Problem
Lec-29 Vehicle Routeing Problem
Lec-30 Queueing Models
Lec-31 Single Server Queueing Models
Lec-32 Multiple Server Queueing Models
Lec-33 Game Theory
Lec-34 Critical Path Method
Lec-35 Quadratic Programming
Lec 36 - Integer Programming(continued)
Lec 37 - All Integer Dual Algorithm
Lec 38 - Mixed Integer Linear Programming