This program will apply the Simplex procedure from Linear Programming to a matrix. The tableau to apply the Simplex technique to must be in ANS.

The program automatically selects the pivot element based upon the rules of the Simplex technique. The resulting tableau is displayed in fractional form and the program sits waiting for the user to press the ENTER key. The program then proceeds with the next tableau until done.

The program only does standard maximization problems. Standard minimization problems must be converted to the Dual problem, and then the program ran. Non-standard maximization or minimization problems are not supported directly by the program, although it is possible to fudge and use the PIVOT program.