linear bilevel optimization

Unboundedness and Infeasibility in Linear Bilevel Optimization: How to Overcome Unbounded Relaxations

  • Bárbara Rodrigues
  • Miguel F. Anjos
    • Categories Constrained Nonlinear Optimization, Nonlinear Optimization Tags , ,

    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 aim to develop a better understanding of the feasible set of linear bilevel problems. Specifically, we develop means by which to … Read more

    Presolving Linear Bilevel Optimization Problems

  • Thomas Kleinert
  • Martin Schmidt
  • Dieter Weninger
  • Julian Manns
    • Categories (Mixed) Integer Linear Programming, Linear Programming Tags , ,

    Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization. Thus, during the last years and decades many branch-and-bound methods, cutting planes, or heuristics have been proposed. On the other hand, there is almost no literature on presolving … Read more