Part of the Applied Optimization book series (APOP, volume 80)
Linear programming (LP) problems involve a linear objective function and linear constraints, as shown below in Example 2.1
KeywordsFeasible Region Simplex Method Shadow Price Interior Point Method Slack Variable
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 2.Carter M. W. and C. C. Price (2001), Operations Research: A Practical Introduction, CRC Press, New York, NY.Google Scholar
- 4.Dantzig G. B. and Thapa M. N. (1996), Linear Programming, SpringerVerlag, New York.Google Scholar
- 5.Emmett A. (1985), Karmarkar’s algorithm: a threat to simplex, IEEE Spectrum, December, 54.Google Scholar
- 12.Wright S. J. (1999), Algorithms and software for linear and nonlinear programming, Foundations of Computer Aided Process’99, Paper I07, CACHE Corporation, AIChE, New York, NY.Google Scholar
© Springer Science+Business Media New York 2003