• H. A. Eiselt
  • Carl-Louis Sandblom
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 282)


We begin this chapter with a brief section defining the nonlinear programming problem, introducing some basic terminology, and making some general comments. The second section of this chapter is devoted to a discussion of necessary and sufficient conditions for the existence of local optima of nonlinear functions; first in the one-dimensional case, and then for functions of several variables. The third and final section of this chapter introduces the concept of convexity and relates it to the study of optimization.


  1. Bazaraa MS, Sherali HD, Shetty CM (2013) Nonlinear programming: theory and algorithms (3rd ed.). Wiley, New YorkzbMATHGoogle Scholar
  2. Bertsekas DP (2016) Nonlinear programming (3rd ed.). Athena Scientific, Belmont, MAzbMATHGoogle Scholar
  3. Cottle RW, Thapa MN (2017) Linear and nonlinear optimization. Springer-Verlag, Berlin-Heidelberg-New YorkCrossRefGoogle Scholar
  4. Eiselt HA Sandblom, C-L (2007) Linear programming and its applications. Springer-Verlag, Berlin-HeidelbergzbMATHGoogle Scholar
  5. Luenberger DL, Ye Y (2008) Linear and nonlinear programming (3rd ed.). Springer-Verlag, Berlin-Heidelberg-New YorkCrossRefGoogle Scholar
  6. Rockafellar RT (1970) Convex analysis. University Press, Princeton, NJCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • H. A. Eiselt
    • 1
  • Carl-Louis Sandblom
    • 2
  1. 1.Faculty of ManagementUniversity of New BrunswickFrederictonCanada
  2. 2.Department of Industrial EngineeringDalhousie UniversityHalifaxCanada

Personalised recommendations