Global optimization of Optimal Power Flow using a branch & bound algorithm

@article{Gopalakrishnan2012GlobalOO,
  title={Global optimization of Optimal Power Flow using a branch & bound algorithm},
  author={Ajit Gopalakrishnan and Arvind U. Raghunathan and Daniel Nikovski and Lorenz T. Biegler},
  journal={2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2012},
  pages={609-616}
}
We propose two algorithms for the solution of the Optimal Power Flow (OPF) problem to global optimality. The algorithms are based on the spatial branch and bound framework with lower bounds on the optimal objective function value calculated by solving either the Lagrangian dual or the semidefinite programming (SDP) relaxation. We show that this approach can solve to global optimality the general form of the OPF problem including: generation power bounds, apparent and real power line limits… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 37 CITATIONS, ESTIMATED 26% COVERAGE

142 Citations

02040'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 142 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

Similar Papers

Loading similar papers…