Lectures in this course:39
1 - Introduction and Linear Programming (1:02:27)
2 - Revised Simplex Algorithm (57:53)
3 - Simplex Method for Bounded Variables (49:30)
4 - One Dimensional Cutting Stock Problem (58:35)
5 - One Dimensional Cutting Stock Problem (Contd) (58:20)
6 - Dantzig-Wolfe Decomposition Algorithm (58:38)
7 - Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm (57:08)
8 - Primal-Dual Algorithm (57:37)
9 - Goal Programming-Formulations (50:12)
10 - Goal Programming Solutions Complexity of Simplex Algorithm (49:12)
11 - Complexity of Simplex Algorithm (Contd) Integer Programming (50:35)
12 - Integer Programming-Formulations (50:49)
13 - Solving Zero-One Problems (49:05)
14 - Solving Zero-One Problems (Contd) (49:09)
15 - Branch And Bond Algorithm For Integer Programming (47:50)
16 - Cutting Plane Algorithm (48:39)
17 - All Integer Primal Algorithm (50:38)
18 - All Integer Dual Algorithm (50:48)
19 - Network Models (58:16)
20 - Shortest Path Problem (58:04)
21 - Successive Shortest Path Problem (58:35)
22 - Maximum Flow Problem (58:21)
23 - Minimum Cost Flow Problem (58:32)
24 - Traveling Salesman Problem (TSP) (58:30)
25 - Branch and Bound Algorithms for TSP (58:06)
26 - Heuristics for TSP (58:08)
27 - Heuristics for TSP (Contd) (57:55)
28 - Chinese Postman Problem (58:32)
29 - Vehicle Routeing Problem (59:09)
30 - Queueing Models (58:32)
31 - Single Server Queueing Models (56:56)
32 - Multiple Server Queueing Models (56:13)
33 - Game Theory (58:36)
34 - Critical Path Method (57:56)
35 - Quadratic Programming (52:07)
36 - Integer Programming (contd) (51:02)
37 - All Integer Dual Algorithm (51:10)
38 - Mixed Integer Linear Programming (51:43)
39 - Benders Partitioning Algorithm (50:24)

Important: Please enable javascript in your browser and download Adobe Flash player to view this site
Site Maintained by Web Studio, IIT Madras. Contact Webmaster: nptel@iitm.ac.in