Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Treatment of Transportation Problems by Decomposition

A. C. Williams
Journal of the Society for Industrial and Applied Mathematics
Vol. 10, No. 1 (Mar., 1962), pp. 35-48
Stable URL: http://www.jstor.org/stable/2098795
Page Count: 14
  • Subscribe ($19.50)
  • Cite this Item
A Treatment of Transportation Problems by Decomposition
Preview not available

Abstract

The "decomposition principle" of Dantzig and Wolfe \lbrack1\rbrack is applied to the solution of the Hitchcock transportation problem and to several generalizations of it. Among these generalizations are (i) the transportation problem in which the source availabilities are subject to general linear constraints, and (ii) the case in which the costs are piecewise linear convex functions. The algorithms developed, while they are of quite general applicability to the problems mentioned, are most efficient when the number of sources is small compared to the number of destinations. Our computational experience is, however, limited to the transportation problem without generalization.

Page Thumbnails

  • Thumbnail: Page 
35
    35
  • Thumbnail: Page 
36
    36
  • Thumbnail: Page 
37
    37
  • Thumbnail: Page 
38
    38
  • Thumbnail: Page 
39
    39
  • Thumbnail: Page 
40
    40
  • Thumbnail: Page 
41
    41
  • Thumbnail: Page 
42
    42
  • Thumbnail: Page 
43
    43
  • Thumbnail: Page 
44
    44
  • Thumbnail: Page 
45
    45
  • Thumbnail: Page 
46
    46
  • Thumbnail: Page 
47
    47
  • Thumbnail: Page 
48
    48