A Branch-and-cut Algorithm for Integer Bilevel Linear Programs

We describe a rudimentary branch-and-cut algorithm for solving integer bilevel linear programs that extends existing techniques for standard integer linear programs to this very challenging computational setting. The algorithm improves on the branch-and-bound algorithm of Moore and Bard in that it uses cutting plane techniques to produce improved bounds, does not require specialized branching strategies, and can be implemented in a straightforward way using only linear solvers. An implementation built using software components available in the COIN-OR software repository is described and preliminary computational results presented.

Citation

Technical Report, COR@L Laboratory, Lehigh University (2008)

Article

Download

View A Branch-and-cut Algorithm for Integer Bilevel Linear Programs