.png){kind=icon}
.png){kind=icon}
Return
An interior-point/cutting-plane method to solve unit commitment problems
.png){kind=icon}
PRE
AI
DOI：10.1109/59.871728.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An interior-point/cutting-plane method for nondifferentiable optimization is used to solve the dual to a unit commitment problem, The interior-point/cutting-plane method has two advantages over previous approaches, such as the sub-gradient and bundle methods: first, it has better convergence characteristics; and second, does not suffer from the parameter-tunning drawback. The results of a performance testing using systems with up to 104 units confirm the superiority of the interior-point /cutting-plane method over previous approaches.
Keywords:
interior-point methods
Lagrangian relaxation
nondifferentiable optimization
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