Abstract
We present a quadratic outer approximation scheme for solving general convex integer programs, where suitable quadratic approximations are used to underestimate the objective function instead of classical linear approximations. As a resulting surrogate problem we consider the problem of minimizing a function given as the maximum of finitely many convex quadratic functions having the same Hessian matrix. A fast algorithm for minimizing such functions over integer variables is presented. Our algorithm is based on a fast branch-and-bound approach for convex quadratic integer programming proposed by Buchheim, Caprara and Lodi [5]. The main feature of the latter approach consists in a fast incremental computation of continuous global minima, which are used as lower bounds. We generalize this idea to the case of k convex quadratic functions, implicitly reducing the problem to 2k − 1 convex quadratic integer programs. Each node of the branch-and-bound algorithm can be processed in O(2k n) time. Experimental results for a class of convex integer problems with exponential objective functions are presented. Compared with Bonmin’s outer approximation algorithm B-OA and branch-and-bound algorithm B-BB, running times for both ternary and unbounded instances turn out to be very competitive.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
IBM ILOG CPLEX Optimizer 12.4 (2013), www.ibm.com/software/integration/optimization/cplex-optimizer
Bonami, P., Biegler, L.T., Conn, A.R., Cornuéjols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., Wächter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization 5(2), 186–204 (2008)
Bonami, P., Kilinç, M., Linderoth, J.T.: Part I: Convex MINLP. In: Algorithms and Software for Solving Convex Mixed Integer Nonlinear Programs. IMA Volumes in Mathematics and its Applications: Mixed Integer Nonlinear Programming, vol. 154, pp. 1–39. Springer (2012)
Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Mathematical Programming (2012) (to appear)
Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming 135, 369–395 (2012)
Buchheim, C., De Santis, M., Palagi, L., Piacentini, M.: An exact algorithm for quadratic integer minimization using ellipsoidal relaxations. Technical report, Optimization Online (2012)
Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. The Computer Journal 8, 250–255 (1965)
Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming 36, 307–339 (1986)
Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming 66, 327–349 (1994)
Geoffrion, A.: Generalized Benders Decomposition. Journal of Optimization 10, 237–260 (1972)
Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming. Management Science 31(12), 1533–1546 (1985)
Quesada, I., Grossmann, I.E.: An LP/NLP based branch-and-bound algorithm for convex MINLP. Computers and Chemical Engineering 16, 937–947 (1992)
Bonmin 1.5.1: Basic Open source Nonlinear Mixed INteger programming (2013), www.coin-or.org/Bonmin
Van Emde Boas, P.: Another NP-complete problem and the complexity of computing short vectors in a lattice. Technical Report 81-04, University of Amsterdam, Department of Mathematics (1981)
Westerlund, T., Pettersson, F.: A cutting plane method for solving convex MINLP problems. Computers and Chemical Engineering 19, 131–136 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchheim, C., Trieu, L. (2013). Quadratic Outer Approximation for Convex Integer Programming with Box Constraints. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)