Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching

References

• Bai X, Wei H, Fujisawa K, Wang Y (2008) Semidefinite programming for optimal power flow problems. Internat. J. Electrical Power Energy Systems 30(6–7):383–392.Google Scholar
• Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming 58(1–3):295–324.Crossref, Google Scholar
• Barrows C, Blumsack S (2012) Transmission switching in the RTS-96 test system. IEEE Trans. Power Systems 27(2):1134–1135.Crossref, Google Scholar
• Barrows C, Blumsack S, Bent R (2012) Computationally efficient optimal transmission switching: Solution space reduction. 2012 IEEE Power Energy Soc. General Meeting (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Barrows C, Blumsack S, Hines P (2014) Correcting optimal transmission switching for AC power flows. 2014 IEEE Power Energy Soc. General Meeting (IEEE, Piscataway, NJ), 1–5.Google Scholar
• Belotti P, Bonami P, Fischetti M, Lodi A, Monaci M, Nogales-Gómez A, Salvagnin D (2016) On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3):1–22.Crossref, Google Scholar
• Bonami P, Lodi A, Tramontani A, Wiese S (2015) On mathematical programming with indicator constraints. Math. Programming 151(1):191–223.Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ceria S, Soares J (1999) Convex programming for disjunctive convex optimization. Math. Programming 86(3):595–614.Google Scholar
• Chen C, Atamtürk A, Oren SS (2017) A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Programming 165(2):549–577.Crossref, Google Scholar
• Coffrin C, Gordon D, Scott P (2014a) NESTA, the NICTA Energy System Test Case Archive. Working paper, NICTA, Sydney. https://arxiv.org/abs/1411.0359.Google Scholar
• Coffrin C, Hijazi HL, Van Hentenryck P (2015a) Strengthening the SDP relaxation of AC power flows with convex envelopes, bound tightening, and lifted nonlinear cuts. Working paper, NICTA, Sydney. https://arxiv.org/abs/1512.04644.Google Scholar
• Coffrin C, Hijazi HL, Van Hentenryck P (2015b) Strengthening convex relaxations with bound tightening for power network optimization. Pesant G, ed. Principles and Practice of Constraint Programming (Springer International Publishing, Cham, Switzerland), 39–57.Crossref, Google Scholar
• Coffrin C, Hijazi H, Lehmann K, Van Hentenryck P (2014b) Primal and dual bounds for optimal transmission switching. Power Systems Comput. Conf. (IEEE, Piscataway, NJ), 1–8.Crossref, Google Scholar
• Ferreira R, Borges C, Pereira M (2013) Distribution network reconfiguration under modeling of AC optimal power flow equations: A mixed-integer programming approach. 2013 IEEE PES Conf. (IEEE, Piscataway, NJ), 1–8.Google Scholar
• Fisher E, O’Neill R, Ferris M (2008) Optimal transmission switching. IEEE Trans. Power Systems 23(3):1346–1355.Google Scholar
• Frangioni A, Gentile C (2006) Perspective cuts for a class of convex 0–1 mixed integer programs. Math. Programming 106(2):225–236.Crossref, Google Scholar
• Frangioni A, Gentile C, Lacalandra F (2009) Tighter approximated MILP formulations for unit commitment problems. IEEE Trans. Power Systems 24(1):105–113.Crossref, Google Scholar
• Fuller J, Ramasra R, Cha A (2012) Fast heuristics for transmission-line switching. IEEE Trans. Power Systems 27(3):1377–1386.Google Scholar
• Ghaddar B, Jabr R (2019) Power transmission network expansion planning: A semidefinite programming branch-and-cut approach. Eur. J. Oper. Res. 274(3):837–844.Google Scholar
• Grossmann IE, Lee S (2003) Generalized convex disjunctive programming: Nonlinear convex hull relaxation. Comput. Optim. Appl. 26(1):83–100.Google Scholar
• Günlük O, Linderoth J (2010) Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Programming 124(1–2):183–205.Google Scholar
• Hedman K, O’Neill R, Fisher E, Oren S (2008) Optimal transmission switching—Sensitivity analysis and extensions. IEEE Trans. Power Systems 23(3):1469–1479.Google Scholar
• Hedman K, O’Neill R, Fisher E, Oren S (2009) Optimal transmission switching with contingency analysis. IEEE Trans. Power Systems 24(3):1577–1586.Google Scholar
• Hedman K, Ferris M, O’Neill R, Fisher E, Oren S (2010) Co-optimization of generation unit commitment and transmission switching with N − 1 reliability. IEEE Trans. Power Systems 25(2):1052–1063.Google Scholar
• Hijazi H, Coffrin C, Van Hentenryck P (2017) Convex quadratic relaxations for mixed-integer nonlinear programs in power systems. Math. Programming Comput. 9(3):321–367.Crossref, Google Scholar
• Hijazi H, Bonami P, Cornujols G, Ouorou A (2012) Mixed-integer nonlinear programs featuring on/off constraints. Comput. Optim. Appl. 52(2):537–558.Google Scholar
• Jabr RA, Singh R, Pal BC (2012) Minimum loss network reconfiguration using mixed-integer convex programming. IEEE Trans. Power Systems 27(2):1106–1115.Crossref, Google Scholar
• Kocuk B, Dey SS, Sun XA (2017) New formulation and strong MISOCP relaxations for AC optimal transmission switching problem. IEEE Trans. Power Systems 32(6):4161–4170.Google Scholar
• Lovász L, Schrijver A (1991) Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1(2):166–190.Crossref, Google Scholar
• Mareček J, Mevissen M, Villumsen JC (2016) MINLP in transmission expansion planning. Power Systems Comput. Conf. (IEEE Piscataway, NJ), 1–8.Crossref, Google Scholar
• McCormick G (1976) Computability of global solutions to factorable nonconvex programs: Part I—convex underestimating problems. Math. Programming 10(1):146–175.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1988) Integer and Combinatorial Optimization, Interscience Series in Discrete Mathematics and Optimization (John Wiley & Sons, New York).Crossref, Google Scholar
• O’Neill R, Baldick R, Helman U, Rothkopf M, Stewart JW (2005) Dispatchable transmission in RTO markets. IEEE Trans. Power Systems 20(1):171–179.Google Scholar
• Potluri T, Hedman K (2012) Impacts of topology control on the ACOPF. 2012 IEEE Power Energy Soc. General Meeting (IEEE, Piscataway, NJ), 1–7.Google Scholar
• Rolim J, Machado L (1999) A study of the use of corrective switching in transmission systems. IEEE Trans. Power Systems 14(1):336–341.Google Scholar
• Shao W, Vittal V (2005) Corrective switching algorithm for relieving overloads and voltage violations. IEEE Trans. Power Systems 20(4):1877–1885.Google Scholar
• Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411–430.Crossref, Google Scholar
• Stubbs AR, Mehrotra S (1999) A branch-and-cut method for 0-1 mixed convex programming. Math. Programming 86(3):515–532.Google Scholar
• Wächter A, Biegler LT (2006) On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Programming 106(1):25–57.Crossref, Google Scholar