Optimization problems; Introduction

Part of the Chapman and Hall Mathematics Series book series (CHMS)


If a problem in the real world is described (and thus necessarily idealized) by a mathematical model, then the problem often calls for maximizing, or minimizing, some function of the variables which describe the problem. For example, it may be required to calculate the conditions of operation of an industrial process which give the maximum output, or quality, or which give the minimum cost. Such calculations differ from the classical ‘maximum-minimum’ problems of the calculus textbooks, because the variables of the problem are nearly always subject to restrictions — equations or inequalities — called constraints. It is therefore not enough to equate a derivative, or gradient, to zero to find a maximum or minimum.


Banach Space Optimal Control Problem Mathematical Program Convex Cone Piecewise Continuous Function 
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. Craven, B.D., and Mond, B. (1973), Transposition theorems for cone-convex functions, SIAM J. Appl. Math., 24, 603–612.CrossRefGoogle Scholar
  2. Dieudonné, J. (1960), Foundations of Modern Analysis, Academic Press, New York.Google Scholar
  3. Gray, P., and Cullinan-Jones, C. (1976), Applied Optimization — a Survey, Interfaces, 6(3), 24–46.CrossRefGoogle Scholar
  4. Simmons, G.F. (1963), Introduction to Topology and Modern Anal Analysis, McGraw-Hill/Kogakusha, Tokyo.Google Scholar

Copyright information

© B. D. Craven 1978

Authors and Affiliations

  1. 1.University of MelbourneAustralia

Personalised recommendations