By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaohong Guan ; Syst. Eng. Inst. & SKLMS Lab., Xian Jiaotong Univ., China ; Sangang Guo ; Qiaozhu Zhai

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.

Published in:

IEEE Transactions on Power Systems  (Volume:20 ,  Issue: 4 )