Abstract
The optimal power flow (OPF) problem determines power generations/demands that minimize a certain objective such as generation cost or power loss. It is non-convex and NP-hard in general. In this paper, we study the OPF problem in direct current (DC) networks. A second-order cone programming (SOCP) relaxation is considered for solving the OPF problem. We prove that the SOCP relaxation is exact if either 1) voltage upper bounds do not bind; or 2) voltage upper bounds are uniform and power injection lower bounds are negative. Based on 1), a modified OPF problem is proposed, whose corresponding SOCP is guaranteed to be exact. We also prove that SOCP has at most one optimal solution if it is exact. Finally, we discuss how to improve numerical stability and how to include line constraints.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
