The Good, the Bad, and the Hungry Sale
 
 

Recently Viewed clear list


Original Essays | June 20, 2014

Lauren Owen: IMG The Other Vampire



It's a wild and thundery night. Inside a ramshackle old manor house, a beautiful young girl lies asleep in bed. At the window, a figure watches... Continue »

spacer
Qualifying orders ship free.
$271.50
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Mathematics- Computer

This title in other editions

Other titles in the International Series in Operations Research & Management Science series:

International Series in Operations Research & Management Science #4: Linear Programming: Foundations and Extensions

by

International Series in Operations Research & Management Science #4: Linear Programming: Foundations and Extensions Cover

 

Synopses & Reviews

Publisher Comments:

This book focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Along the way, dynamic programming and the linear complementarity problem are touched on as well. This book aims to be the first introduction to the topic. Specific examples and concrete algorithms precede more abstract topics. Nevertheless, topics covered are developed in some depth, a large number of numerical examples worked out in detail, and many recent results are included, most notably interior-point methods. The exercises at the end of each chapter both illustrate the theory, and, in some cases, extend it. Optimization is not merely an intellectual exercise: its purpose is to solve practical problems on a computer. Accordingly, the book comes with software that implements the major algorithms studied. At this point, software for the following four algorithms is available: The two-phase simplex method The primal-dual simplex method The path-following interior-point method The homogeneous self-dual methods.£/LIST£.

Book News Annotation:

A introduction to the subject; the first two sections assume only linear algebra, but the other two require some knowledge of multivariate calculus, particularly the ability to use Lagrange multipliers to solve simple calculus problems in two and three dimensions. Includes source code in C for five of the problems discussed, and answers to some of the exercises.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

This work focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Software is included implementing the algorithms studied.

Description:

Includes bibliographical references (p. [407]-411) and index.

Table of Contents

Preface. Part 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. Part 2: Network-Type Problems. 13. Network Flow Problems. 14. Applications. 15. Structural Optimization. Part 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. Part 4: Extensions. 22. Integer Programming. 23. Quadratic Programming. 24. Convex Programming. Appendix A: Source Listings. Answers to Selected Exercises. Bibliography. Index.

Product Details

ISBN:
9780792398042
Author:
Vanderbei, Robert J.
Publisher:
Springer
Location:
Boston :
Subject:
Linear Programming
Subject:
Mathematical optimization
Subject:
Operations Research
Subject:
Operations Research/Decision Theory
Subject:
Operations Research, Mathematical Programming
Subject:
Mathematical Modeling and Industrial Mathematics
Subject:
Operations Research, Management Science
Subject:
Mathematics-Computer
Subject:
Operation Research/Decision Theory
Copyright:
Edition Description:
Book
Series:
International Series in Operations Research & Management Science
Series Volume:
8
Publication Date:
19961231
Binding:
HARDCOVER
Language:
English
Illustrations:
Yes
Pages:
440
Dimensions:
235 x 155 mm 1750 gr

Related Subjects

Business » General
Business » Management
Business » Writing
Science and Mathematics » Mathematics » Computer

International Series in Operations Research & Management Science #4: Linear Programming: Foundations and Extensions New Hardcover
0 stars - 0 reviews
$271.50 In Stock
Product details 440 pages Kluwer Academic Publishers - English 9780792398042 Reviews:
"Synopsis" by , This work focuses largely on constrained optimization. It begins with a substantial treatment of linear programming and proceeds to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. Software is included implementing the algorithms studied.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.