IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v14y1968i9p565-599.html
   My bibliography  Save this article

A Treatment of Transportation Problems by Primal Partition Programming

Author

Listed:
  • Michael D. Grigoriadis

    (IBM Corporation, Data Processing Division, White Plains, New York)

  • William F. Walker

    (IBM Corporation, Data Processing Division, White Plains, New York)

Abstract

J. B. Rosen's Primal Partition Programming method [Rosen, J. B. 1964. Primal partition programming for block diagonal matrices. Numerische Mathematik 6.] is applied to the classical transportation problem and to some related generalizations or extensions. Observations on the special structure of the constraint matrix result in a subproblem which may be solved by inspection, a unimodular master inverse of order m and in a considerable reduction in the number of vectors spanning the dual space of the master problem. This inverse and master problem may be replaced by a directed network of at most m(m - 1) arcs and m nodes, where m is the number of sources. Dual feasibility is maintained throughout the optimization procedure. The generalizations and extensions treated are: (i) The upper bounded transportation problem, (ii) the transportation problem in which the source availabilities are subject to some general linear constraints and, (iii) the parametric transportation problem. Programming of the method for a digital computer is quite simple and requires only integer arithmetic (except for (ii)). Computing efficiency compares quite well with the specialization of the Dantzig-Wolfe Decomposition method to transportation problems [Williams, A. C. 1962. A treatment of transportation problems by decomposition. J. Soc. Indust. Appl. Math. 10(1, March).] and other methods of solution.

Suggested Citation

  • Michael D. Grigoriadis & William F. Walker, 1968. "A Treatment of Transportation Problems by Primal Partition Programming," Management Science, INFORMS, vol. 14(9), pages 565-599, May.
    • Handle: RePEc:inm:ormnsc:v:14:y:1968:i:9:p:565-599
    DOI: 10.1287/mnsc.14.9.565
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.14.9.565
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.14.9.565?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:14:y:1968:i:9:p:565-599. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.