It is a technique for solving a linear programming model with an added constraint that the decision variables must only be non-negative integers.
In the case of linear programming there is no single, method that can be used for solving all types of integer linear programming problems.
Two widely used methods are:
• The method of integer forms• Branch and bound techniques
Simplex method (or graphical method) is still valid if the required answer gives integer values.