IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v25y1978i4p681-695.html
   My bibliography  Save this article

A streamlined simplex approach to the singly constrained transportation problem

Author

Listed:
  • D. Klingman
  • R. Russell

Abstract

A primal simplex procedure is developed to solve transportation problems with an arbitrary additional linear constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper. Efficient procedures for pricing‐out the basis, determining representations, and implementing the change of basis are presented. These procedures exploit the pure transportation substructure in such a manner that full advantage may be taken of the computational schemes and list structures used to store and update the basis in codifying the MODI method. Furthermore, the pricing‐out and change‐of‐basis procedures are organized in a manner that permits the calculations for one to be utilized in the other. Computational results are presented which indicate that this method is at least 50 times faster than the state‐of‐the‐art LP code, APEX‐III. Methods for obtaining basic primal “feasible” starts and “good” feasible integer solutions are also presented.

Suggested Citation

  • D. Klingman & R. Russell, 1978. "A streamlined simplex approach to the singly constrained transportation problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 25(4), pages 681-695, December.
    • Handle: RePEc:wly:navlog:v:25:y:1978:i:4:p:681-695
    DOI: 10.1002/nav.3800250410
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800250410
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800250410?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.

    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:wly:navlog:v:25:y:1978:i:4:p:681-695. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.