Abstract
In verbal terms, the linear programming problem (also referred to as linear program, LP) is to optimize (minimize or maximize) a linear function subject to linear equality and/or inequality constraints.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Maros, I. (2003). The Linear Programming Problem. In: Computational Techniques of the Simplex Method. International Series in Operations Research & Management Science, vol 61. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0257-9_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0257-9_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4990-7
Online ISBN: 978-1-4615-0257-9
eBook Packages: Springer Book Archive