On computational complexity of the electric power flow optimization problem in market environment
Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 47-59
Voir la notice de l'article provenant de la source Math-Net.Ru
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. Bibliogr. 10.
Keywords:
computational complexity, electric power system, market.
@article{DA_2017_24_4_a3,
author = {A. V. Eremeev},
title = {On computational complexity of the electric power flow optimization problem in market environment},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {47--59},
publisher = {mathdoc},
volume = {24},
number = {4},
year = {2017},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2017_24_4_a3/}
}
TY - JOUR AU - A. V. Eremeev TI - On computational complexity of the electric power flow optimization problem in market environment JO - Diskretnyj analiz i issledovanie operacij PY - 2017 SP - 47 EP - 59 VL - 24 IS - 4 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2017_24_4_a3/ LA - ru ID - DA_2017_24_4_a3 ER -
A. V. Eremeev. On computational complexity of the electric power flow optimization problem in market environment. Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 4, pp. 47-59. http://geodesic.mathdoc.fr/item/DA_2017_24_4_a3/