On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Elisabeth GaarJon LeeIvana LjubicMarkus SinnlKübra TaninmisPublished in: CoRR (2022)
Keyphrases
- linear programming
- quadratic program
- convex optimization
- answer sets
- bilevel programming
- convex programming
- convex optimization problems
- globally optimal
- quadratic programming
- nonlinear programming
- linear complementarity problem
- nonlinear equations
- implicit enumeration
- second order cone program
- logic programs
- optimal solution
- integer variables