• Wilhelm Forst
  • Dieter Hoffmann
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


The general theory has naturally developed out of the study of special problems. It is therefore useful to get a first impression by looking at the ‘classic’ problems. We will have a first look at some elementary examples to get an idea of the kind of problems which will be stated more precisely and treated in more depth later on. Consequently, we will often not go into too much detail in this introductory chapter.


Feasible Region Descent Direction Facility Location Problem Simplex Algorithm Historical Overview 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Kar.
    W. Karush (1939): Minima of Functions of Several Variables with Inequalities as Side Conditions. Univ. of Chicago Master’s ThesisGoogle Scholar
  2. John.
    F. John (1948): Extremum Problems with Inequalities as Subsidiary Conditions. In: Studies and Essays. Courant Anniversary Volume. Interscience, New York, pp. 187–204Google Scholar
  3. Gau.
    C. F. Gauss (1831): Brief an Schumacher. Werke Bd. 8, p. 138Google Scholar
  4. Cau.
    A. Cauchy (1847): Méthode générale pour la résolution des sys- tèmes d’équations simultanées. Comptes Rendus Acad. Sci. Paris 25, pp. 536–538Google Scholar
  5. Lev.
    K. Levenberg (1944): A Method for the Solution of Certain Non-linear Problems in Least Squares. Quart. Appl. Math. 2, 164–168MATHMathSciNetGoogle Scholar
  6. Mar.
    D. W. Marquardt (1963): An Algorithm for Least-Squares Estimation of Nonlinear Parameters. SIAM J. Appl. Math. 11, pp. 431–441Google Scholar
  7. GQT.
    S.Ṁ. Goldfeld, R.Ė. Quandt, H.Ḟ. Trotter (1966): Maximization by Quadratic Hill-Climbing. Econometrica 34, pp. 541–551MATHCrossRefMathSciNetGoogle Scholar
  8. Sou.
    R. V. Southwell (1940): Relaxation Methods in Engineering Science. Clarendon Press, OxfordGoogle Scholar
  9. Dav.
    W. C. Davidon (1991): Variable Metric Method for Minimization. SIAM J. Optimization 1, pp. 1–17Google Scholar
  10. Fi/Co.
    A. Fiacco, G. McCormick (1990): Nonlinear Programming — Sequential Unconstrained Minimization Techniques. SIAM, PhiladelphiaMATHGoogle Scholar
  11. Hai.
    E. Hairer (2001): Introduction à l’Analyse Numérique. Lecture Notes, Genève, p. 158Google Scholar
  12. Bar1.
    M. C. Bartholomew-Biggs (2005): Nonlinear Optimization with Financial Applications. Kluwer, Boston, Dordrecht, LondonMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Fak. Mathematik und Wirtschaftswissenschaften Inst. Numerische MathematikUniversität UlmUlmGermany
  2. 2.FB Mathematik und StatistikUniversität KonstanzKonstanzGermany

Personalised recommendations