Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem (Q1752849)
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: Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem |
scientific article; zbMATH DE number 6872957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem |
scientific article; zbMATH DE number 6872957 |
Statements
Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem (English)
0 references
24 May 2018
0 references
Lagrangian relaxation
0 references
mixed-integer linear programming
0 references
Benders decomposition
0 references
hydroelectric scheduling
0 references
strategic bidding problem
0 references
stochastic dual dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
