The paper introduces pyramidal and quasi-pyramidal relaxations of the second-order cone for AC OPF with provable epsilon-feasibility guarantees and a dynamic cut generation framework that speeds up solving on PGLib benchmarks.
Robust security constrained ACOPF via conic programming: Identifying the worst contingencies,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Dynamic Relaxation Framework for Global Solution of ACOPF
The paper introduces pyramidal and quasi-pyramidal relaxations of the second-order cone for AC OPF with provable epsilon-feasibility guarantees and a dynamic cut generation framework that speeds up solving on PGLib benchmarks.