Bound Tightening for the Alternating Current Optimal Power Flow Problem

@article{Chen2016BoundTF,
  title={Bound Tightening for the Alternating Current Optimal Power Flow Problem},
  author={Chen Chen and Alper Atamturk and Shmuel S. Oren},
  journal={IEEE Transactions on Power Systems},
  year={2016},
  volume={31},
  pages={3729-3736}
}
We consider the Alternating Current Optimal Power Flow (ACOPF) problem, formulated as a nonconvex Quadratically-Constrained Quadratic Program (QCQP) with complex variables. ACOPF may be solved to global optimality with a semidefinite programming (SDP) relaxation in cases where its QCQP formulation attains zero duality gap. However, when there is positive duality gap, no optimal solution to the SDP relaxation is feasible for ACOPF. One way to find a global optimum is to partition the problem… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 30 references

A Spatial Branch-and-Cut Algorithm for Nonconvex QCQP With Bounded Complex Variables

  • C. Chen, A. Atamtürk, S. S. Oren
  • IEOR Dept.,
  • 2015
Highly Influential
8 Excerpts

On linear relaxations of opf problems

  • D. Bienstock, G. Munoz
  • arXiv preprint arXiv:1411.1120, 2014.
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…