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

Evolution of Linear Programming Computing Techniques

Author

Listed:
  • Wm. Orchard-Hays

    (The RAND Corporation)

Abstract

While the linear programming concept and the formulation of a specific model have value in themselves, the technique would fall short of its promise without efficient computing procedures. The simplex method has proved to be the most successful approach but it still leaves a wide range for detailed algorithms. At first, the method was applied by hand or with the aid of punched-card equipment. With the advent of internally-stored-program computers, automatic routines were designed. However, the early machines were adequate only for small problems and the original simplex method was not efficient for many LP models. A program of development was started at RAND to provide better computing techniques. Using first the IBM Model II CPC, then the 701 and now the 704, general LP routines of considerable power and flexibility have been developed. Future improvements will probably be possible only from higher level abstractions which take advantage of structure in the model matrix or which produce more efficient forms of the inverse of a sparse matrix.

Suggested Citation

  • Wm. Orchard-Hays, 1958. "Evolution of Linear Programming Computing Techniques," Management Science, INFORMS, vol. 4(2), pages 183-190, January.
    • Handle: RePEc:inm:ormnsc:v:4:y:1958:i:2:p:183-190
    DOI: 10.1287/mnsc.4.2.183
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.4.2.183
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.4.2.183?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. Gerald Gamrath & Timo Berthold & Domenico Salvagnin, 2020. "An exploratory computational analysis of dual degeneracy in mixed-integer programming," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 241-261, October.

    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:4:y:1958:i:2:p:183-190. 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.