Linear programming is a method to find the best solution for a problem with linear rules. Mixed integer linear programming is a type of problem where some or all of the variables must be whole numbers. A new software has been created to solve these mixed integer linear problems using different methods like the revised simplex method, revised dual simplex method, and branch and bound algorithm.