A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

Alain Billionnet (), Sourour Elloumi () and Amélie Lambert ()
Additional contact information
Alain Billionnet: CEDRIC-ENSIIE
Sourour Elloumi: CEDRIC-ENSIIE
Amélie Lambert: CEDRIC-CNAM

Journal of Combinatorial Optimization, 2014, vol. 28, issue 2, No 5, 376-399

Abstract: Abstract Let $$(MQP)$$ be a general mixed-integer quadratic program that consists of minimizing a quadratic function $$f(x) = x^TQx +c^Tx$$ subject to linear constraints. Our approach to solve $$(MQP)$$ is first to consider an equivalent general mixed-integer quadratic problem. This equivalent problem has additional variables $$y_{ij}$$ , additional quadratic constraints $$y_{ij}=x_ix_j$$ , a convex objective function, and a set of valid inequalities. Contrarily to the reformulation proposed in Billionnet et al. (Math Program 131(1):381–401, 2012), the equivalent problem cannot be directly solved by a standard solver. Here, we propose a new Branch and Bound process based on the relaxation of the non-convex constraints $$y_{ij}=x_ix_j$$ to solve $$(MQP)$$ . Computational experiences are carried out on pure- and mixed-integer quadratic instances. The results show that the solution time of most of the considered instances with up to 60 variables is improved by our Branch and Bound algorithm in comparison with the approach of Billionnet et al. (2012) and with the general mixed-integer nonlinear solver BARON (Sahinidis and Tawarmalani, Global optimization of mixed-integer nonlinear programs, user’s manual, 2010).

Keywords: General mixed-integer quadratic programming; Branch and Bound; Quadratic convex relaxation; Experiments (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9560-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:2:d:10.1007_s10878-012-9560-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9560-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().