This section we will develop models for problems requiring a mix of continuous and integral variables, as well as a variety of constraints. Traditionally these models have been called mixed integer programs (MIP).1
I will cover a few of the classical problems that require a combination of continuous and discrete variables. The prototypical and simplest situation, exhibited by facility location, is when we have continuous objects floating around a network, but where the existence of the network nodes is subject to an optimizing decision. At ...
