.png){kind=icon}
Return
Using integer programming to refine Lagrangian-based unit commitment solutions
.png){kind=icon}
PRE
AI
DOI：10.1109/59.852114.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
branch-and-bound
dynamic programming
Lagrangian relaxation
mixed-integer programming
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
ShareSave
Optimization of lag time underlies antibiotic tolerance in evolved bacterial populations.png)
Nature
NatureIF0
PREAI
ShareSaveShareSave
View more