
Chapter 25
Integer Linear Optimization Models
25.1 Introduction
This chapter presents the general concepts and formulation of problems that can
be solved with modes of integer linear optimization. These are models with more
constraint than the standard linear optimization problems.
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 ...