Reports

Accurate Linear Cutting-Plane Relaxations for ACOPF

Bienstock, Daniel; Villagra, Matias

We present a pure linear cutting-plane relaxation approach for rapidly proving tight and accurate lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF) and its multi-period extension with ramping constraints. This approach proves both rapid and numerically stable, thus being able to provide relaxations for the largest multiperiod instances that are tight and, often, face no competition because alternative schemes convincingly fail to converge.

Keywords: ACOPF, Power Grids, Optimization

Files

More About This Work