NPTEL : Advanced Operations Research (Mechanical Engineering)

Co-ordinators : Prof. G. Srinivasan


Lecture 1 - Introduction and Linear Programming

Lecture 2 - Revised Simplex Algorithm

Lecture 3 - Simplex Method for Bounded Variables

Lecture 4 - One Dimensional Cutting Stock Problem

Lecture 5 - One Dimensional Cutting Stock Problem (Continued.)

Lecture 6 - Dantzig-Wolfe Decomposition Algorithm

Lecture 7 - Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm

Lecture 8 - Primal-Dual Algorithm

Lecture 9 - Goal Programming-Formulations

Lecture 10 - Goal Programming Solutions Complexity of Simplex Algorithm

Lecture 11 - Complexity of Simplex Algorithm (Continued.) Integer Programming

Lecture 12 - Integer Programming-Formulations

Lecture 13 - Solving Zero-One Problems

Lecture 14 - Solving Zero-One Problems (Continued.)

Lecture 15 - Branch And Bond Algorithm For Integer Programming

Lecture 16 - Cutting Plane Algorithm

Lecture 17 - All Integer Primal Algorithm

Lecture 18 - All Integer Dual Algorithm

Lecture 19 - Network Models

Lecture 20 - Shortest Path Problem

Lecture 21 - Successive Shortest Path Problem

Lecture 22 - Maximum Flow Problem

Lecture 23 - Minimum Cost Flow Problem

Lecture 24 - Traveling Salesman Problem (TSP)

Lecture 25 - Branch and Bound Algorithms for TSP

Lecture 26 - Heuristics for TSP

Lecture 27 - Heuristics for TSP (Continued.)

Lecture 28 - Chinese Postman Problem

Lecture 29 - Vehicle Routeing Problem

Lecture 30 - Queueing Models

Lecture 31 - Single Server Queueing Models

Lecture 32 - Multiple Server Queueing Models

Lecture 33 - Game Theory

Lecture 34 - Critical Path Method

Lecture 35 - Quadratic Programming

Lecture 36 - Integer Programming (Continued.)

Lecture 37 - All Integer Dual Algorithm

Lecture 38 - Mixed Integer Linear Programming

Lecture 39 - Benders Partitioning Algorithm