13 citations · 33 across the 10 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CC2026
On the Tightness of Standard Relaxations for Mixed-Integer Bilevel Linear Programs
Sergey S. Ketkov, Oleg A. Prokopyev
Exact algorithms for solving mixed-integer bilevel linear programs (MIBLPs) typically rely on sequences of lower and upper bounds that converge to the optimal value. These procedur…
math.OC2026
On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
Sergey S. Ketkov, Oleg A. Prokopyev
A standard approach to solving optimistic bilevel linear programs (BLPs) is to replace the lower-level problem with its Karush-Kuhn-Tucker (KKT) optimality conditions and reformula…