Lectures in this course:22
1 - Introduction to Linear Programming Formulations (51:48)
2 - Linear Programming Formulations (Contd...) (52:08)
3 - Linear Programming Solutions- Graphical Methods (52:11)
4 - Linear Programming Solutions - Simplex Algorithm (51:30)
5 - Simplex Algorithm-Minimization Problems (52:11)
6 - Simplex Algorithm - Initialization and Iteration (52:24)
7 - Simplex Algorithm - Termination (51:37)
8 - Introduction to Duality (51:03)
9 - Primal Dual Relationships, Duality Theorems (51:37)
10 - Dual Variables and the Simplex Tables (51:37)
11 - Simplex Algorithm in Matrix Form Introduction to Sensitivity Analysis (1:01:36)
12 - Sensitivity Analysis Transportation Problem (Introduction) (1:01:46)
13 - Transportation Problem, Methods for Initial Basic Feasible Solutions (1:00:49)
14 - Transportation Problem-Optimal Solutions (1:01:07)
15 - Transportation Problem - Other Issues (1:01:40)
16 - Assignment Problem - Hungarian Algorithm (1:00:16)
17 - Assignment Problem - Other Issues Introduction to Dynamic Programming (1:01:50)
18 - Dynamic Programming - Examples Involving Discrete Variables (54:26)
19 - Dynamic Programming - Continuous Variables (59:09)
20 - Dynamic Programming - Examples to Solve Linear & Integer Programming Problems (1:00:51)
21 - Inventory Models - Deterministic Models (1:01:04)
22 - Inventory Models - Discount Models, Constrained Inventory Problems, Lagrangean Multipliers, Conclusions (1:00:51)

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