Lecture 18
November 4, 2024
Text: VSRIKRISH to 22333
LPs are powerful but have some (strong) assumptions.
What do we do when they don’t hold or a linear relaxation would be inappropriate?
Economic dispatch: Assumed we had a fleet of online generators, all of which generated.
What if we had to also make decisions about which generators to operate?
A key consideration when deciding whether to operate something are fixed costs.
The potential decision to not operate means that we need to introduce new indicator variables, which flag on/off status:
\[ \mathbb{I}_g = \begin{cases} 0 & \text{off} \\ 1 & \text{on} \end{cases} \]
These indicator variables are binary variables: 0 or 1.
More generally, we can consider optimization problems with integer variables \(x \in \mathbb{Z}\).
Recall that for LPs, solutions must occur at corners of the feasible polyhedra.
Mixed-integer LPs: corners may not exist at integer points.
\[ \begin{align} \max \quad & 3x_1 + 4x_2 \\[0.5em] \text{subject to:} \quad & 2x_1 + 6x_2 \leq 27 \\[0.5em] & x_2 \geq 2 \\[0.5em] & 3x_1 + x_2 \leq 19 \\[0.5em] & x_1, x_2 \geq 0 \\[0.5em] & x_1, x_2 \quad \text{integers} \end{align} \]
Solution to linear relaxation (relax integer constraint to turn into an LP) is an upper bound on the mixed-integer solution (why?).
Starting from this, test new problems “bounding” LP solution with integer constraints.
Continue until integer solution found.
This is the branch and bound algorithm.
\[ \begin{align} \max \quad & 3x_1 + 4x_2 \\[0.5em] \text{subject to:} \quad & 2x_1 + 6x_2 \leq 27 \\ & x_2 \geq 2 \\ & 3x_1 + x_2 \leq 19 \\ & x_1, x_2 \geq 0 \\ & {\color{red}x_2 \leq 2} \qquad (\text{node}\, 2) \\ & {\color{blue}x_2 \geq 3} \qquad (\text{node}\, 3) \\ \end{align} \]
Wednesday/Monday: Applications of MILP to solid waste management and power systems.
Prelim 2: Next Wednesday (11/13), on material through LP.