Skip navigation
Skip navigation

Strengthening convex relaxations with bound tightening for power network optimization

Coffrin, Carleton; Hijazi, Hassan; Van Hentenryck, Pascal


Convexification is a fundamental technique in (mixedinteger) nonlinear optimization and many convex relaxations are parametrized by variable bounds, i.e., the tighter the bounds, the stronger the relaxations. This paper studies how bound tightening can improve convex relaxations for power network optimization. It adapts traditional constraint-programming concepts (e.g., minimal network and bound consistency) to a relaxation framework and shows how bound tightening can dramatically improve power...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-319-23219-5_4


File Description SizeFormat Image
01_Coffrin_Strengthening_convex_2015.pdf753.54 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator