Quadratic convex reformulation for quadratic programming with linear on–off constraints

Baiyi Wu, Duan Li and Rujun Jiang

European Journal of Operational Research, 2019, vol. 274, issue 3, 824-836

Abstract: In production planning and resource allocation problems, we often encounter a situation where a constraint can be relaxed or removed if new resources are added. Such constraints are termed on–off constraints. We study the quadratic programming problem with such on–off constraints, which is in general NP-hard. As the problem size grows, branch-and-bound algorithms for the standard formulation of this problem often require a lot of computing time because the lower bound from the continuous relaxation is in general quite loose. We generalize the quadratic convex reformulation (QCR) approach in the literature to derive a new reformulation that can be solved by standard mixed-integer quadratic programming (MIQP) solvers with less computing time when the problem size becomes large. While the conventional QCR approach utilizes a quadratic function that vanishes on the entire feasible region, the approach proposed in our paper utilizes a quadratic function that only vanishes on the set of optimal solutions. We prove that the continuous relaxation of our new reformulation is at least as tight as that of the best reformulation in the literature. Our computational tests verify the effectiveness of our new approach.

Keywords: Integer programming; Quadratic convex reformulation; On–off constraint; Mixed integer quadratic programming; Semidefinite program (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171830804X
Full text for ScienceDirect subscribers only

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:eee:ejores:v:274:y:2019:i:3:p:824-836

DOI: 10.1016/j.ejor.2018.09.028

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().