Solving Linear Bilevel Problems Using Big-Ms: Not All That Glitters Is Gold

The most common procedure to solve a linear bilevel problem in the PES community is, by far, to transform it into an equivalent single-level problem by replacing the lower level with its KKT optimality conditions. Then, the complementarity conditions are reformulated using binary variables and large enough constants (big-Ms) to cast the single-level problem as a mixed-integer linear program that can be solved using optimization software. In most cases, such large constants are tuned by trial and error. We show, through a counterexample, that this widely used trial- and-error approachmay lead to highly suboptimal solutions. Then, further research is required to properly select big-M values to solve linear bilevel problems.