Ekeland (finance, U. of Paris-Dauphine) and TTmam (mathematics, U. of Paris-Orsay) present different developments of infinite dimensional convex programming in the context of convex analysis, including duality, minmax and Lagrangians, and the convexification of non-convex optimization problems in the calculus of variations. For good measure they throw in an application of the theory of convex duality to partial differential equations. Their account is here reprinted, corrected but unabridged, from the 1976 Elsevier edition. The member price is $23.80. Annotation c. Book News, Inc., Portland, OR (booknews.com)