Article contents
Separable convexificationand DCA techniques for capacityand flow assignment problems
Published online by Cambridge University Press: 15 August 2002
Abstract
We study a continuous version of the capacity and flow assignment problem(CFA) where the design cost is combined with an average delay measureto yield a non convex objective function coupled with multicommodity flowconstraints. A separable convexification of each arc cost function is proposedto obtain approximate feasible solutions within easily computable gaps fromoptimality. On the other hand, DC (difference of convex functions) programming can be usedto compute accurate upper bounds and reduce the gap.The technique is shown to be effective when topology is assumedfixed and capacity expansion on some arcs is considered.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2001
References
- 3
- Cited by