In 2013, Buchheim and Wiegele introduced a quadratic optimisation problem, in which the domain of each variable is a closed subset of the reals. This problem includes several other important problems as special cases. We study some convex sets and polyhedra associated with the problem, and derive several families of strong valid inequalities. We also present some encouraging computational results, obtained by applying our inequalities to (a) integer quadratic programs with box constraints and (b) portfolio optimisation problems with semi-continuous variables.
Citation
Eventually published as: L. Galli & A.N. Letchford (2021) Valid inequalities for quadratic optimisation with domain constraints. Discrete Optimization, volume 41, article 100661.