A non-iterative algorithm reduces a bilevel MPEC for two-layer energy-sharing markets with voltage constraints to a tractable MISOCP, shown to run in under a second on an IEEE 123-bus system with 12,300 prosumers.
Branch Flow Model: Relaxations and Convexification—Part I,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Non-Iterative Algorithm for Clearing Two-Layer Energy-Sharing Markets with Voltage Constraints
A non-iterative algorithm reduces a bilevel MPEC for two-layer energy-sharing markets with voltage constraints to a tractable MISOCP, shown to run in under a second on an IEEE 123-bus system with 12,300 prosumers.