Linear Optimization and Extensions: Problems and Solutions (Universitext) | 
 enlarge | Authors: Dimitris Alevras, Manfred W. Padberg
Publisher: Springer
Category: Book
List Price: $69.95
Buy New: $9.74
You Save: $60.21 (86%)
New (9) Used (10) from $6.26
Rating:  2 reviews
Sales Rank: 1118851
Media: Paperback
Edition: 1
Pages: 453
Number Of Items: 1
Shipping Weight (lbs): 1.9
Dimensions (in): 9.5 x 7.6 x 1
ISBN: 3540417443
Dewey Decimal Number: 519.72
EAN: 9783540417446
Publication Date: June 27, 2001
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Thank you for looking at Bookscorner1.may have a remainder mark
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
This book offers a comprehensive treatment of the exercises and case studies as well as summaries of the chapters of the book "Linear Optimization and Extensions" by Manfred Padberg. It covers the areas of linear programming and the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces.
Here are the main topics treated in the book: Simplex algorithms and their derivatives including the duality theory of linear programming. Polyhedral theory, pointwise and linear descriptions of polyhedra, double description algorithms, Gaussian elimination with and without division, the complexity of simplex steps. Projective algorithms, the geometry of projective algorithms, Newtonian barrier methods. Ellipsoids algorithms in perfect and in finite precision arithmetic, the equivalence of linear optimization and polyhedral separation. The foundations of mixed-integer programming and combinatorial optimization.
|
| Customer Reviews:
 Computational and Mathematical Excellence May 26, 2002
Mathematical Statistician with Social Interests (Uppsala, Ohio)
3 out of 3 found this review helpful
For nearly 30 years, Padberg has been a leader in computational integer programming and in combinatorial optimization theory.
In practice, Padberg has helped to design and implement "branch-and-cut" methods for finding exact optimal solutions to large traveling salesman problems, and this approach is a method of choice for finding approximately optimal solutions to tough industrial problems. The book provides the mathematical and computational background for understanding branch-and-cut; the established mathematical texts by Nemhauser and Wolsey and by Schrijver are less detailed and more condensed, and omit numerical issues. The treatment of modern simplex algorithms for linear programming---updating LU factorizations and using column- and constraint-generation and -purging---is excellent, and a large bibliography contains recent references. Besides industrial and Berlin-airlift scheduling problems, the book contains TSP examples of circuit-board wiring, U.S. state capitals, and Odysseus!
Three more highlights: The double description algorithm receives a complete description, and this is useful for combinatorial geometers. The discussion of integer-arithmetic and complexity theory is very readable, and these technical topics are slighted by interior-point books (besides Wright's quickie), despite their importance in integer programming and combinatorial optimization. The discussion of interior-point algorithms emphasizes projective geometry, a beautiful theory that has inspired so much of optimization theory---besides Karmarkar's interior-point algorithm, Dantzig's simplex algorithm, Fenchel duality, Davidon's conic algorithm for nonlinear optimization, etc.).
The book is not a comprehensive survey of linear programming,
and lacks a treatment of Nesterov's theory of self-concordant barrier-functions. Also, no treatment is given of pivoting algorithms besides Dantzig's (e.g., Terlaky's criss-cross method, Todd's oriented matroid algorithm).
 A good reference for Linear Programming Theory June 1, 2000
4 out of 4 found this review helpful
This book is certainly a very good reference for theoretical topics of linear programming. It covers the Simplex method and the Ellipsoid algorithms. It also covers the geometry of linear programming (polyhedra and polytopes, etc). It certainly covers more topics than most other linear programming texts. As expected, a book writen for theoretical topics is certainly not easy to read, especially for people with no training in doing rigorous mathematical proofs. Also, not many examples or illustrations are given in this book, and this might be a problem for some readers.
|
|
|
