Necessary Conditions of Line Congestions in Uncertainty Accommodation

摘要

In this letter, a set of general necessary conditions for line congestions are established during ramping delivery, i.e., the redispatch process for uncertainty accommodation. Mathematically, the consideration of all line flow constraints may cause the intractability of the max-min problem in robust security-constrained unit commitment and dispatch. Without solving time-consuming linear programming (LP) problems, the lines that will not be congested can be quickly identified based on the necessary conditions and corresponding line flow constraints can be removed from the max-min subproblem in robust approaches. A promising application of the conditions is presented via the preprocessed max-min problem with high computational performance.