Extensions to Linear Programming
In many real situations the solutions to linear programming models make sense only if they have integer values. Rounding off the linear programming solution to the nearest integer sometimes does not produce a feasible solution. In this particular case, simplex method (or graphical method) can be a limitation. We use linear programming techniques to solve such problems.