Programação Linear APP
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: mp9919146@gmail.com
For other Operational Research models see www.mpsantos.com.br