Description: Linear Programming by Robert J. Vanderbei 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, the primal-dual simplex method, the path-following interior-point method, and and the homogeneous self-dual method. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description 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 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. These C programs and online pivot tools can be found on the books website. The website also includes new online instructional tools and exercises. Back Cover 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 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. These C programs and online pivot tools can be found on the books website. The website also includes new online instructional tools and exercises. Author Biography Robert J. Vanderbei is Professor of Operations Research and Financial Engineering, and former 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 NASAs terrestrial planet finder space telescope. Table of Contents Chapter 1. Introduction.- Chapter 2. The Simplex Method.- Chapter 3. Degeneracy.- Chapter 4. Efficiency of the Simplex Method.- Chapter 5. Duality Theory.- Chapter 6. The Simplex Method in Matrix Notational.- Chapter 7. Sensitivity and Parametric Analyses.- Chapter 8. Implementation Issues.- Chapter 9. Problems in General Form.- Chapter 10. Convex Analysis.- Chapter 11. Game Theory.- Chapter 12. Data Science Applications.- Chapter 13. Financial Applications.- Chapter 14. Network Flow Problems.- Chapter 15. Applications.- Chapter 16. Structural Optimization.- Chapter 17. The Central Path.- Chapter 18. A Path-Following Method.- Chapter 19. The KKT System.- Chapter 20. Implementation Issues.- Chapter 21. The Affine-Scaling Method.- Chapter 22. The Homogeneous Self-Dual Method.- Chapter 23. Integer Programming.- Chapter 24. Quadratic Programming.- Chapter 25. Convex Programming. Long Description 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 books website. The website also includes new online instructional tools and exercises. Feature 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 Details ISBN3030394174 Author Robert J. Vanderbei Short Title Linear Programming Pages 471 Language English Year 2021 Edition 5th ISBN-10 3030394174 ISBN-13 9783030394172 Format Paperback Subtitle Foundations and Extensions Series Number 285 Publisher Springer Nature Switzerland AG Series International Series in Operations Research & Management Science Imprint Springer Nature Switzerland AG Place of Publication Cham Country of Publication Switzerland Publication Date 2021-04-26 UK Release Date 2021-04-26 Illustrations 109 Illustrations, color; 73 Illustrations, black and white; XXV, 471 p. 182 illus., 109 illus. in color. Edited by Laura Ricci Birth 1974 Affiliation Massachusetts Institute of Technology Position journalist Qualifications S. J. Edition Description 5th ed. 2020 Alternative 9783030394141 DEWEY 519.72 Audience Professional & Vocational We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:134000545;
Price: 182.19 AUD
Location: Melbourne
End Time: 2024-12-05T16:33:54.000Z
Shipping Cost: 13.9 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783030394172
Book Title: Linear Programming
Item Height: 235 mm
Item Width: 155 mm
Author: Robert J. Vanderbei
Publication Name: Linear Programming: Foundations and Extensions
Format: Paperback
Language: English
Publisher: Springer Nature Switzerland Ag
Subject: Mathematics
Publication Year: 2021
Type: Textbook
Item Weight: 759 g
Number of Pages: 471 Pages