IDEAS home Printed from https://ideas.repec.org/h/spr/sptchp/978-3-642-55309-7_30.html
   My bibliography  Save this book chapter

Linear and Mixed Integer Programming

In: Supply Chain Management and Advanced Planning

Author

Listed:
  • Hartmut Stadtler

    (University of Hamburg)

Abstract

Linear Programming (LP) LP (Linear programming) is one of the most famous optimization techniques introduced independently by Kantarowitsch in 1939 and by Dantzig in 1949 (Krekó 1973). LP is applicable in decision situations where quantities (variables) can take any real values only restricted by linear (in-) equalities, e.g. for representing capacity constraints. Still, LP has turned out to be very useful for many companies so far. LP is used in APS e.g. in Master Planning as well as in Distribution and Transport Planning. Very powerful solution algorithms have been developed (named solvers), solving LP models with thousands of variables and constraints within a few minutes on a personal computer.

Suggested Citation

  • Hartmut Stadtler, 2015. "Linear and Mixed Integer Programming," Springer Texts in Business and Economics, in: Hartmut Stadtler & Christoph Kilger & Herbert Meyr (ed.), Supply Chain Management and Advanced Planning, edition 5, chapter 30, pages 525-536, Springer.
  • Handle: RePEc:spr:sptchp:978-3-642-55309-7_30
    DOI: 10.1007/978-3-642-55309-7_30
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:sptchp:978-3-642-55309-7_30. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.