Slitting saw of a milling machine cutting a steel part
Photo by David English from Wikimedia Commons, CC BY-SA 4.0, cropped

Optimization Methods

Simplex Method

Press Solve.

How it works

The problem is written as a table: a row for each constraint, with an extra variable s that turns the inequality into an equation, and the row c with the objective. All variables are not negative. Each step brings one variable into the basis; the framed cell is the one the next step is made on. The steps stop when the objective cannot grow. In the last table the numbers of the row c under s1, s2 and s3 are the shadow prices: how much the objective grows when the right-hand side of that constraint grows by one. The numbers are kept as common fractions, so nothing is rounded.

From the course

  • Semester 4
  • Practice 7: software implementation of the Simplex algorithm
  • Written in Python

Useful resources

  1. Simplex algorithm the article from the Wikipedia