A new formulation of the European day-ahead electricity market problem and its algorithmic consequences
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.
|Date of creation:||31 Dec 2013|
|Contact details of provider:|| Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)|
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Manuel Förster & Ana Mauleon & Vincent J. Vannetelbosch, 2014.
"Trust and Manipulation in Social Networks,"
2014.50, Fondazione Eni Enrico Mattei.
- Manuel Förster & Ana Mauleon & Vincent Vannetelbosch, 2013. "Trust and Manipulation in Social Networks," Documents de travail du Centre d'Economie de la Sorbonne 13065, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Manuel Förster & Ana Mauleon & Vincent Vannetelbosch, 2013. "Trust and Manipulation in Social Networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00881145, HAL.
- FORSTER, Manuel & MAULEON, Ana & VANNETELBOSCH, Vincent, 2013. "Trust and manipulation in social networks," CORE Discussion Papers 2013050, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jean Hindriks & Gareth D. Myles, 2006.
"Intermediate Public Economics,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262083442.
- VARDAR, N. Baris, 2013. "Imperfect resource substitution and optimal transition to clean technologies," CORE Discussion Papers 2013072, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Nigar Hashimzade & Jean Hindriks & Gareth D. Myles, 2006. "Solutions Manual to Accompany Intermediate Public Economics," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262582694.
- Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680, December.
When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2013074. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS)
If references are entirely missing, you can add them using this form.