Preprint
Oct 2026
On solving integer bilevel optimization problems with a non-convex quadratic follower objective function using disjunctive cuts
In this work, we study bilevel optimization problems where all variables are integer, all constraints and the leader objective function are linear, and the follower objective function is non-convex quadratic. Relying on bilevel-free sets derived from improving directions, we develop a disjunctive cut approach to exclud...
Kübra Tanınmış, Elisabeth Gaar, Jon Lee et al.
· 0 citations