Abstract
In recent years conjugate function theory has been used frequently in nonlinear programming, particularly in the context of duality. Even though the initial results were restricted to convex functions, the approach has been found quite powerful for nonconvex functions also. In this chapter we will consider this more general problem where the functions involved may be nonconvex.
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). Conjugate Duality. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-48294-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07680-3
Online ISBN: 978-3-642-48294-6
eBook Packages: Springer Book Archive