Egwald Operations Research - Linear Programming

Egwald Web Services
Domain Names
Web Site Design

Operations Research - Linear Programming - Dual Simplex Tableaux Generator

by

Elmer G. Wiens

Egwald's popular web pages are provided without cost to users.
Follow Elmer Wiens on Twitter:

If you correctly specified the parameters of your linear programming problem on the previous web page, you can enter the data of your problem in the table below.

Otherwise, you can initiate another problem by changing the form below, and clicking submit parameters, generating a new table below where you can enter the data of your problem.

Your Linear Programming Problem's Parameters
L.P. Problem Name:
Number of variables: n =	Number of constraints: m =
Number of <= constraints: m1 =	Number of >= constraints: m2 =	Number of = constraints: m3 =

Certain restrictions apply to the parameters:
m = m1 + m2 + m3; n <= 6; m <= 10; n > 0;
m > 0; m1 >= 0; m2 >= 0; m3 >= 0.

After you fill in your data and click Submit L.P., the program will automatically calculate a sequence of tableaux that solves the primal and dual l.p. problems. You can specify which algorithm the program will use: dual or primal algorithm.

After you set up your problem, run the dual simplex algorithm. Next, compare these results with those of the primal simplex algorithm.

End of the Linear Programming Dual Simplex Method