Simplex Algorithm

1. Set up the linear programming problem:

Enter the function to be optimized:

Enter the constraints:

3.0*x +1.0*y +2.0*z <= 9

2. Graph the feasible region.

for problems with two or three variables. This step is optional.

3. Pivot on the Simplex Tableau:

Start by building the initial

3. View the current vertex: For 2 and 3 variable problems, you can see the vertex on the feasible region above with the button.

To take the graded quiz on the simplex method, click here.