Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently
DOI10.1016/J.EJOR.2021.10.007zbMATH Open1495.91076OpenAlexW3207605546MaRDI QIDQ2116884FDOQ2116884
Murat Köksalan, Banu Lokman, Gökhan Ceyhan
Publication date: 18 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.007
OR in energyBenders decompositionmixed-integer linear programmingday-ahead electricity market clearing problem
Economic models of real-world systems (e.g., electricity markets, etc.) (91B74) Mixed integer programming (90C11)
Cites Work
- Revisiting minimum profit conditions in uniform price day-ahead electricity auctions
- Partitioning procedures for solving mixed-variables programming problems
- Efficient market-clearing prices in markets with nonconvexities
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
- On the determination of European day ahead electricity prices: the Turkish case
- Strict linear prices in non-convex European day-ahead electricity markets
- A MIP framework for non-convex uniform price day-ahead electricity auctions
- Critical review of pricing schemes in markets with non-convex costs
Cited In (3)
- The impact of partial production capacity sharing via production as a service
- An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
Uses Software
Recommendations
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions 👍 👎
- A new optimal electricity market bid model solved through perspective cuts 👍 👎
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities 👍 👎
- Mixed integer parametric bilevel programming for optimal strategic bidding of energy producers in day-ahead electricity markets with indivisibilities 👍 👎
- Solving certain complementarity problems in power markets via convex programming 👍 👎
- An exact solution algorithm for integer bilevel programming with application in energy market optimization 👍 👎
- A MIP framework for non-convex uniform price day-ahead electricity auctions 👍 👎
- Linear programing relaxations for a strategic pricing problem in electricity markets 👍 👎
- Electricity day-ahead markets: computation of Nash equilibria 👍 👎
- A robust optimization approach to energy and reserve dispatch in electricity markets 👍 👎
This page was built for publication: Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116884)
