Mathematical Programming formulations for the Alternating Current Optimal Power Flow problem
arXiv:2007.05334 · doi:10.1007/s10288-020-00455-w
Abstract
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.
References in corpus (7)
- Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow, Part II: Exactness
- Strong SOCP Relaxations for the Optimal Power Flow Problem
- New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem
- Optimal Power Flow as a Polynomial Optimization Problem
- Matrix Minor Reformulation and SOCP-based Spatial Branch-and-Cut Method for the AC Optimal Power Flow Problem
- Stochastic defense against complex grid attacks