Abstract
We consider quadratic optimization in variables (x, y) where \(0\le x\le y\), and \(y\in \{ 0,1 \}^n\). Such binary variables are commonly referred to as indicator or switching variables and occur commonly in applications. One approach to such problems is based on representing or approximating the convex hull of the set \(\{ (x,xx^T, yy^T)\,:\,0\le x\le y\in \{ 0,1 \}^n \}\). A representation for the case \(n=1\) is known and has been widely used. We give an exact representation for the case \(n=2\) by starting with a disjunctive representation for the convex hull and then eliminating auxiliary variables and constraints that do not change the projection onto the original variables. An alternative derivation for this representation leads to an appealing conjecture for a simplified representation of the convex hull for \(n=2\) when the product term \(y_1y_2\) is ignored.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aktürk, M.S., Atamtürk, A., Gürel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37, 187–191 (2009)
Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. B 124, 33–43 (2010)
Atamtürk, A., Gómez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. B 170, 141–176 (2018). https://doi.org/10.1007/s10107-018-1301-5
Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479–495 (2009). https://doi.org/10.1007/s10107-008-0223-z
Burer, S., Letchford, A.N.: On non-convex quadratic programming with box constraints. SIAM J. Optim. 20, 1073–1089 (2009)
Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595–614 (1999). https://doi.org/10.1007/s101070050106
D’Ambrosio, C., Linderoth, J., Luedtke, J.: Valid inequalities for the pooling problem with binary variables. In: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 6655, pp. 117–129. Springer, Heidelberg (2011)
Dong, H., Linderoth, J.: On valid inequalities for quadratic programming with continuous variables and binary indicators. In: Goemans, M., Correa, J. (eds.) IPCO: International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 7801, pp. 169–180. Springer Verlag, Berlin (2013)
Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0–1 mixed integer programs. Math. Program. 106, 225–236 (2006)
Günlük, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programming with indicator variables. Math. Program. B 124, 183–205 (2010)
Hijazi, H., Coffrin, C., Van Hentenryck, P.: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems. Math. Program. Comput. 9, 321–367 (2017)
Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press (1985)
Jabr, R.: Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations. IET Gener. Transm. Distrib. 6(7), 1104–1111 (2012)
Jach, M., Michaels, D., Weismantel, R.: The convex envelope of \((n-1)\)-convex functions. SIAM. J. Optim. 19, 1451–1466 (2008)
Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103, 251–282 (2005)
Maxfield, J.E., Minc, H.: On the matrix equation \(X^{\prime } X=A\). Proc. Edinburgh Math. Soc. (2) 13, 125–129 (1962/1963)
Parrilo, P.A.: Polynomial optimization, sums of squares, and applications. In: Blekherman, G., Parrilo, P.A., Thomas, R.R. (eds.) Semidefinite Optimization and Convex Algebraic Geometry. MOS-SIAM Series on Optimization, vol. 13, pp. 47–158 (2012)
Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer (1997)
Zheng, X., Sun, X., Li, D.: Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach. INFORMS J. Comput. 26, 690–703 (2014)
Acknowledgements
We are grateful to two anonymous referees for their very careful readings of the paper and numerous insightful comments. We also thank Rekha Thomas and Pablo Parrilo for pointing out the applicability of [17, Lemma 3.14]
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Anstreicher, K.M., Burer, S. Quadratic optimization with switching variables: the convex hull for \(n=2\). Math. Program. 188, 421–441 (2021). https://doi.org/10.1007/s10107-021-01671-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-021-01671-w