Linear Programming Problems 1KW7M6KGBF
| URI | m2://res/1KW7M6KGBF |
|---|---|
| Kind | course |
| Creators | Aparna Mehra (instructor) |
| Scope | in |
| Ids | course 049tgcd06:111102012 |
Expressions
e1: edition
| Language | en |
|---|
- m1: page, IIT Delhi (record). nptel 111102012
Contents
- part 1: Knowledge to Begin With
- session 1: Linear programming modeling, Optimal solutions and grap
- session 2: Notion of convex set, convex function, their prope
- session 3: Preliminary definitions (like convex combination,
- session 4: Optimal hyper-plane and existence of optimal solut
- part 2: Solution Concept in Linear Programs
- session 5: Basic feasible solutions: algebraic interpretation
- session 6: Relationship between extreme points and correspond
- session 7: Adjacent extreme points and corresponding BFS alo
- session 8: Fundamental theorem of LPP and its illustration th
- part 3: The Simplex Algorithm
- session 9: LPP in canonical form to get the initial BFS & meth
- session 10: Case of unbounded LPP, Simplex algorithm and illustrati
- session 11: Artificial variables and its interpretation in co
- part 4: The Two Phase Method
- session 12: Two phase method and illustration
- session 13: Degeneracy and its consequences including cases of cycl
- part 5: Linear Programming Duality
- session 14: Introduction to duality & formulation of dual LPP for d
- session 15: Duality theorems and their interpretations
- session 16: Complementary slackness theorem, Farkas Lemma, Ex
- session 17: Economic interpretation & applications of duality
- session 18: Dual simplex method and its illustration
- part 6: Post Optimality Analysis
- session 19: Post optimality analysis: the cases of change in re
- session 20: Sensitivity analysis for addition and deletion of
- session 21: Lecture 3
- part 7: Karmarkar’s Interior Point Method
- session 22: Karmarkar's interior point method
- session 23: How to model the given LPP in Karmarkar's framewo
- session 24: Complexity issue of Karmarkar's method
- part 8: Integer Programming
- session 25: Integer programming: modeling & a look at its feasi
- session 26: Gomory cut algorithm and derivation of cut equatio
- session 27: Examples
- session 28: Branch and Bound algorithm
- part 9: Transportation and Assignment Problems
- session 29: Special LPPs: Transportation programming problem, m
- session 30: Initial BFS and optimal solution of balanced TP pr
- session 31: Other forms of TP and requisite modifications
- session 32: Assignment problems and permutation matrix
- session 33: Hungarian Method
- session 34: Duality in Assignment Problems
- part 10: Some Applications of Linear Programming
- session 35: Network Problems and LPP Formulation
- session 36: Network Simplex Method:
Catalogue records
- nptel: 111102012 (manifestation)