2018
DOI: 10.1016/j.ejor.2017.10.024
|View full text |Cite
|
Sign up to set email alerts
|

Revisiting minimum profit conditions in uniform price day-ahead electricity auctions

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, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(22 citation statements)
references
References 14 publications
(43 reference statements)
0
22
0
Order By: Relevance
“…The paper concludes that the restrictions could be relaxed, both concerning the block size restrictions as well as on the number of blocks that a participant can submit per day. Madani and Vyve [22] present a market model to examine nonconvex uniform price auctions, where bidders, either consumers or producers, can specify a minimum profit or maximum payment condition. Those conditions are similar to EUPHEMIA order types, however when compared to the MIC orders of the OMIE power exchange, they have advantages, including faster implementation of the methodology and better representation of the operating constraints of the power units.…”
Section: Introductionmentioning
confidence: 99%
“…The paper concludes that the restrictions could be relaxed, both concerning the block size restrictions as well as on the number of blocks that a participant can submit per day. Madani and Vyve [22] present a market model to examine nonconvex uniform price auctions, where bidders, either consumers or producers, can specify a minimum profit or maximum payment condition. Those conditions are similar to EUPHEMIA order types, however when compared to the MIC orders of the OMIE power exchange, they have advantages, including faster implementation of the methodology and better representation of the operating constraints of the power units.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, we can strictly increase SW , which contradicts the optimality. In the case where G m = G m , then we necessarily have D m < D m (otherwise λ n = −2ã n (D n − D * n ) − µ n < 0 which is impossible from (9c)), and we can strictly increase D m instead of decreasing G m in (17), leading to the same contradiction.…”
Section: Centralized Market Designmentioning
confidence: 95%
“…Reference [26] formulates a mixed-integer linear program (MILP) to clear the market with an additional iterative process to handle PRBs. Reference [27] proposes a primal-dual formulation of the market clearing problem, where an improved Benders-like decomposition method is further introduced to strengthen the classical Benders cuts, which is extended in [28]. In [19] a clearing method to minimize the impact of PRBs on the final solution is proposed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The objective function of the final MILP model is defined in (28), whereas the problem's constraints are:…”
Section: Appendix a The Final Milp Modelmentioning
confidence: 99%