Abstract
In this chapter we will be concerned with developing optimality conditions for a nonlinear programming problem. We will consider different problems of varying difficulties and develop necessary conditions that a point must satisfy in order to qualify for an optimal solution. Under certain convexity assumptions we also show that these conditions are sufficient for optimality. Unlike the saddle conditions of Chapter 7, the optimality criteria of this chapter use the gradients of the objective function and constraint functions.
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
© 1976 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Bazaraa, M.S., Shetty, C.M. (1976). Stationary Point Optimality Conditions with Differentiability. In: Foundations of Optimization. Lecture Notes in Economics and Mathematical Systems, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48294-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-48294-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07680-3
Online ISBN: 978-3-642-48294-6
eBook Packages: Springer Book Archive