Advanced Operations Research

IIT Madras , Prof.G.Srinivasan

Queueing Models

8586 views

Lecture Description

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

SEE ALLAdd a note
YOU
Add your Comment
 

About

FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

help@freevideolectures.com

Learn More About us

FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel