5th ed. 2020, XXV, 471 p. 182 illus., 109 illus. in color.

Hardcover

84,99 € | £74.99 | $109.99 [1]90,94 € (D) | 93,49 € (A) | CHF 100,50

71,68 € | £59.99 | $84.99 [2]71,68 € (D) | 71,68 € (A) | CHF 80,00

Available from your library or springer.com/shop

Printed eBook for just

€ | $ 24.99
springer.com/mycopy

Robert J. Vanderbei

Linear Programming

Foundations and Extensions

Series: International Series in Operations Research & Management Science

• Complete update of bestselling text in the field

• Includes new materials, such as an explanation of Gomory Cuts and applying integer programming to solve Sudoku problems

• Discusses possibilities of Machine Learning applications

The book provides a broad introduction to both the theory and the application of optimization with a special emphasis on the elegance, importance, and usefulness of the parametric self-dual simplex method. The book assumes that a problem in “standard form,” is a problem with inequality constraints and nonnegative variables. The main new innovation to the book is the use of clickable links to the (newly updated) online app to help students do the trivial but tedious arithmetic when solving optimization problems. The latest edition now includes: a discussion of modern Machine Learning applications, as motivational material; a section explaining Gomory Cuts and an application of integer programming to solve Sudoku problems. 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 and Python programs to implement the major algorithms covered, including the two-phase simplex method, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. In addition, the author provides online tools that illustrate various pivot rules and variants of the simplex method, both for linear programming and for network flows. Here are links to these C/Python programs, the online pivot tools, and additional exercises:

• Associated software (Python and C/C++ source code)

• Simple Pivot Tool (helps solve exercises from Chapters 1 to 5)

• Advanced Pivot Tool (helps solve exercises from Chapters 5 to 7)

• Pivot tool illustrating cycling

• Pivot tool illustrating worst-case exponentiality of the simplex method (Klee-Minty)

• Pivot tool for integer programming (Gomory cuts)

• Online pivot exam (tests your knowledge of the simplex method)

• Network-Simplex Pivot Tool

• Shortest Paths Problem (Dykstra's algorithm)

• Online Exercises (Pivot Challenge webpages)

• Additional Exercises

Order online at springer.com / or for the Americas call (toll free) 1-800-SPRINGER /

or email us at: customerservice@springernature.com. / For outside the Americas call +49 (0) 6221-345-4301 / or email us at: customerservice@springernature.com.

The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with [1] include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with [2] include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted. [3] No discount for MyCopy.

Font made from oNline Web Fonts is licensed by CC BY 3.0

Part of