Simplex Algorithm

• A optimization problem (C, f) is in simplex form:

  • C is the conjunction of CE and CI
  • CE is a conjunction of linear equations
  • CI constrains all variables in C to be non-negative
  • f is a linear expression over variables in C

Previous slide

Next slide

Back to first slide

View graphic version