Bilevel mixed-integer linear programs and the zero forcing set ?

Abstract

We study a class of bilevel binary linear programs with lowerlevel variables in the upper-level constraints. Under certain assumptions, we prove that the problem can be reformulated as a single-level binary linear program, and propose a finitely terminating cut generation algorithm to solve it. We then relax the assumptions by means of a general row-and… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics