By Prof. Miguel F. Anjos, Chair of Operational Research at the University of Edinburgh, U.K.
Fecha seminario: 2026-05-12
We address unboundedness in bilevel and multilevel optimization by studying its computational complexity. Deciding whether an optimistic linear bilevel problem is unbounded is strongly NP-complete. We introduce two algorithmic approaches to determine whether a linear bilevel problem is unbounded and, if so, return a certificate of unboundedness.