Security constrained optimal power flow

[hei06j]

Is your feature request related to a problem? Please describe.
I want to represent N-1 (N-k) security constrained optimal power flow (unit commitment, economic dispatch) with PTDF formulation against branch and generator contingencies. A two stage mathematical problem and/or decomposition techniques can be used to improve computation efficiency.

Describe the solution you'd like
The N-1 (N-K) secure network with preventive actions can tolerate the branch and generator contingencies considered in the contingency list.

Corrective actions such as re-dispatch, transformer OLTC, and line switching could also be added.