Skip to content

6. Linear Programming and Reductions

Introduction + Video Lectures 1

Videos

  • Linear Programming involves choosing a course of action that will maximize or minimize a linear objective function, subject to a set of linear constraints.
  • Simplex Method is a popular algorithm for solving linear programming problems; it is an algorithm that implements LP solutions.

Linear Programming 2

The Simplex Method 3

References

  1. Learning Guide Unit 6: Introduction | Home. (2025). Uopeople.edu. https://my.uopeople.edu/mod/book/view.php?id=453928&chapterid=554125 ↩

  2. Chapter 7 Linear Programming in Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani available at http://www.cs.berkeley.edu/~vazirani/algorithms/chap7.pdf ↩

  3. PatrickJMT Free Math Video Tutorials – Simplex Method http://www.youtube.com/user/patrickJMT/videos?query=simplex ↩