Modeling Approaches for Computational Cost Reduction in Stochastic Unit Commitment Formulations
Although stochastic commitment policies provide robust and efficient solutions, they have high computational costs. This letter considers two modeling approaches for the reduction of their computational effort: the relaxation of the integrality constraint of fast-start units, and the modeling of gen...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on power systems 2010-02, Vol.25 (1), p.588-589 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Although stochastic commitment policies provide robust and efficient solutions, they have high computational costs. This letter considers two modeling approaches for the reduction of their computational effort: the relaxation of the integrality constraint of fast-start units, and the modeling of generation outages as load increments. These approaches are shown to reduce the computational cost while maintaining the good properties of stochastic policies. |
---|---|
ISSN: | 0885-8950 1558-0679 |
DOI: | 10.1109/TPWRS.2009.2036462 |