A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm with tight error bounds for single-period unit commitment problem |
scientific article |
Statements
A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (English)
0 references
7 March 2023
0 references
nonlinear programming
0 references
Lagrangian dual
0 references
unit commitment problem
0 references
mixed-integer quadratic programming
0 references
convex relaxation
0 references
0 references
0 references
0 references
0 references
