.png){kind=icon}
Return
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2011.2162008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper examines the polytope of feasible power generation schedules in the unit commitment (UC) problem. We provide computational results comparing formulations for the UC problem commonly found in the literature. We introduce a new class of inequalities, giving a tighter description of feasible operating schedules for generators. Computational results show that these inequalities can significantly reduce overall solution times.
Keywords:
Integer-programming
optimization
unit commitment
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.9W
Organization
Cited Papers
Skin sensitization induced Langerhans’ cell mobilization: variable requirements for tumour necrosis factor‐α.png)
Immunology
OAAI
ImmunologyIF0
OAAIShareSaveShareSaveA computationally efficient mixed-integer linear formulation for the thermal unit commitment problem
PREAI
ShareSaveEffect of White Mud as a Second Filler on the Mechanical and Thermal Properties of Bamboo Residue Fiber/Polyethylene CompositesBioResourcesOAAI
BioResourcesIF0
OAAIShareSaveShareSave
View more