.png){kind=icon}
返回
A strengthened mixed-integer linear programming formulation for combined-cycle units
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.12.020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to increased utilization of gas-fired combined-cycle units for electric power generation in the U.S., accurate and computationally efficient models for operating these units are crucial to keep an electricity system reliable. The recently proposed edge-based formulation for combined-cycle units helps accurately describe the operations of combined-cycle units by capturing the state transition processes and physical constraints for each turbine. In this paper, we derive tighter constraints and several families of strong valid inequalities to strengthen the edge-based model and improve its computational efficiency by exploring the physical characteristics of combined-cycle units and utilizing the edge-based modeling framework. Meanwhile, we provide the validity and facet-defining proofs for certain inequalities. Finally, the computational results indicate that our derived formulation significantly reduces the computational time, which verifies the effectiveness of proposed tighter constraints and strong valid inequalities. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
OR in energy
Combined-cycle units
Unit commitment
Strong valid inequalities
Strong mixed-integer linear Programming (MILP) formulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem用于热单元承诺问题的紧密而紧凑的MILP公式
.png){kind=icon}
PREAI
分享收藏
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem单位承诺问题的紧混合整数线性规划公式
PREAI
分享收藏A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem用于热单位承诺问题的计算有效的混合整数线性公式
PREAI
分享收藏
查看更多内容