%PDF-1.5 % 4 0 obj << /S /GoTo /D (section.1) >> endobj 7 0 obj (Introduction) endobj 8 0 obj << /S /GoTo /D (subsection.1.1) >> endobj 11 0 obj (Paper Layout) endobj 12 0 obj << /S /GoTo /D (subsection.1.2) >> endobj 15 0 obj (Mathematical Notation) endobj 16 0 obj << /S /GoTo /D (section.2) >> endobj 19 0 obj (Power System Modeling) endobj 20 0 obj << /S /GoTo /D (section.3) >> endobj 23 0 obj (Terminology and Problem Statement) endobj 24 0 obj << /S /GoTo /D (subsection.3.1) >> endobj 27 0 obj (Power Networks) endobj 28 0 obj << /S /GoTo /D (subsection.3.2) >> endobj 31 0 obj (The Power Flow Problem) endobj 32 0 obj << /S /GoTo /D (subsection.3.3) >> endobj 35 0 obj (The Optimal Power Flow Problem) endobj 36 0 obj << /S /GoTo /D (subsection.3.4) >> endobj 39 0 obj (Restricted Radial Networks) endobj 40 0 obj << /S /GoTo /D (section.4) >> endobj 43 0 obj (The Tree Reduction/Expansion Method) endobj 44 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 47 0 obj (Tree Reductions) endobj 48 0 obj << /S /GoTo /D (subsection.4.2) >> endobj 51 0 obj (Curved Radial Networks) endobj 52 0 obj << /S /GoTo /D (subsection.4.3) >> endobj 55 0 obj (The Tree Reduction Theorem) endobj 56 0 obj << /S /GoTo /D (subsubsection.4.3.1) >> endobj 59 0 obj (Example) endobj 60 0 obj << /S /GoTo /D (subsection.4.4) >> endobj 63 0 obj (The Tree Reduction Method) endobj 64 0 obj << /S /GoTo /D (subsubsection.4.4.1) >> endobj 67 0 obj (Example Continued) endobj 68 0 obj << /S /GoTo /D (subsection.4.5) >> endobj 71 0 obj (The Tree Expansion Method) endobj 72 0 obj << /S /GoTo /D (subsection.4.6) >> endobj 75 0 obj (The Tree Reduction/Expansion Method for Solving the OPF Problem) endobj 76 0 obj << /S /GoTo /D (subsection.4.7) >> endobj 79 0 obj (Implementation of the Tree Reduction Method) endobj 80 0 obj << /S /GoTo /D (subsection.4.8) >> endobj 83 0 obj (Eliminating the invertibility assumption) endobj 84 0 obj << /S /GoTo /D (subsubsection.4.8.1) >> endobj 87 0 obj (Implementation) endobj 88 0 obj << /S /GoTo /D (section.5) >> endobj 91 0 obj (Proof of the Tree Reduction Theorem) endobj 92 0 obj << /S /GoTo /D (section.6) >> endobj 95 0 obj (Numerical experiments) endobj 96 0 obj << /S /GoTo /D (subsection.6.1) >> endobj 99 0 obj (Accuracy) endobj 100 0 obj << /S /GoTo /D (subsection.6.2) >> endobj 103 0 obj (Reliability) endobj 104 0 obj << /S /GoTo /D (subsection.6.3) >> endobj 107 0 obj (CRN set size and computational time) endobj 108 0 obj << /S /GoTo /D [109 0 R /Fit] >> endobj 126 0 obj << /Length 4007 /Filter /FlateDecode >> stream xڭZY6~#U5bH\NY;Ԧ