Phase Transitions for Optimality Gaps in Optimal Power Flows A Study on the French Transmission Network
暂无分享,去创建一个
[1] Pascal Van Hentenryck,et al. Polynomial SDP cuts for Optimal Power Flow , 2015, 2016 Power Systems Computation Conference (PSCC).
[2] Lorenz T. Biegler,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..
[3] A. G. Expósito,et al. Reliable load flow technique for radial distribution networks , 1999 .
[4] R. Jabr. Optimal Power Flow Using an Extended Conic Quadratic Formulation , 2008, IEEE Transactions on Power Systems.
[5] Thomas J. Overbye,et al. A comparison of the AC and DC power flow models for LMP calculations , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.
[6] Pascal Van Hentenryck,et al. AC-Feasibility on Tree Networks is NP-Hard , 2014, IEEE Transactions on Power Systems.
[7] Carleton Coffrin,et al. The QC Relaxation: A Theoretical and Computational Study on Optimal Power Flow , 2017, IEEE Transactions on Power Systems.
[8] J. Lavaei,et al. Physics of power networks makes hard optimization problems easy to solve , 2012, 2012 IEEE Power and Energy Society General Meeting.
[9] A. Monticelli,et al. Security-Constrained Optimal Power Flow with Post-Contingency Corrective Rescheduling , 1987, IEEE Transactions on Power Systems.
[10] R. Jabr. Radial distribution load flow using conic programming , 2006, IEEE Transactions on Power Systems.
[11] WächterAndreas,et al. On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006 .
[12] Pascal Van Hentenryck,et al. Convex quadratic relaxations for mixed-integer nonlinear programs in power systems , 2016, Mathematical Programming Computation.
[13] Pascal Van Hentenryck,et al. Strengthening the SDP Relaxation of AC Power Flows With Convex Envelopes, Bound Tightening, and Valid Inequalities , 2017, IEEE Transactions on Power Systems.
[14] S. Low,et al. Zero Duality Gap in Optimal Power Flow Problem , 2012, IEEE Transactions on Power Systems.
[15] K. Fujisawa,et al. Semidefinite programming for optimal power flow problems , 2008 .
[16] Pascal Van Hentenryck,et al. Strengthening Convex Relaxations with Bound Tightening for Power Network Optimization , 2015, CP.