IIT Madras · Engineering
Advanced Operations Research
Prof. G. Srinivasan · 39 free video lectures
39 video lectures. Topics: Introduction and Linear Programming; Revised Simplex Algorithm; Simplex Method for Bounded Variables; One Dimensional Cutting Stock Problem; One Dimensional Cutting Stock Problem (Contd); Dantzig-Wolfe Decomposition Algorithm; Dantzig-Wolfe Decomposition Algorithm…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction and Linear Programming
- Revised Simplex Algorithm
- Simplex Method for Bounded Variables
- One Dimensional Cutting Stock Problem
- One Dimensional Cutting Stock Problem (Contd)
- Dantzig-Wolfe Decomposition Algorithm
- Dantzig-Wolfe Decomposition Algorithm Primal-Dual 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
- 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
- Maximum Flow Problem
- Minimum Cost Flow Problem
- Traveling Salesman Problem (TSP)
- Branch and Bound Algorithms for TSP
- Heuristics for TSP
- Heuristics for TSP (Contd)
- Chinese Postman Problem
- Vehicle Routeing Problem
- Queueing Models
- Single Server Queueing Models
- Multiple Server Queueing Models
- Game Theory
- Critical Path Method
- Quadratic Programming
- Integer Programming(continued)
- All Integer Dual Algorithm
- Mixed Integer Linear Programming
- Benders Partitioning Algorithm
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Madras.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights