Learn · Introduction to Operations Research
Lecture 32 of 36Week 7 : Assignment Problem
Lec 2 : Unboundedness and infeasibility
Prof. G. Srinivasan · IIT Madras
Credits and licence
- From
- Introduction to Operations Research, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lec 1: Product Mix problem and Notations
- Lec 2: Manpower and Production planning formulations
- Lec 3: Media selection problem and Bicycle problem
- Lec 4: Caterer problem
- Lec 5: Maximum flow and bin packing problems
- Lec 1: Graphical method (maximization)
- Lec 2: Graphical method (minimization)
- Lec 3: Algebraic method (maximization)
- Lec 4: Algebraic method (minimization)
- Lec 5: Comparing graphical and algebraic methods
- Lec 1: Algebraic form of simplex algorithm
- Lec 2 : Tabular form of simplex (maximization)
- Lec 3 : Tabular form (minimization)
- Lec 4 : Unboundedness
- Lec 5 : Infeasibility
- Lec 1 : Motivation to the dual
- Lec 2 : Writing the dual for a general LP
- Lec 3 : Writing dual for a general LP (continued)
- Lec 4 : Duality theorems
- Lec 5 : Complimentary slackness theorem
- Lec 1 : Dual solution using complimentary slackness
- Lec 2 : Dual solution from simplex table; economic interpretation of dual
- Lec 3 : Economic Interpretation of the dual; Dual Simplex algorithm
- Lec 4 : Solving LPs with mixed type of constraints
- Lec 5 : Matrix method for LP problems
- Lec 1 : Introducing the transportation problem
- Lec 2 : North West corner Rule and minimum cost method
- Lec 3 : Penalty cost method
- Lec 4 : Stepping stone method and Modified Distribution method
- Lec 5 : MODI method; Dual of the transportation problem and the optimality of the MODI method
- Lec 1 : Setting up the problem and solving simple LP problems
- Lec 2 : Unboundedness and infeasibility
- Lec 3 : Solving other formulations
- Lec 4 : Solving a transportation problem
- Lec 5 : Solving an assignment problem
- Live Session 24-03-2021