extended-MIQCP
| swMATH ID: | 31776 |
| Software Authors: | Vielma, Juan Pablo; Dunning, Iain; Huchette, Joey; Lubin, Miles |
| Description: | Extended formulations in mixed integer conic quadratic programming. In this paper we consider the use of extended formulations in LP-based algorithms for mixed integer conic quadratic programming (MICQP). Extended formulations have been used by Vielma et al. (INFORMS J Comput 20: 438–450, 2008) and Hijazi et al. (Comput Optim Appl 52: 537–558, 2012) to construct algorithms for MICQP that can provide a significant computational advantage. The first approach is based on an extended or lifted polyhedral relaxation of the Lorentz cone by Ben-Tal and Nemirovski (Math Oper Res 26(2): 193–205 2001) that is extremely economical, but whose approximation quality cannot be iteratively improved. The second is based on a lifted polyhedral relaxation of the euclidean ball that can be constructed using techniques introduced by Tawarmalani and Sahinidis (Math Programm 103(2): 225–249, 2005). This relaxation is less economical, but its approximation quality can be iteratively improved. Unfortunately, while the approach of Vielma, Ahmed and Nemhauser is applicable for general MICQP problems, the approach of Hijazi, Bonami and Ouorou can only be used for MICQP problems with convex quadratic constraints. In this paper we show how a homogenization procedure can be combined with the technique by Tawarmalani and Sahinidis to adapt the extended formulation used by Hijazi, Bonami and Ouorou to a class of conic mixed integer programming problems that include general MICQP problems. We then compare the effectiveness of this new extended formulation against traditional and extended formulation-based algorithms forMICQP.We find that this new formulation can be used to improve various LP-based algorithms. In particular, the formulation provides an easy-to-implement procedure that, in our benchmarks, significantly improved the performance of commercial MICQP solvers. |
| Homepage: | http://mpc.zib.de/archive/2017/3/Vielma2017_Article_ExtendedFormulationsInMixedInt.pdf |
| Source Code: |
 https://github.com/juan-pablo-vielma/extended-MIQCP
|
| Keywords: | homogenization procedure; LP-based algorithms |
| Related Software: | CPLEX; Gurobi; Bonmin; FilMINT; Julia; JuMP; MINLPLib; CVXPY; Convex.jl; CVX; SCIP; L0Learn; sparsenet; L0BnB; Pyomo; OR-Library; CasADi; MINOTAUR; SCS; GitHub |
| Cited in: | 17 Documents |
Standard Articles
| 1 Publication describing the Software, including 1 Publication in zbMATH | Year |
|---|---|
|
Extended formulations in mixed integer conic quadratic programming. Zbl 1387.90165 Vielma, Juan Pablo; Dunning, Iain; Huchette, Joey; Lubin, Miles |
2017
|
all
top 5
Cited by 36 Authors
all
top 5
