Decomposition algorithm for large-scale two-stage unit-commitment (Q271986)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decomposition algorithm for large-scale two-stage unit-commitment |
scientific article; zbMATH DE number 6570958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition algorithm for large-scale two-stage unit-commitment |
scientific article; zbMATH DE number 6570958 |
Statements
Decomposition algorithm for large-scale two-stage unit-commitment (English)
0 references
20 April 2016
0 references
A primal-dual decomposition algorithm is proposed for solving the two-stage unit commitment problem in energy management to optimize the production schedule for a set of generation units. The algorithm makes use of several hot started bundle methods without the knowledge of the underlying technical constraints. The convergence of the algorithm and the convexifying effect are studied. The efficiency of the algorithm is demonstrated on real life unit commitment instances.
0 references
decomposition algorithm
0 references
nonsmooth optimization
0 references
two-stage integer programming
0 references
stochastic unit-commitment
0 references
price decomposition
0 references
convex duality
0 references
bundle methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8398361206054688
0 references
0.8300310373306274
0 references
0.8036670684814453
0 references
0.7935137748718262
0 references
0.7930535078048706
0 references
