Simplex Solver 1.0

The simplex method optimizes (maximizes or minimizes) a linear objective function Z subject to a number of linear restrictions (first degree equalities and inequalities). After entering the input data press Solve button and move your mouse over tables cells. You will find a visual description of how the numerical values were obtained.
Follow me on Twitter

Price: Just $19.95

Choose type of linear programming model :                    

Number of restrictions: Trial: 1 or 2 restrictions. Full version: [1 - 9] restrictions.
Number of variables:    Trial: 1 or 2 variables. Full version: [1 - 9] variables.