This repository is dedicated to implementing the main solution methods for Linear Programming (LP) and Integer Linear Programming (ILP). Using Python and/or Matlab. The goal is to provide efficient and well-documented implementations of the most well-known algorithms, along with practical examples for each method.
- Primal Simplex -> Two Phase [ ]
- Dual Simplex
- Interior Points Method
- Lagrange Multipliers Method?
- Branch and Bound -> Pruning [ ]
- Cutting Planes Method -> Gomory Cuts [ ] -> Mixed Integer Rounding Cuts [ ]
- Branch and Cut
- Subgradient Method?
- Lagrangian Relaxation?