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

An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications

Author

Listed:
  • William J. Carolan

    (HQ MAC/AG, Scott AFB, Illinois)

  • James E. Hill

    (HQ MAC/AG, Scott AFB, Illinois)

  • Jeffery L. Kennington

    (Southern Methodist University, Dallas, Texas)

  • Sandra Niemi

    (HQ MAC/AG, Scott AFB, Illinois)

  • Stephen J. Wichmann

    (HQ MAC/AG, Scott AFB, Illinois)

Abstract

KORBX ® (a registered trademark of AT&T) is AT&T's new system for solving large-scale linear programs. The system consists of both hardware, which uses parallel processing technology configured with 256 MB of memory, and software which exploits the design and resources of this modern hardware. The KORBX linear programming software system contains four algorithms which are variations of the interior point method of Narendra Karmarkar. The primal, dual, primal-dual, and power series algorithms were empirically evaluated on a set of linear programming application models being used by the staff of the Military Airlift Command at Scott Air Force Base. For calibration purposes, a set of smaller test problems were also run using MPSX and XMP; and some pure network problems were solved using NETFLO, MPSX, and XMP.

Suggested Citation

  • William J. Carolan & James E. Hill & Jeffery L. Kennington & Sandra Niemi & Stephen J. Wichmann, 1990. "An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications," Operations Research, INFORMS, vol. 38(2), pages 240-248, April.
    • Handle: RePEc:inm:oropre:v:38:y:1990:i:2:p:240-248
    DOI: 10.1287/opre.38.2.240
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.38.2.240
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.38.2.240?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. Sophia Voulgaropoulou & Nikolaos Samaras & Nikolaos Ploskas, 2022. "Predicting the Execution Time of the Primal and Dual Simplex Algorithms Using Artificial Neural Networks," Mathematics, MDPI, vol. 10(7), pages 1-21, March.
    2. Péter Tar & Bálint Stágel & István Maros, 2017. "Parallel search paths for the simplex algorithm," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 967-984, December.
    3. Cynthia Barnhart, 1993. "Dual‐ascent methods for large‐scale multicommodity flow problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 305-324, April.
    4. Robert E. Bixby, 2002. "Solving Real-World Linear Programs: A Decade and More of Progress," Operations Research, INFORMS, vol. 50(1), pages 3-15, February.

    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:38:y:1990:i:2:p:240-248. 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.