A Systematic Formulation Tightening Approach for Unit Commitment Problems

Unit Commitment is usually formulated as a Mixed Binary Linear Programming (MBLP) problem. When considering a large number of units, state-of-the-art methods such as branch-and-cut may experience difficulties. To address this, an important but much overlooked direction is formulation transformation...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on power systems Jg. 35; H. 1; S. 782 - 794
Hauptverfasser:	Yan, Bing, Luh, Peter B., Zheng, Tongxin, Schiro, Dane A., Bragin, Mikhail A., Zhao, Feng, Zhao, Jinye, Lelic, Izudin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.01.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Apexes branch-and-cut Combinatorial analysis Computational efficiency Computational geometry Convexity formulation tightening Hulls ISO Linear programming mixed binary linear programming Power systems Systematics Table lookup Tightening Time factors Unit commitment
ISSN:	0885-8950, 1558-0679
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!