J. F. Benders, “Partition Procedures for Solving Mixed- Variables Programming Problems,” Computational Management Science, Vol. 2, No. 1, 2005, pp. 3-19.
has been cited by the following article:
TITLE: A Quick Method for Judging the Feasibility of Security-Constrained Unit Commitment Problems within Lagrangian Relaxation Framework
AUTHORS: Sangang Guo
KEYWORDS: Security Constrained Unit Commitment (SCUC); Lagrangian Relaxation; Benders Decomposition Feasibility Theorem; Ramp Rate Constraint
JOURNAL NAME: Energy and Power Engineering, Vol.4 No.6, November 29, 2012
ABSTRACT: Generally, the procedure for Solving Security constrained unit commitment (SCUC) problems within Lagrangian Relaxation framework is partitioned into two stages: one is to obtain feasible SCUC states; the other is to solve the economic dispatch of generation power among all the generating units. The core of the two stages is how to determine the feasibility of SCUC states. The existence of ramp rate constraints and security constraints increases the difficulty of obtaining an analytical necessary and sufficient condition for determining the quasi-feasibility of SCUC states at each scheduling time. However, a numerical necessary and sufficient numerical condition is proposed and proven rigorously based on Benders Decomposition Theorem. Testing numerical example shows the effectiveness and efficiency of the condition.