A new formulation of the European day-ahead electricity market problem and its algorithmic consequences

Mehdi Madani () and Mathieu van Vyve ()
Additional contact information
Mehdi Madani: Université catholique de Louvain, Louvain School of Management, Belgium
Mathieu van Vyve: niversité catholique de Louvain, CORE and Louvain School of Management, Belgium

No 2013074, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: A new formulation of the optimization problem implementing European market rules for non- convex day-ahead electricity markets is presented, that avoids the use of complementarity constraints to express market equilibrium conditions, and also avoids the introduction of auxiliary binary variables to linearise these constraints. Instead, we rely on strong duality theory for linear or convex quadratic optimization problems to recover equilibrium constraints imposed by most of European power exchanges facing indivisible orders. When only so-called stepwise preference curves are considered to describe continuous bids, the new formulation allows to take full advantage of state-of-the-art solvers, and in most cases, an optimal solution together with market clearing prices can be computed for large-scale instances without any further algorithmic work. The new formulation also suggests a very competitive Benders-like decomposition procedure, which helps to handle the case of interpolated preference curves that yield quadratic primal and dual objective functions, and consequently a dense quadratic constraint. This procedure essentially consists in strengthening classical Benders cuts locally. Computational experiments on real data kindly provided by main European power exchanges (Apx-Endex, Belpex and Epex spot) show that in the linear case, both approaches are very efficient, while for quadratic instances, only the decomposition procedure is tractable and shows very good results. Finally, when most orders are block orders, and instances are combinatorially very hard, the new MILP approach is substantially more efficient.

Keywords: Auctions/bidding; market coupling; equilibrium prices; mixed integer programming; large scale optimization (search for similar items in EconPapers)
JEL-codes: C61 D44 (search for similar items in EconPapers)
Date: 2013-12-31
New Economics Papers: this item is included in nep-cmp, nep-ene and nep-reg
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2013.html (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:2013074

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().