On Unboundedness and Infeasibility in Linear Bilevel Optimization
Bilevel optimization problems are known to be challenging to solve in practice. In particular, the feasible set of a bilevel problem is in general non-convex, even for linear bilevel problems. In this work, we are concerned with better understanding the feasible set of linear bilevel programs. Specifically we seek to develop means to identify when … Read more