Home > Research > Publications & Outputs > MIP Formulations of Piece-wise Polyhedral Relax...

Associated organisational unit

Electronic data

  • IEEE_Conference_Template (1)

    Accepted author manuscript, 209 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

View graph of relations

MIP Formulations of Piece-wise Polyhedral Relaxations of AC Power Flow Equations

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Publication date23/02/2023
Host publication2023 IEEE PES General Meeting
Number of pages5
<mark>Original language</mark>English


In recent years, piece-wise convex relaxations of power flow equations have attracted substantial academic interest. These approaches build such relaxations by partitioning the variables' domain. However, the ensued formulations grow very rapidly in size with the number of partitions, thus becoming computationally intractable to achieve strong dual bounds for realistic-size instances. In this work, we propose piece-wise polyhedral relaxations of power flow equations utilizing the latest advancements in mixed-integer programming (MIP) modeling techniques. A computational campaign conducted on 24 PGLib benchmark instances of the OPF problem shows that the choice of MIP formulation on piece-wise polyhedral relaxation of power flow equations significantly impacts the computational time.