10.4230/OASICS.SCOR.2012.94
Marinovic, Minja R.
Minja R.
Marinovic
Makajic-Nikolic, Dragana D.
Dragana D.
Makajic-Nikolic
Stanojevic, Milan J.
Milan J.
Stanojevic
Dordevic, Lena S.
Lena S.
Dordevic
Optimization of electricity trading using linear programming
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
energy daily trading
day-ahead planning
LP model
optimization
Ravizza, Stefan
Stefan
Ravizza
Holborn, Penny
Penny
Holborn
2012
2012-06-26
2012-06-26
2012-06-26
en
urn:nbn:de:0030-drops-35505
10.4230/OASIcs.SCOR.2012
978-3-939897-39-2
2190-6807
10.4230/OASIcs.SCOR.2012
OASIcs, Volume 22, SCOR 2012
3rd Student Conference on Operational Research
2012
22
10
94
102
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ravizza, Stefan
Stefan
Ravizza
Holborn, Penny
Penny
Holborn
2190-6807
Open Access Series in Informatics (OASIcs)
2012
22
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
9 pages
595691 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
In the last two decades, the liberalization of the electricity markets have been established in order to increase efficiency, harmonize and reduce electricity prices, make a better use of resources, give customers the right to choose their supplier and provide customers with a better service. This change made the electricity market competitive and introduced several new subjects. In this paper, we study one of these subjects: Electricity Trading Company (ETC) and its daily trading process. We present a linear mathematical model of total daily profit maximization subject to flow constraints. It is assumed that the demand and supply are known and some of them are arranged. Possible transmission capacities are known but also additional capacities can be purchased. All trading, transmission prices and amounts are subject of auctions. First, we present energy trading problem as directed multiple-source and multiple-sink network and then model it using linear programming. Also, we provide one realistic example which is slightly changed in order to save confidentiality of the given data.
OASIcs, Vol. 22, 3rd Student Conference on Operational Research, pages 94-102