Linear programming and network flows
The only book to treat both linear programming techniques and network flows under one cover, this book has been conpletely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementat...
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Hoboken, New Jersey :
John Wiley & Sons ,
c2010
|
| Edition: | 4th ed |
| Subjects: |
Table of Contents:
- 1. Introduction
- 2. Linear algebra, convex analysis, and polyhedral sets
- 3. The simplex method
- 4. Starting solution and convergence
- 5. Special simplex implementations and optimality conditions
- 6. Duality and sensitivity analysis
- 7. The decomposition principle
- 8. Complexity of the simplex algorithm and polynomial-time algorithms
- 9. Minimal-cost network flows
- 10. The transportation and assignment problems
- 11. The out-of-kilter algorithm
- 12. Maximal flow, shortest path, multicommodity flow, and network synthesis problems