integer programs
Concept
An integer program (IP) is an LP with integrality restrictions. It is pure if every variable is integral and mixed otherwise. Binary variables satisfy
Typical pure-IP models include integer knapsack,
and cyclic staff scheduling, where integer variables count workers beginning each shift pattern and coverage constraints meet each day’s demand.
Binary modelling
Binary variables encode choices and implications. If
For a discrete set
The bound
Application
Use integer variables only when divisibility matters. Logical conditions are handled by binary modeling; later, integer hulls and meyers theorem explains the relation to LP.