Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem

From MaRDI portal
Publication:1752849

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




Related Items

Deterministic electric power infrastructure planning: mixed-integer programming model and nested decomposition algorithmModelling of hydrothermal unit commitment coordination using efficient metaheuristic algorithm: a hybridized approachStochastic dual dynamic integer programmingData-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systemsAn integrated planning model in centralized power systemsA hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity marketStrategic investment decisions in an oligopoly with a competitive fringe: an equilibrium problem with equilibrium constraints approachRobust multi-stage economic dispatch with renewable generation and storageMultistage stochastic demand-side management for price-making major consumers of electricity in a co-optimized energy and reserve marketA multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contractAccelerating Benders decomposition for short-term hydropower maintenance schedulingTransmission network investment using incentive regulation: a disjunctive programming approachA successive linear programming algorithm with non-linear time series for the reservoir management problemHigh-Performance Prototyping of Decomposition Methods in GAMSNon-convex nested Benders decomposition



Cites Work