CONICOPF: A tight-and-cheap conic relaxation with accuracy metrics for single-period and multi-period ACOPF problems
Bingane, Christian ; Anjos, Miguel F. ; Digabel, Sébastien Le
arXiv, Tome 2019 (2019) no. 0, / Harvested from
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.
Publié le : 2019-03-22
Classification:  Mathematics - Optimization and Control 
@article{1903.09678,
     author = {Bingane, Christian and Anjos, Miguel F. and Digabel, S\'ebastien Le},
     title = {CONICOPF: A tight-and-cheap conic relaxation with accuracy metrics for
  single-period and multi-period ACOPF problems},
     journal = {arXiv},
     volume = {2019},
     number = {0},
     year = {2019},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1903.09678}
}

Bingane, Christian; Anjos, Miguel F.; Digabel, Sébastien Le. CONICOPF: A tight-and-cheap conic relaxation with accuracy metrics for
  single-period and multi-period ACOPF problems. arXiv, Tome 2019 (2019) no. 0, . http://gdmltest.u-ga.fr/item/1903.09678/