Outer Approximation With Conic Certificates For Mixed-Integer Convex Problems

Chris Coey, Miles Lubin, Juan Pablo Vielma

A mixed-integer convex (MI-convex) optimization problem is one that becomes convex when all integrality constraints are relaxed. We present a branch-and-bound LP outer approximatio…