Skip to main content

Maxima and minima

  • Chapter
  • 93 Accesses

Abstract

Let U be an open set in ℝn; this means that to every point u ∈ U there corresponds a ball N(u) = {y∈ℝn: ‖y-u‖ < γ(u)}, for some γ(u) > 0, such that N(u) ⊂ U. This concept is illustrated in Fig. 3.1. Let f: U → ℝ be a (Fréchet) differentiable function. (Note that the definition of f’(u) at uU requires that the domain of f contains some ball N(u). An open set U, from the definition, does not contain the points of its boundary.)

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Further Reading

  • Bazaraa, M.S. and Shetty, C.M. (1976), Foundations of Optimization, Springer-Verlag, Berlin. (Vol. 122 of Lecture Notes in Economics and Mathematical Systems). [For more general versions of the Kuhn-Tucker theorem.]

    Google Scholar 

  • Ben-Israel, A., Ben-Tal, A. and Zlobec, S. (1976), Optimality conditions in convex programming, IX International Symposium on Mathematical Programming (Budapest, 1976), A. Prekopa (ed.), North-Holland, Amsterdam (1979), pp. 177–92. [For the last example in Section 3.5.]

    Google Scholar 

  • Craven, B.D. (1978), Mathematical Programming and Control Theory, Chapman and Hall, London. [For more general constrained minimization theory, no longer restricted to finite dimensions.]

    Book  Google Scholar 

  • Craven, B.D. (1979), On constrained maxima and minima, Austral Math. Soc. Gazette, 6 (2), 46–50. [For the discrimination of constrained stationary points.]

    Google Scholar 

  • Hancock, H. (1917), Theory of Maxima and Minima (reprinted in 1960 by Dover, New York). [A classic account.]

    Google Scholar 

  • Kuhn, H.W. and Tucker, A.W. (1951), Nonlinear programming, in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, J. Neyman (ed.), University of California Press, Berkeley, pp. 481–92. [For the original version of the Kuhn-Tucker theorem.]

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1981 B.D. Craven

About this chapter

Cite this chapter

Craven, B.D. (1981). Maxima and minima. In: Functions of several variables. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-9347-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-9347-7_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-412-23340-1

  • Online ISBN: 978-94-010-9347-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics