An algorithm for solving the transportation problem when the shipping cost over each route is convex

1 March 1959

journal article
research article
Published by Wiley in Naval Research Logistics Quarterly

Vol. 6 (1) , 43-56
https://doi.org/10.1002/nav.3800060106

Abstract

An algorithm is presented for solving the transportation problem when the shipping cost over each route is a convex function of the number of units shipped by this route.The algorithm can also be used when the shipping costs are linear, whether or not there are capacity restrictions on the number of units that may be shipped over each route. But it does not skem to be any better than other standard methods for these problems, such as those given by Ford and Fulkerson [6], [7].

Keywords

This publication has 7 references indexed in Scilit:

Outline of an algorithm for integer solutions to linear programs
Bulletin of the American Mathematical Society, 1958
A primal‐dual algorithm for the capacitated Hitchcock problem
Naval Research Logistics Quarterly, 1957
On the Solution of Discrete Programming Problems
Econometrica, 1957
The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand
Management Science, 1956
Solving the Transportation Problem
Management Science, 1956
On Minimizing a Convex Function Subject to Linear Inequalities
Journal of the Royal Statistical Society Series B: Statistical Methodology, 1955
Linear Programming under Uncertainty
Management Science, 1955