DeepAI AI Chat
Log In Sign Up

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs

by   Elisabeth Gaar, et al.
University of Michigan
Johannes Kepler University Linz

We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary variables. We present an extensive computational study on a diverse set of instances, including instances with binary and with integer variables, and instances with a single and with multiple linking constraints. Our computational study demonstrates that the proposed enhancements of our solution approaches are effective for improving the performance. Moreover, both of our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our binary instances.


page 1

page 2

page 3

page 4


SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

We study a class of bilevel integer programs with second-order cone cons...

Consistent Second-Order Conic Integer Programming for Learning Bayesian Networks

Bayesian Networks (BNs) represent conditional probability relations amon...

A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program

In this paper, we propose a cutting plane algorithm based on DC (Differe...

GAMA: A Novel Algorithm for Non-Convex Integer Programs

Inspired by the decomposition in the hybrid quantum-classical optimizati...

An Exact Method for Fortification Games

A fortification game (FG) is a three-level, two-player Stackelberg game,...

When Lift-and-Project Cuts are Different

In this paper, we present a method to determine if a lift-and-project cu...

Learning to Select Cuts for Efficient Mixed-Integer Programming

Cutting plane methods play a significant role in modern solvers for tack...