A simple linear solver for the simplex method in tableau form and gomory's cut.

This project has been developed for academic purpose. Basically, it consists in a Python algorithm able to solve a multidimensional Knapsack problem using only Gomory cuts. Every new cut shows its utility in terms of how much it reduces the gap between the relaxed PL solution and the optimal PLI one.

Дискретная оптимизация

some LP algorithms that can solve some problems