"In general, this presentation demonstrates the interrelationships between the various facets of optimization. These aspects range from the differential calculus through direct search and mathematical programming techniques to the more specialized game theory and decision theory required when competition is present. The integrated approach is seen, for instance, in the discussion of multidimensional numerical search techniques . Each search may be characterized by the two essential features of a distance and direction of movement. These, together with a further classification based on whether or not the gradient is required, have provided the framework within which search methods are presented. In this context the similarities and differences, the advantages and disadvantages, and the range of applicabilities and failures of all search techniques can be clearly understood. Thus such well-known search methods as Rosen's gradient projection and Zoutendijk's feasible directions are seen to stem from the same basic concept, namely, local linearization. A second example of the interrelationship of methods is the evolution from the Lagrangian formulation of such diverse techniques as the so-called discrete maximum principle, the maximum principle of Pontryagin, duals in linear problems, the Kuhn-Tucker conditions, steepest ascent, the gradient projection, and other important techniques."--Preface.