CONICOPF: A tight-and-cheap conic relaxation with accuracy metrics for single-period and multi-period ACOPF problems
Christian Bingane (christian.binganepolymtl.ca)
Abstract: Computational speed and global optimality are a key need for pratical algorithms of the OPF problem. Recently, we proposed a tight-and-cheap conic relaxation for the ACOPF problem that offers a favourable trade-off between the standard second-order cone and the standard semidefinite relaxations for large-scale meshed networks in terms of optimality gap and computation time. In this paper, we show theoretically and numerically that this relaxation can be exact and can provide a global optimal solution for the ACOPF problem. Thereafter, we propose a multi-period tight-and-cheap relaxation for the multi-period ACOPF problem. Computational experiments using MATPOWER test cases with up to 500 buses show that this new relaxation is promising for real-life applications.
Keywords: Global optimization, multi-period optimal power flow , power systems, semidefinite programming
Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )
Citation: Christian Bingane, Miguel F. Anjos, and Sébastien Le Digabel. CONICOPF: A tight-and-cheap conic relaxation with accuracy metrics for single-period and multi-period ACOPF problems. Technical Report G-2019-19, Les cahiers du GERAD, 2019.
Entry Submitted: 03/22/2019
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|