Abstract
The general model of nonlinear programming is to minimize an arbitrary objective function subject to nonlinear equality and inequality constraints. The mathematical formulation is the following one:
. The functions f, gj: Rn → R, j=1,...,m, are assumed to be continuously differentiable. Without loss of generality, we include lower and upper bounds x1, and xu, respectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schittkowski, K. (1980). Introduction. In: Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol 183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46424-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-46424-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10247-2
Online ISBN: 978-3-642-46424-9
eBook Packages: Springer Book Archive