2000 character limit reached
Improving Optimal Power Flow Relaxations Using 3-Cycle Second-Order Cone Constraints
Published 14 Apr 2021 in math.OC and cs.CE | (2104.06695v1)
Abstract: This paper develops a novel second order cone relaxation of the semidefinite programming formulation of optimal power flow, that does not imply the `angle relaxation'. We build on a technique developed by Kim et al., extend it for complex matrices, and apply it to 3x3 positive semidefinite matrices to generate novel second-order cone constraints that augment upon the well-known 2x2 principal-minor based second-order cone constraints. Finally, we apply it to optimal power flow in meshed networks and provide numerical illustrations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.