The application allows solving "classical" Linear Programming problems with up to 10 decision variables and 10 constraints. After the data entry, the application shows each step of Simplex showing, in each iteration, the basic solution with all the coefficients of the variables as well as the variable that enters the base (incoming) and the one that leaves the base (outgoing).
In the case of Transport Model, the stepping stone algorithm is used and after entering the model data all the basic solutions are shown until the optimum solution is obtained. Models with a maximum of 8 sources and 8 destinations are allowed.
For Assignment models, the Hungarian algorithm is used and all intermediate solutions are also shown until the optimum solution. Models are allowed at most 8 by 8.

DEVELOPED BY:
Maurício Pereira dos Santos
Former Professor (retired) at the State University of Rio de Janeiro - UERJ (Brazil)
email: [email protected]

For other Operational Research models see www.mpsantos.com.br