LP Simplex-Very Simple Overview

• Min Cx, Ax=B

• All variables non-negative

• Find a basic solution

• Perfom pivot operations (Gaussian Elimination)

  • Make sure is basic feasible solution

• If there are not any other improving pivot operations, current solution is an optimal value

Previous slide

Next slide

Back to first slide

View graphic version