.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Integer-programming
optimization
unit commitment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.9W
机构
引用论文
Skin sensitization induced Langerhans’ cell mobilization: variable requirements for tumour necrosis factor‐α.png)
Immunology
OAAI
ImmunologyIF0
OAAI分享收藏A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem用于热单位承诺问题的计算有效的混合整数线性公式
PREAI
分享收藏Effect of White Mud as a Second Filler on the Mechanical and Thermal Properties of Bamboo Residue Fiber/Polyethylene CompositesBioResourcesOAAI
BioResourcesIF0
OAAI分享收藏分享收藏
查看更多内容