Mathematical programming formulations for the alternating current optimal power flow problem

被引：21

作者：

Bienstock, Dan ^{[1
]}

Escobar, Mauro ^{[2
]}

Gentile, Claudio ^{[3
]}

Liberti, Leo ^{[2
]}

机构：

[1] Columbia Univ, IEOR, New York, NY USA

[2] Ecole Polytech, Inst Polytech Paris, CNRS, LIX, Palaiseau, France

[3] CNR, IASI, Rome, Italy

来源：

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2020年 / 18卷 / 03期

关键词：

ACOPF; Smart grid; Complex numbers; INTERIOR-POINT METHOD; POLYNOMIAL OPTIMIZATION; RELAXATIONS; NETWORKS; ALGORITHM; REFORMULATION; SECURITY; SPARSITY; SQUARES; BRANCH;

D O I：

10.1007/s10288-020-00455-w

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Power flow refers to the injection of power on the lines of an electrical grid, so that all the injections at the nodes form a consistent flow within the network. Optimality, in this setting, is usually intended as the minimization of the cost of generating power. Current can either be direct or alternating: while the former yields approximate linear programming formulations, the latter yields formulations of a much more interesting sort: namely, nonconvex nonlinear programs in complex numbers. In this technical survey, we derive formulation variants and relaxations of the alternating current optimal power flow problem.

引用

页码：249 / 292

页数：44

共 104 条

[1]

Ahmadi A., 2014, IEEE International Test Conference, P1

[2] DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization [J].