Stochastic transportation problems and other newtork related convex problems

Leon Cooper and Larry J. Leblanc

Naval Research Logistics Quarterly, 1977, vol. 24, issue 2, 327-337

Abstract: A class of convex programming problems with network type constraints is addressed and an algorithm for obtaining the optimal solution is described. The stochastic transportation problem (minimize shipping costs plus expected holding and shortage costs at demand points subject to limitations on supply) is shown to be amenable to the solution technique presented. Network problems whose objective function is non‐separable and network problems with side constraints are also shown to be solvable by the algorithm. Several large stochastic transportation problems with up to 15,000 variables and non‐negativity constraints and 50 supply constraints are solved.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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

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:24:y:1977:i:2:p:327-337

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