3 papers
math.OC2025
Advanced Cutting-Plane Algorithms for ACOPF
Daniel Bienstock, Matias Villagra
We propose a disciplined, numerically stable, and scalable approach to SDP relaxations of the ACOPF problem based on linear cutting-planes. Our method can be warm-started and, owin…
math.OC2025
A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
MatÃas Romero, Felipe Verástegui, MatÃas Villagra
We propose a linear cutting-plane pricing algorithm tailored for large-scale electricity markets, addressing nonconvexities arising from the Alternating Current Optimal Power Flow…
math.OC2024
Accurate Linear Cutting-Plane Relaxations for ACOPF
Daniel Bienstock, Matias Villagra
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 it…