ABSTRACT
An integer linear optimization problem in which all variables are required to be integer is called a pure integer linear problem. If some variables are restricted to be integer and others are not, the problem is a mixed integer linear problem. The special case of integer variables that are restricted to be 0 or 1 is very useful and are known as pure (mixed) 0-1 linear problems or pure (mixed) binary integer linear problems.
