返回
Using integer programming to refine Lagrangian-based unit commitment solutions
DOI:10.1109/59.852114.png)
摘要
En 中文
We develop a technique for refining the unit commitment solution obtained from solving the Lagrangian. Our model is an integer program with nonlinear constraints. It can be solved to optimality using branch-and-bound. Numerical results indicate a significant improvement in the quality of the solution obtained.
Keyword:
branch-and-bound
dynamic programming
Lagrangian relaxation
mixed-integer programming
unit commitment
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息

