Mathematical programming formulations for the alternating current optimal power flow problem

DOI10.1007/s10479-021-04497-zzbMath1492.90201arXiv2007.05334OpenAlexW4226040244MaRDI QIDQ5918757

Mauro Escobar, Bienstock, Daniel, Leo Liberti, Claudio Gentile

Publication date: 1 August 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.05334

zbMATH Keywords

complex numberssmart gridpower gridACOPFOPF

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26)

Related Items

Adaptive Bundle Methods for Nonlinear Robust Optimization

Uses Software

• BARON
• Matlab
• SymPy
• SNOPT
• AMPL
• YALMIP
• Mosek
• MATPOWER
• Robotics
• ECOS
• CVXPY
• Python
• SPOTless
• NESTA
• PGLib-OPF

Cites Work

• Three enhancements for optimization-based bound tightening
• Moments and sums of squares for polynomial optimization and related problems
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A new reformulation-linearization technique for bilinear programming problems
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• A finite algorithm for global minimization of separable concave programs
• Mathematical study of very high voltage power networks. III: The optimal AC power flow problem
• Globally solving a class of optimal power flow problems in radial networks by tree reduction
• Alternating current optimal power flow with generator selection
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
• Strong NP-hardness of AC power flows feasibility
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Graph Theory
• Strong SOCP Relaxations for the Optimal Power Flow Problem
• Equivalent Relaxations of Optimal Power Flow
• Feasibility-Based Bounds Tightening via Fixed Points
• Branching and bounds tighteningtechniques for non-convex MINLP
• Electrical Transmission System Cascades and Vulnerability
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Mathematical Study of Very High Voltage Power Networks II: The AC Power Flow Problem
• Mathematical Study of Very High Voltage Power Networks I: The Optimal DC Power Flow Problem
• Stochastic Defense Against Complex Grid Attacks
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
• Convex Relaxation of Optimal Power Flow—Part II: Exactness
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• Mathematical programming formulations for the alternating current optimal power flow problem