Learn · Linear programming and its applications to computer science
Lecture 7 of 49Week 2
Lecture 7: Solutions of linear equations
Prof. Rajat Mittal · IIT Kanpur
Credits and licence
- From
- Linear programming and its applications to computer science, IIT Kanpur (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
- Lecture 1 : Linear programming, an example
- Lecture 2 : Introduction to linear programming
- Lecture 3 : Gaussian elimination with examples
- Lecture 4 : Summary of Gaussian elimination
- Lecture 5: Vector space over real numbers
- Lecture 6: Linear operators
- Lecture 7: Solutions of linear equations
- Lecture 8: Resource allocation as LP
- Lecture 9: Approximate degree as LP
- Lecture 10: Equivalent LP's
- Lecture 11: Introduction to convexity
- Lecture 12: Different kind of convex sets
- Lecture 13: Feasible region of LP
- Lecture 14: Proof of Weyl's theorem
- Lecture 15: Definition of convex functions
- Lecture 16: Properties of convex functions and examples
- Lecture 17: Basic feasible solution
- Lecture 18: BFS and vertices
- Lecture 19: Simplex algorithm
- Lecture 20: Details of simplex algorithm
- Lecture 21: Starting BFS
- Lecture 22: Degeneracy
- Lecture 23: Introduction to duality
- Lecture 24: Hyperplane separation theorems
- Lecture 25: Farkas Lemma
- Lecture 26: How to take dual
- Lecture 27: Examples of taking dual
- Lecture 28: Strong Duality
- Lecture 29: Proof of strong duality
- Lecture 30: Complementary slackness
- Lecture 31: Introduction to algorithmic game theory
- Lecture 32: Nash equilibrium
- Lecture 33: Minimax and Nash equilibrium
- Lecture 34: Deterministic communication complexity
- Lecture 35: Randomized communication complexity
- Lecture 36: Yao's minimax theorem
- Lecture 37: Lower bounds using Yao's minimax
- Lecture 38: Set disjointness problem
- Lecture 39: LP for max flow problem
- Lecture 40: LP for min cut problem
- Lecture 41: max flow = min cut
- Lecture 42: Primal dual approach
- Lecture 43: Primal dual for max flow
- Lecture 44: Set cover problem
- Lecture 45: Rounding for set cover
- Lecture 46: Analysis of rounding
- Lecture 47: Algorithm for set cover
- Lecture 48: Linear regression through LP
- Lecture 49: Linear classifiers through LP