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...

Full description

Saved in:

Bibliographic Details
Published in:	AIMS mathematics Vol. 6; no. 3; pp. 2094 - 2113
Main Authors:	Nie, Zhibin, Wang, Shuning, Huang, Xiaolin
Format:	Journal Article
Language:	English
Published:	AIMS Press 01.01.2021
Subjects:	concave piecewise linear local optimality condition network flow problem nonlinear programming polynomial complexity
ISSN:	2473-6988, 2473-6988
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!