Local optimality conditions for multicommodity flow problems with separable piecewise convex costs

Authors:
P. Mahey;M. C. De Souza
Affiliations:
Laboratoire LIMOS, CNRS-UMR6158 and Université Blaise Pascal, Clermont-Ferrand, France;Departamento de Engenharia de Produção, Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
Venue:
Operations Research Letters
Year:
2007

Citing 3
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

SIAM Journal on Computing
Bounds for global optimization of capacity expansion and flow assignment problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider here a multicommodity flow network optimization problem with non-convex but piecewise convex arc cost functions. We derive complete optimality conditions for local minima based on negative-cost cycles associated with each commodity. These conditions do not extend to the convex non-smooth case.