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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on power systems Ročník 35; číslo 1; s. 782 - 794
Hlavní autoři:	Yan, Bing, Luh, Peter B., Zheng, Tongxin, Schiro, Dane A., Bragin, Mikhail A., Zhao, Feng, Zhao, Jinye, Lelic, Izudin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.01.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!