Abstract
Non-linear programming problems are basically just as their linear counterparts in the sense that their formal structure is similar, with the difference that some non-linear functions occur. This sentence is definitely misleading as it may give the (false) impression that understanding non-linear optimization problems is more-or-less a generalization of the linear problems. Nothing farther from reality, as we will immediately understand even with the simplest non-linear problems. This chapter focuses on two main fundamental topics: optimality conditions, and convexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Pedregal, P. (2017). Nonlinear Programming. In: Optimization and Approximation. UNITEXT(), vol 108. Springer, Cham. https://doi.org/10.1007/978-3-319-64843-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-64843-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64842-2
Online ISBN: 978-3-319-64843-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)