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

The dual method of solving the linear programming problem

Author

Listed:
  • C. E. Lemke

Abstract

Many problems in logistics are capable of being formulated as linear programming problems. For example, one such problem is the so‐called transportation problem, which is concerned with obtaining the best way (in the sense of least time, or of least expense, etc.) of shipping stipulated quantities of materials from m origins to n destinations. This paper develops a new computational method of solving general linear programming problems.

Suggested Citation

  • C. E. Lemke, 1954. "The dual method of solving the linear programming problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 36-47, March.
    • Handle: RePEc:wly:navlog:v:1:y:1954:i:1:p:36-47
    DOI: 10.1002/nav.3800010107
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800010107
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800010107?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. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    2. Anh Ninh, 2021. "Robust newsvendor problems with compound Poisson demands," Annals of Operations Research, Springer, vol. 302(1), pages 327-338, July.
    3. Anh Ninh & Honggang Hu & David Allen, 2019. "Robust newsvendor problems: effect of discrete demands," Annals of Operations Research, Springer, vol. 275(2), pages 607-621, April.
    4. Timo Berthold & Jakob Witzig, 2021. "Conflict Analysis for MINLP," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 421-435, May.
    5. 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:wly:navlog:v:1:y:1954:i:1:p:36-47. 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.