Optimization Online


Characterizations of Mixed Binary Convex Quadratic Representable Sets

Alberto Del Pia (delpia***at***wisc.edu)
Jeffrey Poskin (poskin***at***wisc.edu)

Abstract: Representability results play a fundamental role in optimization since they provide geometric 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 number of characterizations of the sets that can be obtained as the projection of such feasible regions in a higher dimensional space. Most notably, we provide a complete characterization in the case that the feasible region is bounded.

Keywords: Mixed integer programming; Quadratic programming; Representability; Convex quadratic constraint

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 2: Global Optimization (Theory )

Citation: Submitted manuscript

Download: [PDF]

Entry Submitted: 11/21/2016
Entry Accepted: 11/21/2016
Entry Last Modified: 03/28/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society