Advanced Operations Research

IIT Madras Course , Prof. G.Srinivasan

Lecture 30: Queueing Models

Download:    MP4,FLV & 3GP
 
Lecture Details :

Lecture series on Advanced Operations Research by Prof. G.Srinivasan, Department of Management Studies, IIT Madras. For more details on NPTEL visit http://nptel.iitm.ac.in

Course Description :

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

Other Resources

IITMadras delivers the above video lessons under NPTEL program, there are more than 6000+ nptel video lectures by other IIT's as well.

COURSE Reviews

5 Stars 65
4 Stars 19
3 Stars 6
2 Stars 6
1 Stars 29
3.7 Overall Ratings
Top