Abstract
Linear Programming (LP) 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
DASH Associates (2000) Homepage, URL: http://www.dash.co.uk, State: May 12, 2000
ILOG CPLEX Division (2000) Homepage, URL: http://www.ilog.com/products/cplex, State: May 12, 2000
Krekó, B. (1973) Lehrbuch der Linearen Optimierung, Berlin
Martin, R. K. (1999) Large scale linear and integer optimization: A unified approach, Boston et al.
Winston, W. L. (1994) Operations Research: Applications and algorithms, 3rd ed., Belmont, California
Wolsey, L. A. (1998) Integer Programming, New York et al.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stadtler, H. (2000). Linear and Mixed Integer Programming. In: Stadtler, H., Kilger, C. (eds) Supply Chain Management and Advanced Planning. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04215-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-04215-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04217-5
Online ISBN: 978-3-662-04215-1
eBook Packages: Springer Book Archive