Abstract
Linear programming consists of:
-
(a)
Finding a solution to a system of linear inequalities, and
-
(b)
Selecting from all solutions to such a system, a solution for which a certain linear function of the variables attains a maximum value.
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
© 1983 Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Heesterman, A.R.G. (1983). Some Basic Linear Programming Concepts. In: Matrices and Simplex Algorithms. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7941-3_7
Download citation
DOI: https://doi.org/10.1007/978-94-009-7941-3_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7943-7
Online ISBN: 978-94-009-7941-3
eBook Packages: Springer Book Archive