The minimal cost flow problem with convex costs

V. V. Menon

Naval Research Logistics Quarterly, 1965, vol. 12, issue 2, 163-172

Abstract: A new characterization of the solution to the transshipment problem where the cost of transporting along each route is a convex function of the amount shipped, is presented. The method of proof, that of using network theoretic methods, is elementary. Notion of duality, or the Kuhn‐Tucker theorem, are not used, and a “Primal” algorithm to solve the problem is outlined.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800120204

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:12:y:1965:i:2:p:163-172

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().