L. Platbrood

TL;DR: In this paper, the main challenges to the security constrained optimal power flow (SCOPF) computations are discussed, focusing mainly on: approaches to reduce the size of the problem by either efficiently identifying the binding contingencies and including only these contingencies in the SCOPF or by using approximate models for the post-contingency states, and the handling of discrete variables.

TL;DR: This paper proves the practicality of an iterative algorithm for solving realistic large-scale security-constrained optimal power flow (SCOPF) problems based on the combination of a contingency filtering scheme and a network compression method.

TL;DR: In this article, the authors propose a general but very abstract formalization of the security management problem in the form of a three-stage decision making problem under uncertainties in the min-max framework, where the three stages correspond respectively to operation planning, preventive control in operation, and post-contingency emergency control.

TL;DR: This paper presents the main features and the use of the security constrained optimal power flow program, called IPSO (Integrated Power System Optimizer), in the electricity market environment and the utilization of the SCOPF program to evaluate the steady state TTC (Total Transfer Capability).

TL;DR: In this article, the primary reserve allocation that is needed to model accurately post-contingency states in Security Constrained Optimal Power Flow (SCOPF) due to an incident involving a modification of the active power balance is presented.