IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v24y1976i2p301-313.html
   My bibliography  Save this article

An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks

Author

Listed:
  • John Hultz

    (University of Texas, Austin, Texas)

  • Darwin Klingman

    (University of Texas, Austin, Texas)

  • Robert Russell

    (University of Tulsa, Tulsa, Oklahoma)

Abstract

This paper presents a “one-pass” algorithm that determines an “advanced” dual basic feasible solution for a class of capacitated generalized network problems. Special cases in this class of problems include transportation and transshipment problems. We include computational results that show that this new start substantially improves the solution performance of the dual method for transportation and transshipment problems. In fact, a dual code employing this advanced start is found to be faster (in terms of total solution time) than the fastest out-of-kilter code SUPERK on highly rectangular transportation problems.

Suggested Citation

  • John Hultz & Darwin Klingman & Robert Russell, 1976. "An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks," Operations Research, INFORMS, vol. 24(2), pages 301-313, April.
    • Handle: RePEc:inm:oropre:v:24:y:1976:i:2:p:301-313
    DOI: 10.1287/opre.24.2.301
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.24.2.301
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.24.2.301?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. Konstantinos Paparrizos & Nikolaos Samaras & Angelo Sifaleras, 2015. "Exterior point simplex-type algorithms for linear and network optimization problems," Annals of Operations Research, Springer, vol. 229(1), pages 607-633, June.

    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:oropre:v:24:y:1976:i:2:p:301-313. 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.