A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming

Simple item page
dc.contributor.authorAudet, Charlesen_US
dc.contributor.authorHansen, Pierreen_US
dc.contributor.authorJaumard, Brigitteen_US
dc.contributor.authorSavard, Gillesen_US
dc.date.accessioned2018-06-18T17:47:32Zen_US
dc.date.available2018-06-18T17:47:32Zen_US
dc.date.issued1999-01en_US
dc.date.noteJanuary 1999en_US
dc.description.abstractWe present a branch and cut algorithm that yields in finite time, a globally epsilon-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a branching tree using Reformulation-Linearization Techniques (RLT). To do so, four classes of linearizations (cuts), depending on one to three parameters, are detailed. For each class, we show how to select the best member with respect to a precise criterion. The cuts introduced at any node of the tree are valid in the whole tree, and not only within the subtree rooted at that node. In order to enhance the computational speed, the structure created at any node of the tree is flexible enough to be used at other nodes. Computational results are reported. Some problems of the literature are solved, for the first time with a proof of global optimality.en_US
dc.format.extent30 ppen_US
dc.identifier.citationAudet, Charles, Hansen, Pierre, Jaumard, Brigitte, et al.. "A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming." (1999) <a href="https://hdl.handle.net/1911/101907">https://hdl.handle.net/1911/101907</a>.en_US
dc.identifier.digitalTR99-01en_US
dc.identifier.urihttps://hdl.handle.net/1911/101907en_US
dc.language.isoengen_US
dc.titleA Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programmingen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR99-01.pdf
Size:
981.97 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports