The interior point branch and cut method for optimal power flow

As a complex mixed integer nonlinear programming problem, optimal power flow (OPF) is hardly to be solved by strict polynomial-time algorithm. In this paper, we present an interior point branch and cut method (IPBCM) for decoupled OPF problem. We use the modern interior point algorithm to solve acti...

Full description

Saved in:
Bibliographic Details
Published in:International Conference on Power System Technology Proceedings, 2002 Vol. 1; pp. 651 - 655 vol.1
Main Authors: Ding Xiaoying, Wang Xifan, Song Yonghua, Geng Jian
Format: Conference Proceeding
Language:English
Published: IEEE 2002
Subjects:
ISBN:9780780374591, 0780374592
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract As a complex mixed integer nonlinear programming problem, optimal power flow (OPF) is hardly to be solved by strict polynomial-time algorithm. In this paper, we present an interior point branch and cut method (IPBCM) for decoupled OPF problem. We use the modern interior point algorithm to solve active power suboptimal problem because it is very efficient for nonlinear programming problem. Reactive power suboptimal problem is a mixed integer nonlinear programming problem, we use IPBCM to iteratively solve its linearizations. Compared with simplex cutting plane method, IPBCM is more efficient because of its polynomial-time characteristic. Furthermore, we discuss some important issues in the implementation of IPBCM. Numerical simulations on IEEE 14-57 buses standard test systems have shown that the proposed method is efficient in solving OPT problems for large-scale power systems.
AbstractList As a complex mixed integer nonlinear programming problem, optimal power flow (OPF) is hardly to be solved by strict polynomial-time algorithm. In this paper, we present an interior point branch and cut method (IPBCM) for decoupled OPF problem. We use the modern interior point algorithm to solve active power suboptimal problem because it is very efficient for nonlinear programming problem. Reactive power suboptimal problem is a mixed integer nonlinear programming problem, we use IPBCM to iteratively solve its linearizations. Compared with simplex cutting plane method, IPBCM is more efficient because of its polynomial-time characteristic. Furthermore, we discuss some important issues in the implementation of IPBCM. Numerical simulations on IEEE 14-57 buses standard test systems have shown that the proposed method is efficient in solving OPT problems for large-scale power systems.
Author Ding Xiaoying
Song Yonghua
Geng Jian
Wang Xifan
Author_xml – sequence: 1
  surname: Ding Xiaoying
  fullname: Ding Xiaoying
  organization: Dept. of Electr. Eng., Xi'an Jiaotong Univ., China
– sequence: 2
  surname: Wang Xifan
  fullname: Wang Xifan
– sequence: 3
  surname: Song Yonghua
  fullname: Song Yonghua
– sequence: 4
  surname: Geng Jian
  fullname: Geng Jian
BookMark eNotT9tKxDAUDKigrv0BfckPtJ5cmzyJFF0XFhSsz0uanNBKtyltZfHvLbjDwAzM4TBzSy6HNCAh9wwKxsA-7qqPz7rgALxgoITm4oJktjSwUpRSWXZNsnn-hhVSKsHNDXmqW6TdsODUpYmOabW0mdzgW-qGQP3PQo-4tCnQuOZpXLqj69e7E0409ul0R66i62fMzrohX68vdfWW79-3u-p5n3dcsiWP0SsI2gSJ6AM47ZUAaaPUEGOJXBoRmsAhKvDCGY0sWB142SimnTFWbMjD_98OEQ_jtNaYfg_nmeIPXr9KJg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICPST.2002.1053623
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 655 vol.1
ExternalDocumentID 1053623
GroupedDBID 6IE
6IK
6IL
AAJGR
AAVQY
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i241t-ffc50d68d4eecd0a6c53049f460ff7e2483dbd20f50c3a86e1d96d27b516a8893
IEDL.DBID RIE
ISBN 9780780374591
0780374592
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000180880900130&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 18:05:33 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i241t-ffc50d68d4eecd0a6c53049f460ff7e2483dbd20f50c3a86e1d96d27b516a8893
ParticipantIDs ieee_primary_1053623
PublicationCentury 2000
PublicationDate 20020000
PublicationDateYYYYMMDD 2002-01-01
PublicationDate_xml – year: 2002
  text: 20020000
PublicationDecade 2000
PublicationTitle International Conference on Power System Technology Proceedings, 2002
PublicationTitleAbbrev ICPST
PublicationYear 2002
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000445328
Score 1.312785
Snippet As a complex mixed integer nonlinear programming problem, optimal power flow (OPF) is hardly to be solved by strict polynomial-time algorithm. In this paper,...
SourceID ieee
SourceType Publisher
StartPage 651
SubjectTerms Integer linear programming
Iterative algorithms
Large-scale systems
Load flow
Numerical simulation
Optimized production technology
Polynomials
Power system simulation
Reactive power
System testing
Title The interior point branch and cut method for optimal power flow
URI https://ieeexplore.ieee.org/document/1053623
Volume 1
WOSCitedRecordID wos000180880900130&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5t8aAXH634JgePbs1unnvyUCwKUgpW6a1sXliou2XdtX_fJN1WBS_ekhBCyGNmMpP5PgCuUy_3JZaRFBmOnAVOopRpHsUSZVQRjWXwd7w-8dFITKfpuAVutrkwxpjw-cz0fTHE8nWhau8qczecOnmL26DNOVvnam39KYgQihMRXubCg6rQNGkAdjb1eJM0g9Lbx8H4eRJ-KPSbUX_RqwTtMtz_37wOQO87TQ-OtwroELRMfgT2fiAMdsGdOwbQQ0KU86KEy8IVofRcGm8wyzVUdQXXHNLQGa-wcPLjPVu4fitTQrsoVj3wMryfDB6ihjMhmjtdXEXWKoo0E5oYozTKmKI-kGYJQ9ZykxCBtdQJshQpnAlmYu32JuGSxiwTzng5Bp28yM0JgEQmRPtAo-SSWKYk5oYKqdwYMeEEnYKuX4rZcg2LMWtW4ezv5nOwG4hUgvfiAnSqsjaXYEd9VvOP8irs5Rdse5qI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmqgXH2B824NHF7vbdrd78kA0EJGQiIYb2T42kuAuWRf5-7ZlQU28eGubpmn6mJnOdL4P4Dq2cl8Q4QmeEM9Y4NSLQxV5vsAJk1QR4fwdr72o3-ejUTyowc06F0Zr7T6f6ZYtuli-yuXcusrMDWdG3pIN2GSUBniZrbX2qGBKGQm4e5tzC6vC4qCC2FnV_VXaDI5vu-3B89D9UWhV4_4iWHH65WHvfzPbh-Z3oh4arFXQAdR0dgi7PzAGG3BnDgKyoBDFJC_QLDdFJCybxhtKMoXkvERLFmlkzFeUGwnynkxNv4UuUDrNF014ebgftjtexZrgTYw2Lr00lQyrkCuqtVQ4CSWzobSUhjhNIx1QTpRQAU4ZliThofaV2Z0gEswPE27MlyOoZ3mmjwFREVBlQ40iEjQNpSCRZlxIM4ZPI4pPoGGXYjxbAmOMq1U4_bv5CrY7w6feuNftP57BjqNVcb6Mc6iXxVxfwJb8LCcfxaXb1y-sFZ3P
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%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Power+System+Technology+Proceedings%2C+2002&rft.atitle=The+interior+point+branch+and+cut+method+for+optimal+power+flow&rft.au=Ding+Xiaoying&rft.au=Wang+Xifan&rft.au=Song+Yonghua&rft.au=Geng+Jian&rft.date=2002-01-01&rft.pub=IEEE&rft.isbn=9780780374591&rft.volume=1&rft.spage=651&rft.epage=655+vol.1&rft_id=info:doi/10.1109%2FICPST.2002.1053623&rft.externalDocID=1053623
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780374591/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780374591/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780374591/sc.gif&client=summon&freeimage=true