Characterizations of mixed binary convex quadratic representable sets

Abstract

Representability results play a fundamental role in optimization since they provide characterizations of the feasible sets that arise from optimization problems. In this paper we study the sets that appear in the feasibility version of mixed binary convex quadratic optimization problems. We provide a complete characterization of the sets that can be obtained as the projection of such feasible regions. In order to obtain this result, we first provide a complete characterization of these sets in the special cases where (1) the feasible region is bounded, (2) only binary extended variables are present, and (3) only continuous variables are present.