- Can solve both minimization and maximization problems. - Can solve for greater than, less than and equality constraints - New you click on each step to see the corresponding simplex tablue
Simple MIP Simplex Solver Details
Simple solver that uses the Gomory mixed integer cut algorithm to solve and give a step by step description on how to solve smaller LP, IP, MIP problems.
The Solver is web based with a python backend that solves simple LP, IP and MIP problems using the Gomory mixed integer cut algorithm.
My hopes is that you can use this solver for educational purposes, in order to learn how the algoritm works or to check if your own calculations is correct when solving easy LP, IP or MIP problems.
