Kleinert, Thomas; Labbé, Martine; Plein, Fränk; … - In: Optimization Letters 15 (2020) 4, pp. 1027-1040
Linear bilevel optimization problems are often tackled by replacing the linear lower-level problem with its Karush–Kuhn–Tucker conditions. The resulting single-level problem can be solved in a branch-and-bound fashion by branching on the complementarity constraints of the lower-level...