Trends In Optimization: American Mathematical Society Short Course, January 5-6, 2004, Phoenix, Arizona

Optimization is concerned with the efficient computation of the supremum of an objective function f whose domain is restricted to some set of feasible solutions S. These edited notes from the lectures of the January 2004 short course primarily cover the discrete side of optimization. Lecture topics include selected topics from lattice basis reduction in optimization, polyhedral methods in discrete optimization, graphs and combinational optimization, integer programming duality, a study of the design and analysis of approximation algorithms, algebraic recipes for integer programming, and nonlinear and semidefinite programming. The lecture notes include references and the editors have provided a general index. Annotation ©2004 Book News, Inc., Portland, OR (booknews.com)