.png){kind=icon}
Return
A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2006.876672.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new mixed-integer linear formulation for the unit commitment problem of thermal units. The formulation proposed requires fewer binary variables and constraints than previously reported models, yielding a significant computational saving. Furthermore, the modeling framework provided by the new formulation allows including a precise description of time-dependent startup costs and intertemporal constraints such as ramping limits and minimum up and down times. A commercially available mixed-integer linear programming algorithm has been applied to efficiently solve the unit commitment problem for practical large-scale cases. Simulation results back these conclusions.
Keywords:
mixed-integer linear programming (MILP)
thermal generating units
unit commitment
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more