Linear Programming
Math · Intermediate · Lesson 5 of 7

The Simplex Method

Corner to corner, uphill

An interactive lesson with 7 steps, about 6 minutes: you predict, drag and solve, with instant feedback on every answer. It runs in your browser and needs JavaScript.

What you’ll learn

  • The simplex method walks from corner to better corner.
  • Convexity guarantees that a local best corner is the global best.
  • Interior-point methods take a shortcut through the middle.

Steps

  1. Thousands of variables
  2. Too many corners
  3. Why stopping is safe
  4. Fast in practice
  5. Walking the corners
  6. Two ways to the top
  7. A different route