On the Convexification of a Class of Mixed-Integer Conic Sets

We investigate mixed-integer second-order conic (SOC) sets with a nonlinear right-hand side in the SOC constraint, a structure frequently arising in mixed-integer quadratically constrained programming (MIQCP). Under mild assumptions, we show that the convex hull can be exactly described by replacing the right-hand side with its concave envelope. This characterization enables strong relaxations for MIQCPs via reformulations and cutting planes. Computational experiments on distributionally robust chance-constrained knapsack variants demonstrate the efficacy of our reformulation techniques.