Fast SDP Relaxation of the Optimal Power Flow Using the Line-Wise Model for Representing Meshed Transmission Networks
In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem. The proposed formulation utilizes the Line-Wise Model (LWM) to represent meshed transmission networks. This allows the constraints of the proposed formulation to mostly depend on diag...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on power systems Jg. 38; H. 4; S. 3814 - 3827 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
IEEE
01.07.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0885-8950, 1558-0679 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem. The proposed formulation utilizes the Line-Wise Model (LWM) to represent meshed transmission networks. This allows the constraints of the proposed formulation to mostly depend on diagonal elements of the voltages' Hermitian <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrix in contrast to the Bus Injection Model (BIM) where constraints heavily utilize its off-diagonal elements. Test cases with bus sizes of 3 to 9241 were considered and chordal sparsity was exploited for them. Obtained results show that the proposed SDP-LW OPF formulation manages to provide solutions of similar or better quality for most test cases that belong to the Typical and Congested (TYP and API) Operating conditions. Furthermore, the proposed SDP-LW OPF formulation manages to reduce the solver's computational time for most of large-scale test cases with reductions up to 80.298%. Results analysis shows that reductions in the solver's computational time upon using the proposed SDP-LW OPF formulation are affected by its ability to significantly reduce constraints with off-diagonal elements of the <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrix without drastically increasing constraints with diagonal elements of the <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrix. Furthermore, the percentage of large sized cliques is found to affect the obtained reductions through its influence over the number of needed linking constraints for relating the elements of the <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrices of decomposed cliques. |
|---|---|
| AbstractList | In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem. The proposed formulation utilizes the Line-Wise Model (LWM) to represent meshed transmission networks. This allows the constraints of the proposed formulation to mostly depend on diagonal elements of the voltages' Hermitian <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrix in contrast to the Bus Injection Model (BIM) where constraints heavily utilize its off-diagonal elements. Test cases with bus sizes of 3 to 9241 were considered and chordal sparsity was exploited for them. Obtained results show that the proposed SDP-LW OPF formulation manages to provide solutions of similar or better quality for most test cases that belong to the Typical and Congested (TYP and API) Operating conditions. Furthermore, the proposed SDP-LW OPF formulation manages to reduce the solver's computational time for most of large-scale test cases with reductions up to 80.298%. Results analysis shows that reductions in the solver's computational time upon using the proposed SDP-LW OPF formulation are affected by its ability to significantly reduce constraints with off-diagonal elements of the <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrix without drastically increasing constraints with diagonal elements of the <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrix. Furthermore, the percentage of large sized cliques is found to affect the obtained reductions through its influence over the number of needed linking constraints for relating the elements of the <inline-formula><tex-math notation="LaTeX">{\boldsymbol{W}}</tex-math></inline-formula> matrices of decomposed cliques. In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem. The proposed formulation utilizes the Line-Wise Model (LWM) to represent meshed transmission networks. This allows the constraints of the proposed formulation to mostly depend on diagonal elements of the voltages’ Hermitian [Formula Omitted] matrix in contrast to the Bus Injection Model (BIM) where constraints heavily utilize its off-diagonal elements. Test cases with bus sizes of 3 to 9241 were considered and chordal sparsity was exploited for them. Obtained results show that the proposed SDP-LW OPF formulation manages to provide solutions of similar or better quality for most test cases that belong to the Typical and Congested (TYP and API) Operating conditions. Furthermore, the proposed SDP-LW OPF formulation manages to reduce the solver's computational time for most of large-scale test cases with reductions up to 80.298%. Results analysis shows that reductions in the solver's computational time upon using the proposed SDP-LW OPF formulation are affected by its ability to significantly reduce constraints with off-diagonal elements of the [Formula Omitted] matrix without drastically increasing constraints with diagonal elements of the [Formula Omitted] matrix. Furthermore, the percentage of large sized cliques is found to affect the obtained reductions through its influence over the number of needed linking constraints for relating the elements of the [Formula Omitted] matrices of decomposed cliques. |
| Author | Aldik, Abdel Rahman Venkatesh, Bala |
| Author_xml | – sequence: 1 givenname: Abdel Rahman orcidid: 0000-0003-2249-7700 surname: Aldik fullname: Aldik, Abdel Rahman email: aaldik@ryerson.ca organization: Department of Electrical, Computer and Biomedical Engineering and Centre for Urban Energy, Ryerson University, Toronto, Ontario, Canada – sequence: 2 givenname: Bala orcidid: 0000-0002-0392-6269 surname: Venkatesh fullname: Venkatesh, Bala email: bala@ryerson.ca organization: Department of Electrical, Computer and Biomedical Engineering and Centre for Urban Energy, Ryerson University, Toronto, Ontario, Canada |
| BookMark | eNp9kMtOwzAQRS0EEuXxA7CxxDpl7NiJvURAAalABa26jEwyAZcQF9tV4e9JH2LBgtUs7j13pHNAdlvXIiEnDPqMgT4fj6ZPz30OnPdTDqBz2CE9JqVKIMv1LumBUjJRWsI-OQhhBgBZF_TIYmBCpM9XI_qEjfky0bqWuprGN6SP82g_TENHbomeDhq3pJNg29d1OLQtJlMbkN67ChtaO99NzD0GbOOqdI_hDSs69qYNHzaE1fADxqXz7-GI7NWmCXi8vYdkMrgeX94mw8ebu8uLYVJyLWMiGRMmM6IWqLO0FGUFAlSlVJ5WPM-kEVi9gJa8FlDlUtTclC-pAlmldcYwTQ_J2WZ37t3nAkMsZm7h2-5lwRVXAKKz0LXUplV6F4LHuihtXJuI3timYFCsJBdrycVKcrGV3KH8Dzr3nTP__T90uoEsIv4CWmWSM53-ADi8irk |
| CODEN | ITPSEG |
| CitedBy_id | crossref_primary_10_1109_TIA_2023_3320114 crossref_primary_10_2478_amns_2024_3088 crossref_primary_10_1007_s11081_024_09891_7 crossref_primary_10_1016_j_epsr_2023_109419 crossref_primary_10_1109_TIA_2024_3371428 crossref_primary_10_1016_j_epsr_2025_112268 crossref_primary_10_1016_j_est_2024_111913 crossref_primary_10_1109_TPWRS_2024_3442088 |
| Cites_doi | 10.1016/j.ejor.2020.01.034 10.1007/s10589-021-00339-7 10.1080/0740817X.2016.1189626 10.1109/TPAS.1982.317057 10.1109/PESGM48719.2022.9916662 10.1109/TPWRS.2002.1007886 10.1109/TCNS.2017.2774008 10.1109/CACSD.2004.1393890 10.1093/oso/9780198538561.003.0003 10.1016/j.arcontrol.2021.09.001 10.1109/TPWRS.2019.2912889 10.1016/j.ijepes.2007.12.003 10.1109/TPWRS.2013.2255317 10.1109/TPWRS.2016.2634586 10.1109/PESGM40551.2019.8973879 10.1109/TPWRS.2018.2848965 10.1109/TPWRS.2010.2051168 10.1109/TPWRS.2013.2258044 10.1109/PTC.2019.8810418 10.1016/j.epsr.2020.106688 10.1109/ICSMC.1989.71294 10.1016/j.epsr.2020.106965 10.1016/j.ejor.2018.10.035 10.1007/s10107-004-0559-y 10.1109/TPAS.1984.318568 10.1016/j.epsr.2016.02.008 10.1109/PSCC.2016.7540908 10.1137/130926924 10.1049/iet-gtd.2018.5452 10.1016/j.epsr.2019.106169 10.1109/TPAS.1968.292150 10.1049/iet-gtd.2019.0331 10.1007/s00245-007-9030-9 10.1017/CBO9781139924672 10.1049/iet-gtd.2019.1841 10.1561/9781680835410 10.1016/j.ijepes.2019.01.005 10.1109/PESGM46819.2021.9637865 10.1109/TPWRS.2017.2787752 10.1109/TPWRS.2011.2170772 10.1109/TPAS.1974.293972 10.1016/j.epsr.2020.106480 10.1109/TPWRS.2019.2950392 10.1109/TPWRS.2015.2407363 10.1016/S0142-0615(01)00067-9 10.1109/TPWRS.2006.879234 10.1109/TPWRS.2013.2294479 10.1109/TPWRS.2011.2160974 10.1016/j.epsr.2018.07.026 10.1007/s12532-016-0112-z 10.1109/Allerton.2011.6120344 10.1016/j.epsr.2019.02.020 10.1137/S1052623400366218 10.1109/TPWRS.2018.2881254 10.1016/j.rser.2016.12.102 10.1007/s11081-019-09427-4 10.1080/10408340500526766 10.1109/TSG.2018.2866068 10.1109/TII.2019.2918143 10.1109/TPWRS.2020.3044501 10.1109/CDC.2018.8619478 10.1109/TPWRS.2022.3183549 10.1109/PESGM.2012.6345536 10.1109/TPWRS.2015.2463111 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 7TB 8FD FR3 KR7 L7M |
| DOI | 10.1109/TPWRS.2022.3200970 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database Civil Engineering Abstracts Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Mechanical & Transportation Engineering Abstracts Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Civil Engineering Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0679 |
| EndPage | 3827 |
| ExternalDocumentID | 10_1109_TPWRS_2022_3200970 9865219 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Mitacs and Natural Science and Engineering Research Council of Canada |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 VJK AAYXX CITATION 7SP 7TB 8FD FR3 KR7 L7M |
| ID | FETCH-LOGICAL-c295t-5114a6a4f4e963c4cd0408d8873d2765a4edb0952f40d754f2acb3805d3f61e33 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001017406700065&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0885-8950 |
| IngestDate | Fri Jul 25 10:25:49 EDT 2025 Tue Nov 18 22:18:27 EST 2025 Sat Nov 29 02:52:29 EST 2025 Wed Aug 27 02:50:20 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c295t-5114a6a4f4e963c4cd0408d8873d2765a4edb0952f40d754f2acb3805d3f61e33 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0392-6269 0000-0003-2249-7700 |
| PQID | 2828004667 |
| PQPubID | 85441 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_9865219 crossref_primary_10_1109_TPWRS_2022_3200970 crossref_citationtrail_10_1109_TPWRS_2022_3200970 proquest_journals_2828004667 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-07-01 |
| PublicationDateYYYYMMDD | 2023-07-01 |
| PublicationDate_xml | – month: 07 year: 2023 text: 2023-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on power systems |
| PublicationTitleAbbrev | TPWRS |
| PublicationYear | 2023 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref57 ref12 ref56 ref15 ref59 ref14 ref58 ref53 ref52 ref11 ref55 ref10 ref54 mak (ref21) 2018 ref17 ref16 ref19 ref18 weiss (ref74) 2016 ref50 park (ref27) 2018 ref46 (ref42) 2021 ref45 ref48 ref47 josz (ref51) 2016 ref44 ref43 gondzio (ref41) 1996 cain (ref5) 2012 (ref70) 2021 ref49 ref8 ref7 ref9 ref4 ref3 ref40 carpentier (ref2) 1962; 3 coffrin (ref62) 2018 ref35 ref34 ref37 ref36 ref31 ref75 stott (ref68) 2012 ref30 ref33 ref77 ref32 ref76 babaeinejadsarookolaee (ref65) 2021 ref1 ref39 ref38 gopinath (ref6) 2019 (ref64) 2021 ref71 ref73 ref72 ref24 ref23 ref67 ref26 ref25 ref69 ref20 ref63 ref22 ref66 ref28 ref29 ref60 ref61 |
| References_xml | – year: 2019 ident: ref6 article-title: Towards closing the ACOPF chapter – year: 2018 ident: ref21 article-title: Phase transitions for optimality gaps in optimal power flows a study on the french transmission network – ident: ref20 doi: 10.1016/j.ejor.2020.01.034 – ident: ref71 doi: 10.1007/s10589-021-00339-7 – ident: ref16 doi: 10.1080/0740817X.2016.1189626 – ident: ref9 doi: 10.1109/TPAS.1982.317057 – ident: ref76 doi: 10.1109/PESGM48719.2022.9916662 – ident: ref13 doi: 10.1109/TPWRS.2002.1007886 – ident: ref37 doi: 10.1109/TCNS.2017.2774008 – ident: ref63 doi: 10.1109/CACSD.2004.1393890 – start-page: 103 year: 1996 ident: ref41 article-title: A computational view of interior point methods for linear programming publication-title: Advances in Linear and Integer Programming doi: 10.1093/oso/9780198538561.003.0003 – ident: ref73 doi: 10.1016/j.arcontrol.2021.09.001 – ident: ref49 doi: 10.1109/TPWRS.2019.2912889 – ident: ref24 doi: 10.1016/j.ijepes.2007.12.003 – ident: ref59 doi: 10.1109/TPWRS.2013.2255317 – ident: ref61 doi: 10.1109/TPWRS.2016.2634586 – ident: ref35 doi: 10.1109/PESGM40551.2019.8973879 – ident: ref48 doi: 10.1109/TPWRS.2018.2848965 – ident: ref58 doi: 10.1109/TPWRS.2010.2051168 – year: 2021 ident: ref65 article-title: The power grid library for benchmarking AC optimal power flow algorithms – ident: ref46 doi: 10.1109/TPWRS.2013.2258044 – ident: ref31 doi: 10.1109/PTC.2019.8810418 – ident: ref77 doi: 10.1016/j.epsr.2020.106688 – ident: ref11 doi: 10.1109/ICSMC.1989.71294 – ident: ref34 doi: 10.1016/j.epsr.2020.106965 – ident: ref32 doi: 10.1016/j.ejor.2018.10.035 – year: 2016 ident: ref51 article-title: Moment/Sum-of-Squares hierarchy for complex polynomial optimization – ident: ref66 doi: 10.1007/s10107-004-0559-y – year: 2012 ident: ref68 publication-title: Optimal Power Flow Basic Requirements for Real-life Problems and Their Solutions – start-page: 36 year: 2012 ident: ref5 publication-title: History of optimal power flow and formulations - optimal Power flow paper 1 – ident: ref10 doi: 10.1109/TPAS.1984.318568 – ident: ref15 doi: 10.1016/j.epsr.2016.02.008 – ident: ref36 doi: 10.1109/PSCC.2016.7540908 – ident: ref47 doi: 10.1137/130926924 – ident: ref54 doi: 10.1049/iet-gtd.2018.5452 – ident: ref69 doi: 10.1016/j.epsr.2019.106169 – ident: ref7 doi: 10.1109/TPAS.1968.292150 – ident: ref33 doi: 10.1049/iet-gtd.2019.0331 – ident: ref40 doi: 10.1007/s00245-007-9030-9 – ident: ref1 doi: 10.1017/CBO9781139924672 – ident: ref56 doi: 10.1049/iet-gtd.2019.1841 – ident: ref19 doi: 10.1561/9781680835410 – ident: ref55 doi: 10.1016/j.ijepes.2019.01.005 – ident: ref50 doi: 10.1109/PESGM46819.2021.9637865 – ident: ref53 doi: 10.1109/TPWRS.2017.2787752 – ident: ref44 doi: 10.1109/TPWRS.2011.2170772 – ident: ref8 doi: 10.1109/TPAS.1974.293972 – ident: ref67 doi: 10.1016/j.epsr.2020.106480 – year: 2021 ident: ref42 article-title: 9.3 Computing a sparse cholesky factorization - MOSEK optimizer API for java 9.3.10 – year: 2016 ident: ref74 publication-title: Introductory Statistics – year: 2021 ident: ref64 article-title: MOSEK optimization toolbox for MATLAB 9.0.105 - MOSEK optimization toolbox for MATLAB 9.0.105 – ident: ref26 doi: 10.1109/TPWRS.2019.2950392 – year: 2021 ident: ref70 article-title: 12.3 Semidefinite optimization - MOSEK optimization toolbox for MATLAB 9.3.11 – ident: ref4 doi: 10.1109/TPWRS.2015.2407363 – volume: 3 start-page: 431 year: 1962 ident: ref2 article-title: Contribution a.'l'etude du dispatching economique publication-title: Bulletin de la Societe Francaise des Electriciens – ident: ref12 doi: 10.1016/S0142-0615(01)00067-9 – ident: ref18 doi: 10.1109/TPWRS.2006.879234 – ident: ref38 doi: 10.1109/TPWRS.2013.2294479 – ident: ref3 doi: 10.1109/TPWRS.2011.2160974 – ident: ref28 doi: 10.1016/j.epsr.2018.07.026 – ident: ref23 doi: 10.1007/s12532-016-0112-z – ident: ref60 doi: 10.1109/Allerton.2011.6120344 – year: 2018 ident: ref27 article-title: Examining the rank of Semi-definite programming for power system state estimation – ident: ref52 doi: 10.1016/j.epsr.2019.02.020 – ident: ref43 doi: 10.1137/S1052623400366218 – ident: ref14 doi: 10.1109/TPWRS.2018.2881254 – ident: ref17 doi: 10.1016/j.rser.2016.12.102 – ident: ref45 doi: 10.1007/s11081-019-09427-4 – ident: ref75 doi: 10.1080/10408340500526766 – ident: ref30 doi: 10.1109/TSG.2018.2866068 – ident: ref29 doi: 10.1109/TII.2019.2918143 – ident: ref39 doi: 10.1109/TPWRS.2020.3044501 – ident: ref72 doi: 10.1109/CDC.2018.8619478 – ident: ref57 doi: 10.1109/TPWRS.2022.3183549 – ident: ref25 doi: 10.1109/PESGM.2012.6345536 – ident: ref22 doi: 10.1109/TPWRS.2015.2463111 – year: 2018 ident: ref62 article-title: PowerModels.jl: An open-source framework for exploring power flow formulations |
| SSID | ssj0006679 |
| Score | 2.4792914 |
| Snippet | In this paper, we propose a novel Semidefinite Programming (SDP) relaxation of the Optimal Power Flow (OPF) problem. The proposed formulation utilizes the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 3814 |
| SubjectTerms | Computational efficiency Computing time Constraint modelling Convex relaxations Generators Load flow Mathematical models Matrix decomposition optimal power flow Optimization Power flow Reactive power semi- definite programming Semidefinite programming Solvers |
| Title | Fast SDP Relaxation of the Optimal Power Flow Using the Line-Wise Model for Representing Meshed Transmission Networks |
| URI | https://ieeexplore.ieee.org/document/9865219 https://www.proquest.com/docview/2828004667 |
| Volume | 38 |
| WOSCitedRecordID | wos001017406700065&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0679 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006679 issn: 0885-8950 databaseCode: RIE dateStart: 19860101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB60eNCDb7FaJQdvGl2zSTY5ilo8aC2-b0s2DyzUVtxW_fkm2W0RFMHbwmaWsF8yj2RmPoA94WdHDE-wE5piqi3HgiuOFS-0LqiTMtZWPVxmnY54epLdGTiY1sJYa2PymT0Mj_Eu3wz1OByVHUnBvbWRszCbZbyq1ZpqXc6rvnpCMCwkSyYFMok8uus-3tz6UJCQwzRcBgRi4m9GKLKq_FDF0b60l_43s2VYrP1IdFIBvwIzdrAKC9-6C67BuK3KEbo966KQ8fYZIUBDh7zLh669pnjx8t1Akoba_eEHiskD8aWPTy1-7JUWBaa0PvJ-rf_Ea1WoFAZd2fLZGhTtnF8n4cANdap88nId7tvnd6cXuGZZwJpINsLe46KKK-qo9ZtRU238vhbGK5_UkIwzRa0pvCNGHE1MxqgjShepSJhJHT-2aboBjcFwYDcBMUGygmpiGPMwKytVUpBCO6cKoxxlTTie_PZc1y3IAxNGP4-hSCLzCFUeoMprqJqwP5V5rRpw_Dl6LYAzHVnj0oTWBN283qNlHoLNcDzAs63fpbZhPpDLV8m5LWiM3sZ2B-b0-6hXvu3G5fcF6GHZTw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT-MwEB6xgLRw4I0oj10fuC2G4NiOfURAxWpLqaA8bpHjh0AqLSIt8POxnbRCWoTELVI8kZXPnoc9Mx_ArvCzI4Yn2AlNMdWWY8EVx4oXWhfUSRlrq25aWbst7u5kZwr2JrUw1tqYfGb3w2O8yzcDPQpHZQdScG9t5A-YCcxZdbXWRO9yXnXWE4JhIVkyLpFJ5EG3c3t55YNBQvbTcB0QqIk_mKHIq_KfMo4Wprn4vbktwULtSaKjCvplmLL9FZj_0F9wFUZNVQ7R1UkHhZy3twgCGjjknT504XXFo5fvBJo01OwNXlFMH4gvfYRq8e1DaVHgSush79n6TzxVpUph0Lkt761B0dL5lRKO3FC7yigv1-C6edo9PsM1zwLWRLIh9j4XVVxRR63fjppq43e2MF79pIZknClqTeFdMeJoYjJGHVG6SEXCTOr4oU3TdZjuD_p2AxATJCuoJoYxD7SyUiUFKbRzqjDKUdaAw_Fvz3XdhDxwYfTyGIwkMo9Q5QGqvIaqAX8mMk9VC44vR68GcCYja1wasD1GN693aZmHcDMcEPBs83Op3_DzrHveylt_2_-2YC5QzVeputswPXwe2R2Y1S_Dh_L5V1yK72GD3Jg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fast+SDP+Relaxation+of+the+Optimal+Power+Flow+Using+the+Line-Wise+Model+for+Representing+Meshed+Transmission+Networks&rft.jtitle=IEEE+transactions+on+power+systems&rft.au=Abdel+Rahman+Aldik&rft.au=Venkatesh%2C+Bala&rft.date=2023-07-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0885-8950&rft.eissn=1558-0679&rft.volume=38&rft.issue=4&rft.spage=3814&rft_id=info:doi/10.1109%2FTPWRS.2022.3200970&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0885-8950&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0885-8950&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0885-8950&client=summon |