Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow

Subhonmesh Bose, Dennice F. Gayme, K. Mani Chandy, Steven H. Low

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper presents a class of non-convex quadratically constrained quadratic programs that can be solved in polynomial time when their underlying graph is acyclic, provided the constraints satisfy a technical condition. We demonstrate its use on optimal power flow problems over radial networks.

Original languageEnglish (US)
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, United States
Duration: Mar 19 2014Mar 21 2014

Other

Other2014 48th Annual Conference on Information Sciences and Systems, CISS 2014
CountryUnited States
CityPrinceton, NJ
Period3/19/143/21/14

Keywords

  • Conic relaxation
  • optimal power flow

ASJC Scopus subject areas

  • Information Systems

Fingerprint Dive into the research topics of 'Solving quadratically constrained quadratic programs on acyclic graphs with application to optimal power flow'. Together they form a unique fingerprint.

Cite this