Bound Tightening for the Alternating Current Optimal Power Flow Problem
Authors:
- 13 November 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 31 (5) , 3729-3736
Abstract
We consider the Alternating Current Optimal Power Flow (ACOPF) problem, formulated as a nonconvex Quadratically-Constrained Quadratic Program (QCQP) with complex variables. ACOPF may be solved to global optimality with a semidefinite programming (SDP) relaxation in cases where its QCQP formulation attains zero duality gap. However, when there is positive duality gap, no optimal solution to the SDP relaxation is feasible for ACOPF. One way to find a global optimum is to partition the problem using a spatial branch-and-bound method. Tightening upper and lower variable bounds can improve solution times in spatial branching by potentially reducing the number of partitions needed. We propose special-purpose closed-form bound tightening methods to tighten limits on nodal powers, line flows, phase angle differences, and voltage magnitudes. Computational experiments are conducted using a spatial branch-and-cut solver. We construct variants of IEEE test cases with high duality gaps to demonstrate the effectiveness of the bound tightening procedures.Keywords
This publication has 25 references indexed in Scilit:
- AC-Feasibility on Tree Networks is NP-HardIEEE Transactions on Power Systems, 2015
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power FlowIEEE Transactions on Control of Network Systems, 2015
- Application of the Moment-SOS Approach to Global Optimization of the OPF ProblemIEEE Transactions on Power Systems, 2014
- Local Solutions of the Optimal Power Flow ProblemIEEE Transactions on Power Systems, 2013
- Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power FlowOperations Research, 2012
- Geometry of feasible injection region of power networks2011
- Examining the limits of the application of semidefinite programming to power flow problems2011
- Semidefinite programming for optimal power flow problemsInternational Journal of Electrical Power & Energy Systems, 2008
- Optimal placement of capacitors in a radial network using conic and mixed integer linear programmingElectric Power Systems Research, 2008
- An Introduction to Chordal Graphs and Clique Trees1993