On computational complexity of the electric power flow optimization problem in market environment

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-h...

Full description

Saved in:
Bibliographic Details
Published in:Journal of applied and industrial mathematics 2017-10, Vol.11 (4), p.500-505
Main Author: Eremeev, A. V.
Format: Article
Language:English
Subjects:
Electric power
Energy management
Markets
Mathematics
Mathematics and Statistics
Optimization
Power flow
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478917040068