A Quick Method for Judging the Feasibility of Security-Constrained Unit Commitment Problems within Lagrangian Relaxation Framework

DOI: 10.4236/epe.2012.46057   PDF   HTML     4,910 Downloads   6,692 Views   Citations


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.

Share and Cite:

S. Guo, "A Quick Method for Judging the Feasibility of Security-Constrained Unit Commitment Problems within Lagrangian Relaxation Framework," Energy and Power Engineering, Vol. 4 No. 6, 2012, pp. 432-438. doi: 10.4236/epe.2012.46057.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] B. F. Hobbs, M. H. Rothhopf, R. P. Oneill and H. Chao, “The Next Generation of Electric Power Unit Commitment Models,” Kluwer Academic Publishers, London, 1999.
[2] J. M. Crepo, J. Usao la and J. L. Fernandez, “Securityconstrained Optimal Generation Scheduling in Large- Scale Power Systems,” IEEE Transactions on Power Systems, Vol. 21, No. 1, 2006, pp. 321-332. doi:10.1109/TPWRS.2005.860942
[3] Y. Fu and M. Shahidepour, “Fast SCUC for Large-Scale Power Systems,” IEEE Transactions on Power Systems, Vol. 22, No. 4, 2007, pp. 2144-2151. doi:10.1109/TPWRS.2007.907444
[4] X. Guan, Q. Zhai and A. Papalexpoulos, “Optimization Based Methods for Unit Commitment: Lagrangian Relaxation versus General Mixed Integer Programming,” 2003 IEEE Power Engineering Society General Meeting, Ontario, 13-17 July 2003, pp. 1095-1100.
[5] J. J. Shaw, “A Direct Method for Security-Constrained Unit Commitment,” IEEE Transactions on Power Systems, Vol. 10, No. 3, 1995, pp. 1329-1342. doi:10.1109/59.466520
[6] X. Guan, S. G. Guo and Q. Z. Zhai, “Conditions for Obtaining Feasible Solutions to Security Constrained Unit Commitment Problems,” IEEE Transactions on Power System, Vol. 20, No. 4, 2005, pp. 1746-1756. doi:10.1109/TPWRS.2005.857399
[7] J. F. Benders, “Partition Procedures for Solving Mixed- Variables Programming Problems,” Computational Management Science, Vol. 2, No. 1, 2005, pp. 3-19.
[8] A. M. Geoffrion, “Generalized Benders Decomposition,” Journal of Optimization Theory and Applications, Vol. 10, No. 4, 1972, pp. 237-260. doi:10.1007/BF00934810
[9] D. P. Bertsekas, “Nonlinear Programming,” Athena Scientific, 1995.

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.