The conditions for obtaining feasible solutions to security-constrained unit commitment problems

The core of solving security-constrained unit commitment (SCUC) problems within the Lagrangian relaxation framework is how to obtain feasible solutions. However, due to the existence of the transmission constraints, it is very difficult to determine if feasible solutions to SCUC problems can be obtained by adjusting generation levels with the commitment states obtained in the dual solution of Lagrangian relaxation. The analytical and computational necessary and sufficient conditions are presented in this paper to determine the feasible unit commitment states with grid security constraints. The analytical conditions are proved rigorously based on the feasibility theorem of the Benders decomposition. These conditions are very crucial for developing an efficient method for obtaining feasible solutions to SCUC problems. Numerical testing results show that these conditions are effective.

[1]  Shmuel S. Oren,et al.  A transmission-constrained unit commitment method in power system scheduling , 1999, Decis. Support Syst..

[2]  S. M. Shahidehpour,et al.  Extended neighborhood search algorithm for constrained unit commitment , 1997 .

[3]  S. M. Shahidehpour,et al.  Unit commitment with transmission security and voltage constraints , 1999 .

[4]  A.I. Cohen,et al.  Optimization-based methods for operations scheduling , 1987, Proceedings of the IEEE.

[5]  Xiaohong Guan,et al.  Unit Commitment with Identical Units: Successive Subproblem Solving Method Based on Lagrangian Relaxation , 2002, IEEE Power Engineering Review.

[6]  J. J. Shaw,et al.  A direct method for security-constrained unit commitment , 1995 .

[7]  A. J. Svoboda,et al.  A new unit commitment method , 1997 .

[8]  Francisco D. Galiana,et al.  Towards a more rigorous and practical unit commitment by Lagrangian relaxation , 1988 .

[9]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[10]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[11]  Alberto Borghetti,et al.  Lagrangian heuristics based on disaggregated Bundle for hydrothermal unit commitment , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[12]  J. A. Amalfi,et al.  An optimization-based method for unit commitment , 1992 .

[13]  Luís Ferreira,et al.  Short-term resource scheduling in multi-area hydrothermal power systems , 1989 .