Abstract
In the absence of general algorithms for nonlinear programming problems, it lies near at hand to explore the possibilities of approximate solution by linearization. If the nonlinear functions of an MP problem can be replaced by piecewise linear functions, these approximations may be expressed in such a way that the whole problem is turned into a case of linear programming.
This is a preview of subscription content, log in via an institution to check access.
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
© 1975 Springer-Verlag/Wien
About this chapter
Cite this chapter
Danø, S. (1975). Linearization of Nonlinear Programming Problems. In: Nonlinear and Dynamic Programming. Springer, Vienna. https://doi.org/10.1007/978-3-7091-8394-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-7091-8394-6_3
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81289-1
Online ISBN: 978-3-7091-8394-6
eBook Packages: Springer Book Archive