Abstract
The subject of linear programming is the minimization or maximization of a linear objective function (OF) of finitely many variables subject to a finite number of constraints (CT), which are given as linear equations or inequalities. Many practical problems can be directly formulated as a linear programming problem, or they can be modeled approximately by a linear programming problem.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bronshtein, I.N., Semendyayev, K.A., Musiol, G., Mühlig, H. (2015). Optimization. In: Handbook of Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46221-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-662-46221-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46220-1
Online ISBN: 978-3-662-46221-8
eBook Packages: EngineeringEngineering (R0)