18 citations · 28 across the 6 of their papers we have counts for
6 papers · 1 filter
Solving convex QPs with structured sparsity under indicator conditions
Daniel Bienstock, Tongtong Chen
We study convex optimization problems where disjoint blocks of variables are controlled by binary indicator variables that are also subject to conditions, e.g., cardinality. Severa…
Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
Daniel Bienstock, Matias Villagra
We present a linear cutting-plane relaxation approach that rapidly proves tight lower bounds for the Alternating Current Optimal Power Flow Problem (ACOPF). Our method leverages ou…
Incentivizing Investment and Reliability: A Study on Electricity Capacity Markets
Cheng Guo, Christian Kroer, Yury Dvorkin +1
The capacity market, a marketplace to exchange available generation capacity for electricity production, provides a major revenue stream for generators and is adopted in several U.…
Robust linear control of nonconvex battery operation in transmission systems
Daniel Bienstock, Carsten Matke, Gonzalo Munoz +1
We describe a robust multiperiod transmission plan- ning model including renewables and batteries, where battery output is used to partly offset renewable output deviations from fo…
On linear relaxations of OPF problems
Daniel Bienstock, Gonzalo Munoz
We present lifted linear relaxations of the OPF problem.
A note on polynomial solvability of the CDT problem
Daniel Bienstock
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.