Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
It has been recently proven that the semidefinite programming (SDP) relaxation of the optimal power flow problem over radial networks is exact under technical conditions such as not including generation lower bounds or allowing load over-satisfaction. In this paper, we investigate the situation where generation lower bounds are present. We …