Efficient Bound Tightening Techniques for Convex Relaxations of AC Optimal Power Flow
- 14 March 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 34 (5) , 3848-3857
Abstract
Convex relaxations of the ac optimal power flow problem in certain cases can recover a globally optimal point of the original problem. However, in general their solutions are not guaranteed to be physically meaningful. While the relaxation quality can be improved by enforcing tighter bounds on variables, existing bound tightening methods do not scale well with grid size. This paper presents three methods for tightening bounds on branch angle differences that complement each other and are highly parallelizable. The proposed methods are computationally efficient even for large-scale grids and thus can be used as a preprocessing step before solving the convex relaxation of the optimal power flow problem. Numerical experiments demonstrate that these methods can significantly tighten most of the bounds in a fraction of the time required to solve the convex relaxation. In addition, the experimental results show that tighter bounds improve the relaxation quality and reduce the optimality gap for large-scale instances.Keywords
Funding Information
- Swiss Innovation Agency
This publication has 21 references indexed in Scilit:
- Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization2015
- Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power FlowIEEE Transactions on Power Systems, 2015
- Convex Relaxation for Optimal Power Flow Problem: Mesh NetworksIEEE Transactions on Power Systems, 2014
- Experiments with the interior-point method for solving large scale Optimal Power Flow problemsElectric Power Systems Research, 2013
- State-of-the-art, challenges, and future trends in security constrained optimal power flowElectric Power Systems Research, 2011
- Algorithm 907ACM Transactions on Mathematical Software, 2010
- Usefulness of DC power flow for active power flow analysis2005
- Network-constrained multiperiod auction for a pool-based electricity marketIEEE Transactions on Power Systems, 2002
- Improved interior point method for OPF problemsIEEE Transactions on Power Systems, 1999
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976