Computational scalability for realistic sets of critical contingencies

Assess the computational performance of transient stability-constrained optimal power flow with directly discretized differential-algebraic equations when multiple critical contingencies are enforced in systems of realistic size.

Background

The formulation can represent multiple contingencies by replicating the discretized dynamic equations, transient network equations, and transient-stability constraints for each contingency while sharing the steady-state variables. The paper’s numerical demonstrations, however, use individual contingencies on the WECC 9-bus and modified IEEE 39-bus systems.

Whether the resulting formulation remains computationally tractable when applied to realistic-size systems and sets of critical contingencies is left unresolved.

References

Finally, the computational performance for sets of critical contingencies remains to be assessed in systems of realistic size.

— Shadow Pricing in Transient Stability-Constrained Optimal Power Flow  (2610.18563 - Coelho et al., 13 Oct 2026) in Section 5, Conclusions