An edition of Linear programming and network flows
(2010)
Linear programming and network flows
4th ed.
by M. S. Bazaraa
- 3 Want to read
Share
×Close
This work doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
Linear programming and network flows
2010, John Wiley & Sons, Wiley
in English
- 4th ed.
0470462728 9780470462720
|
aaaa
|
Book Details
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.
Edition Notes
Includes bibliographical references and index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
| September 17, 2021 | Edited by ImportBot | import existing book |
| July 5, 2019 | Edited by MARC Bot | import existing book |
| December 16, 2010 | Created by ImportBot | initial import |