{
  "id": "1405.0766",
  "version": "v1",
  "published": "2014-05-05T01:50:37.000Z",
  "updated": "2014-05-05T01:50:37.000Z",
  "title": "Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence",
  "authors": [
    "Steven H. Low"
  ],
  "comment": "Citation: IEEE Transactions on Control of Network Systems, 15(1):15-27, March 2014. This is an extended version with Appendices VIII and IX that provide some mathematical preliminaries and proofs of the main results",
  "journal": "S. H. Low. Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence, IEEE Transactions on Control of Network Systems, 15(1):15-27, March 2014",
  "categories": [
    "math.OC",
    "cs.SY"
  ],
  "abstract": "This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-05-05T01:50:37.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "optimal power flow",
      "convex relaxation",
      "formulations",
      "power flow models",
      "tutorial summarizes"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1405.0766L"
    }
  }
}