-

 

 

 




Optimization Online





 

Tight-and-cheap conic relaxation for the AC optimal power flow problem

Christian Bingane (christian.bingane***at***polymtl.ca)
Miguel Anjos (anjos***at***stanfordalumni.org)
Sébastien Le Digabel (sebastien.le-digabel***at***polymtl.ca)

Abstract: The classical alternating current optimal power flow problem is highly nonconvex and generally hard to solve. Convex relaxations, in particular semidefinite, second-order cone, convex quadratic, and linear relaxations, have recently attracted significant interest. The semidefinite relaxation is the strongest among them and is exact for many cases. However, the computational efficiency for solving large-scale semidefinite optimization is lower than for second-order cone optimization. We propose a conic relaxation obtained by combining semidefinite optimization with the reformulation-linearization technique, commonly known as RLT. The proposed relaxation is stronger than the second-order cone relaxation and nearly as tight as the standard semidefinite relaxation. Computational experiments using standard test cases with up to 6515 buses show that the time to solve the new conic relaxation is up to one order of magnitude lower than for the chordal relaxation, a semidefinite relaxation technique that exploits the sparsity of power networks.

Keywords: Conic optimization, optimal power flow, power systems, semidefinite programming.

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Category 2: Applications -- Science and Engineering (Other )

Category 3: Nonlinear Optimization (Other )

Citation: @techreport{BiAnLed2018, Author = {C. Bingane and M.F. Anjos and S. {Le~Digabel}}, Title = {{Tight-and-cheap conic relaxation for the AC optimal power flow problem}}, Institution = {Les cahiers du GERAD}, Number = {G-2018-02}, Url = {http://www.optimization-online.org/DB_HTML/2018/01/6418.html}, Year = {2018} }

Download: [PDF]

Entry Submitted: 01/16/2018
Entry Accepted: 01/16/2018
Entry Last Modified: 06/19/2018

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society