This Fourth Edition introduces the latest theory and applications in optimization. It emphasizes constrained optimization, beginning with a substantial treatment of linear programming and then proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Readers will discover a host of practical business applications as well as non-business applications.
Topics are clearly developed with many numerical examples worked out in detail. Specific examples and concrete algorithms precede more abstract topics. With its focus on solving practical problems, the book features free C programs to implement the major algorithms covered, including the two-phase simplex method, primal-dual simplex method, path-following interior-point method, and homogeneous self-dual methods. In addition, the author provides online JAVA applets that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. These C programs and JAVA tools can be found on the book's website. The website also includes new online instructional tools and exercises.
Series
Edition
Softcover reprint of the original 4th ed. 2014
Language
Place of publication
Target group
Professional and scholarly
Research
Edition type
Illustrations
86 s/w Abbildungen, 8 s/w Tabellen
8 Tables, black and white; 86 Illustrations, black and white; XXII, 414 p. 86 illus.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
ISBN-13
978-1-4899-7376-4 (9781489973764)
DOI
10.1007/978-1-4614-7630-6
Schweitzer Classification
Robert J. Vanderbei is Professor of Operations Research and Financial Engineering, and Department Chair, OR and Financial Engineering at Princeton University. His research interests are in algorithms for nonlinear optimization and their application to problems arising in engineering and science. Application areas of interest focus mainly on inverse Fourier transform optimization problems and action minimization problems with a special interest in applying these techniques to the design of NASA's terrestrial planet finder space telescope.
Introduction.- The Simplex Method.- Degeneracy.- Efficiency of the Simplex Method.- Duality Theory.- The Simplex Method in Matrix Notation.- Sensitivity and Parametric Analyses.- Implementation Issues.- Problems in General Form.- Convex Analysis.- Game Theory.- Regression.- Financial Applications.- Network-Type Problems.- Applications.- Structural Optimization.- The Central Path.- A Path-Following Method.- The KKT System.- Implementation Issues.- The Affine-Scaling Method.- The Homogeneous Self-Dual Method.- Integer Programming.- Quadratic Programming.- Convex Programming.
