Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
DOI10.1016/j.ejor.2016.08.006zbMath1394.90442OpenAlexW2516230096MaRDI QIDQ1752849
Gregory Steeger, Steffen Rebennack
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.08.006
Lagrangian relaxationBenders decompositionmixed-integer linear programmingstochastic dual dynamic programminghydroelectric schedulingstrategic bidding problem
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- An application of optimization theory to the study of equilibria for games: a survey
- Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Partitioning procedures for solving mixed-variables programming problems
- Multi-stage stochastic optimization applied to energy planning
- Surrogate gradient algorithm for Lagrangian relaxation
- Variable metric bundle methods: From conceptual to implementable forms
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Approximating separable nonlinear functions via mixed zero-one programs
- Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse
- Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
- GDDP: Generalized dual dynamic programming theory
- An enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling
- Risk neutral and risk averse stochastic dual dynamic programming method
- Sharing cuts under aggregated forecasts when decomposing multi-stage stochastic programs
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Non-cooperative games
- Hedging and Vertical Integration in Electricity Markets
- Integrated Electricity–Gas Operations Planning in Long-term Hydroscheduling Based on Stochastic Models
- A Mixed Complementarity Model of Hydrothermal Electricity Competition in the Western United States
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- Cross decomposition for mixed integer programming
- Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming
- Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Minimization of unsmooth functionals
- Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions