- This code can Compute all types of LPP problems using Simplex method by Big-M Method
- It Can Also Show all the Iterations
- It includes the condition of Maximization and Minimization
- It also Includes the case of <=, >= , =
- The program can detect the unboundedness and infeasibility of the LPP
- Helpful for businesses to minimize operational cost
