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

By X. Guan, Sangang Guo, Qiaozhu Zhai. 2005

53 citations recorded by the source corpus.

Subfields: Electrical and Electronic Engineering, Safety, Risk, Reliability and Quality

View Paper: https://www.semanticscholar.org/paper/882a1da8f9ca48e07994d344aa0c5233d0d7eeb1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Electrical and Electronic Engineering

1. Hongyu Wu
2. Mohammad E. Khodayar
3. Mohammad Shahidehpour
4. Lei Wu
5. Zuyi Li
6. Rafal Weron
7. Antonio J. Conejo
8. Lei Wu

In Safety, Risk, Reliability and Quality

1. Hongyu Wu
2. Mohammad E. Khodayar
3. Mohammad Shahidehpour
4. Lei Wu
5. Rafal Weron

Citations in the corpus

• Accelerating the Benders decomposition for network-constrained unit commitment problems (2010, methodology): “Reference [5] used the feasibility theorem of BD to derive an analytical condition for determining whether feasible solutions of the original SCUC problems could be obtained from the current dual solution of Lagrangian Relaxation.”
• Hourly Demand Response in Day-Ahead Scheduling Considering Generating Unit Ramping Cost (2013, background): “In developing the day-ahead schedule, the hourly unit commitment (UC) has conventionally adopted a stepwise output of thermal generating units as well as fixed ramp-rate limits for representing generator rotor fatigues as the hourly system demand is changed [8]–[10].”