Linear and Mixed Integer Programming

Hartmut Stadtler ()
Additional contact information
Hartmut Stadtler: University of Hamburg

Chapter 30 in Supply Chain Management and Advanced Planning, 2015, pp 525-536 from Springer

Abstract: 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.

Keywords: Feasible Solution; Mixed Integer Programming; Integer Solution; Linear Programming Model; Aspiration Level (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-642-55309-7_30

Ordering information: This item can be ordered from
http://www.springer.com/9783642553097

DOI: 10.1007/978-3-642-55309-7_30

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().