A polynomial local optimality condition for the concave piecewise linear network flow problem

This paper studies the local optimality condition for the widely applied concave piecewise linear network flow problem (CPLNFP). Traditionally, for CPLNFP the complexity of checking the local optimality condition is exponentially related to the number of active arcs (i.e., arcs in which the flow is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:AIMS mathematics Jg. 6; H. 3; S. 2094 - 2113
Hauptverfasser: Nie, Zhibin, Wang, Shuning, Huang, Xiaolin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: AIMS Press 01.01.2021
Schlagworte:
concave piecewise linear
local optimality condition
network flow problem
nonlinear programming
polynomial complexity
ISSN:2473-6988, 2473-6988
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper studies the local optimality condition for the widely applied concave piecewise linear network flow problem (CPLNFP). Traditionally, for CPLNFP the complexity of checking the local optimality condition is exponentially related to the number of active arcs (i.e., arcs in which the flow is at the breakpoints). When the scale of CPLNFP is large, even local optimality is unverifiable and the corresponding local algorithms are inefficient. To overcome this shortcoming, a new local optimality condition is given. This new condition is based on the concavity and piecewise linearity of the cost function and makes full use of the network structure. It is proven that the complexity of the new condition is polynomial. Therefore, using the new condition to verify the local optimality is far superior to using the traditional condition, especially when there are many active arcs.
AbstractList This paper studies the local optimality condition for the widely applied concave piecewise linear network flow problem (CPLNFP). Traditionally, for CPLNFP the complexity of checking the local optimality condition is exponentially related to the number of active arcs (i.e., arcs in which the flow is at the breakpoints). When the scale of CPLNFP is large, even local optimality is unverifiable and the corresponding local algorithms are inefficient. To overcome this shortcoming, a new local optimality condition is given. This new condition is based on the concavity and piecewise linearity of the cost function and makes full use of the network structure. It is proven that the complexity of the new condition is polynomial. Therefore, using the new condition to verify the local optimality is far superior to using the traditional condition, especially when there are many active arcs.
Author Huang, Xiaolin
Nie, Zhibin
Wang, Shuning
Author_xml – sequence: 1
  givenname: Zhibin
  surname: Nie
  fullname: Nie, Zhibin
– sequence: 2
  givenname: Shuning
  surname: Wang
  fullname: Wang, Shuning
– sequence: 3
  givenname: Xiaolin
  surname: Huang
  fullname: Huang, Xiaolin
BookMark eNpNkNtKAzEQhoNUsNbe-QB5ALfmsNlNLkvxUCh4o5cSssnEpqabJbtY-vZutYg3M8PPz8fwXaNJm1pA6JaSBVe8vN-bYbtghFHK5AWasrLmRaWknPy7r9C873eEjC1Wsrqcovcl7lI8tmkfTMQx2XGmbgh7E8NwxDa1LgwhtdinjIctnBJrvgB3ASwcQg84hhZMxi0Mh5Q_sY_pgLucmgj7G3TpTexhft4z9Pb48Lp6LjYvT-vVclNYzsVQWGe9841kVojKW66MEqoSHqRU1FBbQtUw4mvhuDO1JYQ3hEjhrTQ1ocD4DK1_uS6Zne7y-H4-6mSC_glS_tAmD8FG0FRYsM4oXzMoFaNN7ZpSGM_AC8kqP7Luflk2p77P4P94lOiTaX0yrc-m-TcE63XC
Cites_doi 10.1007/BF01581171
10.1007/s10878-007-9080-6
10.1142/9789812798190_0009
10.1007/s11590-016-0998-4
10.1287/ijoc.1070.0237
10.1007/s10898-010-9548-2
10.1002/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E
10.1007/s10479-004-5022-1
10.1016/j.cor.2011.10.017
10.1016/j.ejor.2014.12.039
10.26599/TST.2018.9010089
10.1080/10556788.2014.895828
10.1007/978-3-540-25960-2_18
10.1155/2012/463976
10.1016/j.ejor.2016.11.024
10.1287/mnsc.20.5.814
10.4236/jssm.2014.71002
10.3934/jimo.2007.3.71
ContentType Journal Article
CorporateAuthor School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, 200240, P. R. China
Department of Automation, Tsinghua University, Beijing, 100084, P. R. China
CorporateAuthor_xml – name: Department of Automation, Tsinghua University, Beijing, 100084, P. R. China
– name: School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, 200240, P. R. China
DBID AAYXX
CITATION
DOA
DOI 10.3934/math.2021128
DatabaseName CrossRef
DOAJ Directory of Open Access Journal Collection
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2473-6988
EndPage 2113
ExternalDocumentID oai_doaj_org_article_15cecda9f72e4921b7db45af2ef5826f
10_3934_math_2021128
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
AMVHM
BCNDV
CITATION
EBS
FRJ
GROUPED_DOAJ
IAO
ITC
M~E
OK1
RAN
ID FETCH-LOGICAL-c335t-cdcfdfb82c556fc39a95965fe8891a1c4e6b20f75d3da7c003b0085fc8a701e23
IEDL.DBID DOA
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000672551400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2473-6988
IngestDate Fri Oct 03 12:51:54 EDT 2025
Sat Nov 29 06:04:16 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c335t-cdcfdfb82c556fc39a95965fe8891a1c4e6b20f75d3da7c003b0085fc8a701e23
OpenAccessLink https://doaj.org/article/15cecda9f72e4921b7db45af2ef5826f
PageCount 20
ParticipantIDs doaj_primary_oai_doaj_org_article_15cecda9f72e4921b7db45af2ef5826f
crossref_primary_10_3934_math_2021128
PublicationCentury 2000
PublicationDate 2021-01-01
PublicationDateYYYYMMDD 2021-01-01
PublicationDate_xml – month: 01
  year: 2021
  text: 2021-01-01
  day: 01
PublicationDecade 2020
PublicationTitle AIMS mathematics
PublicationYear 2021
Publisher AIMS Press
Publisher_xml – name: AIMS Press
References key-10.3934/math.2021128-6
key-10.3934/math.2021128-16
key-10.3934/math.2021128-7
key-10.3934/math.2021128-15
key-10.3934/math.2021128-8
key-10.3934/math.2021128-14
key-10.3934/math.2021128-9
key-10.3934/math.2021128-13
key-10.3934/math.2021128-2
key-10.3934/math.2021128-12
key-10.3934/math.2021128-3
key-10.3934/math.2021128-11
key-10.3934/math.2021128-4
key-10.3934/math.2021128-10
key-10.3934/math.2021128-5
key-10.3934/math.2021128-19
key-10.3934/math.2021128-18
key-10.3934/math.2021128-17
key-10.3934/math.2021128-1
References_xml – ident: key-10.3934/math.2021128-13
  doi: 10.1007/BF01581171
– ident: key-10.3934/math.2021128-2
  doi: 10.1007/s10878-007-9080-6
– ident: key-10.3934/math.2021128-6
  doi: 10.1142/9789812798190_0009
– ident: key-10.3934/math.2021128-7
  doi: 10.1007/s11590-016-0998-4
– ident: key-10.3934/math.2021128-3
  doi: 10.1287/ijoc.1070.0237
– ident: key-10.3934/math.2021128-9
  doi: 10.1007/s10898-010-9548-2
– ident: key-10.3934/math.2021128-11
  doi: 10.1002/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E
– ident: key-10.3934/math.2021128-16
– ident: key-10.3934/math.2021128-14
  doi: 10.1007/s10479-004-5022-1
– ident: key-10.3934/math.2021128-15
  doi: 10.1016/j.cor.2011.10.017
– ident: key-10.3934/math.2021128-4
  doi: 10.1016/j.ejor.2014.12.039
– ident: key-10.3934/math.2021128-10
  doi: 10.26599/TST.2018.9010089
– ident: key-10.3934/math.2021128-17
  doi: 10.1080/10556788.2014.895828
– ident: key-10.3934/math.2021128-5
  doi: 10.1007/978-3-540-25960-2_18
– ident: key-10.3934/math.2021128-1
  doi: 10.1155/2012/463976
– ident: key-10.3934/math.2021128-18
  doi: 10.1016/j.ejor.2016.11.024
– ident: key-10.3934/math.2021128-19
  doi: 10.1287/mnsc.20.5.814
– ident: key-10.3934/math.2021128-8
  doi: 10.4236/jssm.2014.71002
– ident: key-10.3934/math.2021128-12
  doi: 10.3934/jimo.2007.3.71
SSID ssj0002124274
Score 2.1294353
Snippet This paper studies the local optimality condition for the widely applied concave piecewise linear network flow problem (CPLNFP). Traditionally, for CPLNFP the...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 2094
SubjectTerms concave piecewise linear
local optimality condition
network flow problem
nonlinear programming
polynomial complexity
Title A polynomial local optimality condition for the concave piecewise linear network flow problem
URI https://doaj.org/article/15cecda9f72e4921b7db45af2ef5826f
Volume 6
WOSCitedRecordID wos000672551400004&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2473-6988
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002124274
  issn: 2473-6988
  databaseCode: DOA
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2473-6988
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002124274
  issn: 2473-6988
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQAD4inKSx5gjBrHdmyPBbViacUAUhcU-SlVKk3VllYs_HbOSaiysbBksJzI-i6--z7ncofQvU5zZaQwifKpSVieqUTqeCLGiIWQYoFChKrZhBiP5WSiXlqtvmJOWF0euAauR7j11mkVROaZyogRzjCuQ-YDB2ocovdNhWqJqeiDwSEz0Ft1pjtVlPWA_8VvD6B3YuP1VgxqleqvYsrwGB01ZBD360WcoD0_P0WHo10l1dUZeu_jRTn7ij8Pw8wq8uAStvlHxZ8xqFlXJV1hIJ8Y7osjVm88Xky99dvpyuNIJPUSz-uEbxxm5RY3fWTO0dtw8Pr0nDQtERJLKV8n1tnggpGZ5QCipUorrnIevJSKaGKZz02WBsEddVpY2LImkqpgpRYp8Rm9QJ15OfeXCDslqTE-94IrRkAIMxJSFpQOQljhVBc9_IJULOrKFwUohghmEcEsGjC76DEiuJsT61VXA2DForFi8ZcVr_7jIdfoIK6pPiC5QZ318tPfon27WU9Xy7vqBYHr6HvwA4yUxVY
linkProvider Directory of Open Access Journals
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=A+polynomial+local+optimality+condition+for+the+concave+piecewise+linear+network+flow+problem&rft.jtitle=AIMS+mathematics&rft.au=Zhibin+Nie&rft.au=Shuning+Wang&rft.au=Xiaolin+Huang&rft.date=2021-01-01&rft.pub=AIMS+Press&rft.eissn=2473-6988&rft.volume=6&rft.issue=3&rft.spage=2094&rft.epage=2113&rft_id=info:doi/10.3934%2Fmath.2021128&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_15cecda9f72e4921b7db45af2ef5826f
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2473-6988&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2473-6988&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2473-6988&client=summon