TL;DR
This paper introduces a new MILP market model for day-ahead electricity auctions that efficiently handles bids with minimum profit or maximum payment conditions, improving market clarity and computational performance.
Contribution
It proposes a novel MILP formulation and decomposition method for uniform price day-ahead auctions with complex bid conditions, extending previous approaches to include MP bids.
Findings
The model accurately captures minimum profit and maximum payment bid conditions.
The decomposition approach efficiently solves large-scale auction problems.
The method generalizes existing block bid handling techniques.
Abstract
We examine the problem of clearing day-ahead electricity market auctions where each bidder, whether a producer or consumer, can specify a minimum profit or maximum payment condition constraining the acceptance of a set of bid curves spanning multiple time periods in locations connected through a transmission network with linear constraints. Such types of conditions are for example considered in the Spanish and Portuguese day-ahead markets. This helps describing the recovery of start-up costs of a power plant, or analogously for a large consumer, utility reduced by a constant term. A new market model is proposed with a corresponding MILP formulation for uniform locational price day-ahead auctions, handling bids with a minimum profit or maximum payment condition in a uniform and computationally-efficient way. An exact decomposition procedure with sparse strengthened Benders cuts derived…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
