Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
arXiv:1410.1004 · doi:10.1109/TPWRS.2015.2402640
Abstract
It has been recently proven that the semidefinite programming (SDP) relaxation of the optimal power flow problem over radial networks is exact under technical conditions such as not including generation lower bounds or allowing load over-satisfaction. In this paper, we investigate the situation where generation lower bounds are present. We show that even for a two-bus one-generator system, the SDP relaxation can have all possible approximation outcomes, that is (1) SDP relaxation may be exact or (2) SDP relaxation may be inexact or (3) SDP relaxation may be feasible while the OPF instance may be infeasible. We provide a complete characterization of when these three approximation outcomes occur and an analytical expression of the resulting optimality gap for this two-bus system. In order to facilitate further research, we design a library of instances over radial networks in which the SDP relaxation has positive optimality gap. Finally, we propose valid inequalities and variable bound tightening techniques that significantly improve the computational performance of a global optimization solver. Our work demonstrates the need of developing efficient global optimization methods for the solution of OPF even in the simple but fundamental case of radial networks.
References in corpus (3)
Cited by in corpus (22)
- New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem
- Convex Relaxations of Optimal Power Flow Problems: An Illustrative Example
- Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem
- Benders' decomposition of the unit commitment problem with semidefinite relaxation of AC power flow constraints
- An MISOCP-Based Decomposition Approach for the Unit Commitment Problem with AC Power Flows
- A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow
- Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
- Spectral Algorithms for Computing Fair Support Vector Machines
- A Component-Based Dual Decomposition Method for the OPF Problem
- Strengthening the SDP Relaxation of AC Power Flows with Convex Envelopes, Bound Tightening, and Lifted Nonlinear Cuts
- A Scalable Semidefinite Relaxation Approach to Grid Scheduling
- Ensemble Learning Based Convex Approximation of Three-Phase Power Flow
- Demand Variation Impact on Tightness of Convex Relaxation Approaches for the ACOPF Problem
- Efficient Solution Strategy for Chance-Constrained Optimal Power Flow based on FAST and Data-driven Convexification
- Optimal Operation of Power Systems with Energy Storage under Uncertainty: A Scenario-based Method with Strategic Sampling
- A Multi-step Piecewise Linear Approximation Based Solution for Load Pick-up Problem in Electrical Distribution System
- A Laplacian-Based Approach for Finding Near Globally Optimal Solutions to OPF Problems
- A Globally Convergent Penalty-Based Gauss-Newton Algorithm with Applications
- A Spatial Branch-and-Cut Method for Nonconvex QCQP with Bounded Complex Variables
- Ensemble learning based linear power flow
- Verifying Global Optimality of Candidate Solutions to Polynomial Optimization Problems using a Determinant Relaxation Hierarchy
- Convex Hull of the Quadratic Branch AC Power Flow Equations and Its Application in Radial Distribution Networks