Linear Programming and Network Flows /
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Hoboken, N.J. :
John Wiley & Sons,
2010
|
| Edition: | Fourth edition |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Linear algebra, convex analysis, and polyhedral sets
- The simplex method
- Starting solution and convergence
- Special simplex implementations and optimality conditions
- Duality and sensitivity analysis
- The decomposition principle
- Complexity of the simplex algorithm and polynomial-time algorithms
- Minimal-cost network flows
- The transportation and assignment problems
- The out-of-kilter algorithm
- Maximal flow, shortest path, multicommodity flow, and network synthesis problems