SignUpAdvanced Operations Research
IIT Madras, , Prof. G.Srinivasan
Updated On 02 Feb, 19
x
IIT Madras, , Prof. G.Srinivasan
Updated On 02 Feb, 19
Introduction and Linear Programming - Revised Simplex Algorithm-Simplex Method for Bounded Variables - One Dimensional Cutting Stock Problem - Dantzig - Wolfe Decomposition Algorithm - Primal -Dual Algorithm - Goal Programming - Formulations - Goal Programming Solutions Complexity of Simplex Algorithm - Complexity of Simplex Algorithm(Contd) Integer Programming - Integer Programming -Formulations - Solving Zero - One Problems(Contd) - Branch And Bond Algorithm For Integer Programming
Cutting Plane Algorithm - All Integer Primal Algorithm - All Integer Dual Algorithm - Network Models - Shortest Path Problem - Successive Shortest Path Problem - Minimum Cost Flow Problem - Traveling Salesman Problem(TSP) - Branch and Bound Algorithms for TSP - Heuristics for TSP - Chinese Postman Problem - Vehicle Routeing Problem - Queueing Models - Single Server Queueing Models - Multiple Server Queueing Models - Game Theory - Critical Path Method - Quadratic Programming
4.1 ( 11 )
Lecture series on Advanced Operations Research by Prof. G.Srinivasan, Department of Management Studies, IIT Madras. For more details on NPTEL visit httpnptel.iitm.ac.in
Sam
Sep 12, 2018
Excellent course helped me understand topic that i couldn't while attendinfg my college.
Dembe
March 29, 2019
Great course. Thank you very much.
