The Complexity of Switching and FACTS Maximum-Potential-Flow Problems
Computational Complexity
2015-07-20 v1
Abstract
This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configuration options: switching lines and using FACTS devices. We present the first comprehensive complexity study of this optimization problem. Our results show hat the problem is NP-complete and that there is no fully polynomial-time approximation scheme. For switching, these results extend to planar networks with a aximum-node degree of 3. Additionally, we demonstrate that the optimization problems are still NP-hard if we restrict the network structure to cacti with a maximum degree of 3.
Cite
@article{arxiv.1507.04820,
title = {The Complexity of Switching and FACTS Maximum-Potential-Flow Problems},
author = {Karsten Lehmann and Alban Grastien and Pascal Van Hentenryck},
journal= {arXiv preprint arXiv:1507.04820},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1411.4369