Preprint
Sep 2026
On the Tightness of Standard Relaxations for Mixed-Integer Bilevel Linear Programs
It is proved that neither the SLR itself nor its associated upper bound admits a uniform improvement by a polynomial-time algorithm with access to a mixed-integer linear programming (MILP) oracle, which rules out uniform improvements by iterative MILP-based approaches, including cutting-plane-based and decomposition al...
Sergey S. Ketkov, O. Prokopyev
· 0 citations