Abstract
In this chapter we deal with the following basic optimization problem: Among the n-tuples (x 1,…, x n ) that satisfy in m inequalities g i (x 1, …,x n ) ≦ 0, i = 1,…, m, and ℓ equalities h i (x 1,…, x n ) = 0, i = 1,…, ℓ, find a solution (\( x_1^*, \ldots ,x_n^* \)) which minimizes the function f (x 1,…,x n ).
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shimizu, K., Ishizuka, Y., Bard, J.F. (1997). Differentiable Nonlinear Programming. In: Nondifferentiable and Two-Level Mathematical Programming. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6305-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6305-1_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7895-2
Online ISBN: 978-1-4615-6305-1
eBook Packages: Springer Book Archive