Linear Programming

MPSantos

O aplikaciji

The application allows to solve problems of Linear Programming with up to 10 decision variables and 10 constraints. After data entry, the application shows each step of the Simplex showing, in each iteration, the basic solution with all the coefficients of the variables as well as the variable that enters the base (entering) and the one that leaves the base (leaving).
In the case of Transport Model is used the algorithm "stepping stone" and after the entry of the model data, are shown all the basic solutions until obtaining the optimum solution. Models with a maximum of 8 sources and 8 destinations are allowed.
For Assignment Models, the hungarian algorithm is used and all intermediary solutions are also shown to the optimum solution. A maximum of 8-by-8 models are allowed.
DEVELOPER:
Mauricio Pereira dos Santos
Former professor (retired) in Rio de Janeiro State University - UERJ (Brazil)
email: [e-mail]

Što je novo

Google safety standards included.