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

DOI10.3934/math.2021128OpenAlexW3111891390MaRDI QIDQ2146593

Shuning Wang, Zhibin Nie, Xiao Lin Huang

Publication date: 17 June 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2021128

zbMATH Keywords

nonlinear programmingnetwork flow problempolynomial complexitylocal optimality conditionconcave piecewise linear

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Transportation, logistics and supply chain management (90B06)

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Mathematical programming techniques in water network optimization
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• Discontinuous piecewise linear optimization
• A network simplex method for the budget-constrained minimum cost flow problem
• The hill detouring method for minimizing hinging hyperplanes functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
• Solving the Capacitated Local Access Network Design Problem
• Minimum-cost flow algorithms: an experimental evaluation
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
• Integer Programming and Combinatorial Optimization

This page was built for publication: A polynomial local optimality condition for the concave piecewise linear network flow problem