Benders Subproblem Decomposition for Bilevel Problems with Convex Follower

Abstract

Bilevel optimization formulates hierarchical decision-making processes that arise in many real-world applications, such as pricing, network design, and infrastructure defense planning. In this paper, we consider a class of bilevel optimization problems in which the upper level problem features some integer variables and the lower level problem enjoys strong duality. We propose a dedicated Benders decomposition method for solving this class of bilevel problems, which decomposes the Benders subproblem into two more tractable, sequentially solvable problems that can be interpreted as the upper and lower level problems. We show that the Benders subproblem decomposition carries over to an interesting extension of bilevel problems, which connects the upper level solution with the lower level dual solution, and discuss some special cases of bilevel problems that allow sequence-independent subproblem decomposition. Several novel schemes for generating numerically stable cuts, finding a good incumbent solution, and accelerating the search tree are discussed. A computational study demonstrates the computational benefits of the proposed method over a state-of-the-art, bilevel-tailored, branch-and-cut method; a commercial solver; and the standard Benders method on standard test cases and the motivating applications in sequential energy markets.

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs

“…The method is based on outer approximation after the problem is reformulated into a singlelevel one using strong duality and convexification. In [11], Byeon and Van Hentenryck develop a solution algorithm for BPs, where the leader problem can be modeled as a mixed-integer SOCP and the follower problem can be modeled as a SOCP. The algorithm is based on a dedicated Benders decomposition method.…”