x
Menu

Advanced Operations Research

IIT Madras, , Prof. G.Srinivasan

Updated On 02 Feb, 19

Overview

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

Includes

Lecture 9: Goal Programming-Formulations

4.1 ( 11 )


Lecture Details

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

Ratings

5.0


1 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send