TY - JOUR
T1 - Strengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Valid Inequalities
AU - Coffrin, Carleton
AU - Hijazi, Hassan L.
AU - Van Hentenryck, Pascal
N1 - Publisher Copyright:
© 1969-2012 IEEE.
PY - 2017/9
Y1 - 2017/9
N2 - This work revisits the semidefine programming (SDP) relaxation of the ac power flow equations in light of recent results illustrating the benefits of bounds propagation, valid inequalities, and the convex quadratic relaxation. By integrating all of these results into the SDP model a new hybrid relaxation is proposed, which combines the benefits from all of these recent works. This strengthened SDP formulation is evaluated on 71 AC Optimal Power Flow test cases from the NESTA archive and is shown to have an optimality gap of less than 1% on 63 cases. This new hybrid relaxation closes 50% of the open cases considered, leaving only eight for future investigation.
AB - This work revisits the semidefine programming (SDP) relaxation of the ac power flow equations in light of recent results illustrating the benefits of bounds propagation, valid inequalities, and the convex quadratic relaxation. By integrating all of these results into the SDP model a new hybrid relaxation is proposed, which combines the benefits from all of these recent works. This strengthened SDP formulation is evaluated on 71 AC Optimal Power Flow test cases from the NESTA archive and is shown to have an optimality gap of less than 1% on 63 cases. This new hybrid relaxation closes 50% of the open cases considered, leaving only eight for future investigation.
KW - Convex quadratic optimization
KW - optimal power flow
KW - optimization methods
KW - semidefine programming
UR - http://www.scopus.com/inward/record.url?scp=85028892152&partnerID=8YFLogxK
U2 - 10.1109/TPWRS.2016.2634586
DO - 10.1109/TPWRS.2016.2634586
M3 - Article
SN - 0885-8950
VL - 32
SP - 3549
EP - 3558
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 5
M1 - 7763860
ER -