"Linear programming and network flows" - Information and Links:

Linear programming and network flows - Info and Reading Options

Book's cover
The cover of “Linear programming and network flows” - Open Library.

"Linear programming and network flows" was published by John Wiley & Sons in 2010 - Hoboken, N.J, it has 748 pages and the language of the book is English.


“Linear programming and network flows” Metadata:

  • Title: ➤  Linear programming and network flows
  • Author:
  • Language: English
  • Number of Pages: 748
  • Publisher: John Wiley & Sons
  • Publish Date:
  • Publish Location: Hoboken, N.J

“Linear programming and network flows” Subjects and Themes:

Edition Specifications:

  • Pagination: xiv, 748 p. :

Edition Identifiers:

AI-generated Review of “Linear programming and network flows”:


"Linear programming and network flows" Table Of Contents:

  • 1- Linear algebra, convex analysis, and polyhedral sets
  • 2- The simplex method
  • 3- Starting solution and convergence
  • 4- Special simplex implementations and optimality conditions
  • 5- Duality and sensitivity analysis
  • 6- The decomposition principle
  • 7- Complexity of the simplex algorithm and polynomial-time algorithms
  • 8- Minimal-cost network flows
  • 9- The transportation and assignment problems
  • 10- The out-of-kilter algorithm
  • 11- Maximal flow, shortest path, multicommodity flow, and network synthesis problems.

Read “Linear programming and network flows”:

Read “Linear programming and network flows” by choosing from the options below.

Search for “Linear programming and network flows” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Linear programming and network flows” in Libraries Near You:

Read or borrow “Linear programming and network flows” from your local library.

Buy “Linear programming and network flows” online:

Shop for “Linear programming and network flows” on popular online marketplaces.