Email this article On computational complexity of the electric power flow optimization problem in market environment
- Authors: Eremeev A.V.1,2
-
Affiliations:
- Sobolev Institute of Mathematics
- Dostoevskii Omsk State University
- Issue: Vol 11, No 4 (2017)
- Pages: 500-505
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212861
- DOI: https://doi.org/10.1134/S1990478917040068
- ID: 212861
Cite item
Open Access
Access granted
Subscription Access
Abstract
Under consideration is the electric power flow optimization problem for an electric power system which typically arises in calculation of electrical power auctions in the “day-ahead” and balancing markets. It was established that the problem of finding a feasible flow in the balancing market is NP-hard in the strong sense even in case of one generator. The problem of finding an optimal flow in the day-ahead market is proved to be NP-hard even with one generator and without controlled cuts.
Keywords
About the authors
A. V. Eremeev
Sobolev Institute of Mathematics; Dostoevskii Omsk State University
Author for correspondence.
Email: eremeev@ofim.oscsbras.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; pr.Mira 55A, Omsk, 644077
Supplementary files
