
Linear Programming
Foundations and Extensions
Robert J. Vanderbei(Author)
Kluwer Academic Publishers
2nd Edition
Published on 1. January 2001
Book
Hardback
XVIII, 450 pages
978-0-7923-7342-1 (ISBN)
Article exhausted; check for reprint
Description
This book provides an introduction to optimization. It details constrained optimization, beginning with a substantial treatment of linear programming and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Coverage underscores the purpose of optimization: to solve practical problems on a computer. C programs that implement the major algorithms and JAVA tools are available online.
More details
Series
Edition
2nd ed.
Language
English
Place of publication
NY
United States
Target group
College/higher education
Professional and scholarly
Edition type
Revised edition
Illustrations
58
58 s/w Abbildungen
bibliography, index
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Thickness: 26 mm
Weight
835 gr
ISBN-13
978-0-7923-7342-1 (9780792373421)
DOI
10.1007/978-1-4757-5662-3
Schweitzer Classification
Other editions
New editions

Book
11/2007
3rd Edition
Springer
€86.62
Article exhausted; check for reprint
Previous edition

Robert J. Vanderbei
Linear Programming: Foundations and Extensions
Book
12/1996
Kluwer Academic Publishers
€212.50
Shipment within 15-20 days
Content
1. Basic Theory-The Simplex Method and Duality.- 1. Introduction.- 2. The Simplex Method.- 3. Degeneracy.- 4. Efficiency of the Simplex Method.- 5. Duality Theory.- 6. The Simplex Method in Matrix Notation.- 7. Sensitivity and Parametric Analyses.- 8. Implementation Issues.- 9. Problems in General Form.- 10. Convex Analysis.- 11. Game Theory.- 12. Regression.- 2. Network-Type Problems.- 13. Network Flow Problems.- 14. Applications.- 15. Structural Optimization.- 3. Interior-Point Methods.- 16. The Central Path.- 17. A Path-Following Method.- 18. The KKT System.- 19. Implementation Issues.- 20. The Affine-Scaling Method.- 21. The Homogeneous Self-Dual Method.- 4. Extensions.- 22. Integer Programming.- 23. Quadratic Programming.- 24. Convex Programming.- Appendix A. Source Listings.- 1. The Self-Dual Simplex Method.- 2. The Homogeneous Self-Dual Method.- Answers to Selected Exercises.