Linear programming and network flows

Linear programming and network flows

by Bazaraa, M. S.

Type Book
Rate 0.0 /5

Title Statements

  • Full title :Linear programming and network flows / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.

Edition Statements

  • Publication Date:©2010.
  • Edition:4th ed

Publication Statements

  • Publisher(s):John Wiley & Sons
  • Place of Publication:Hoboken, N.J
  • Language:eng
  • Publication Date:©2010.

The Physical Object

  • Description:xiv, 748 pages

Edition Identifiers

  • ISBN:9780470462720, 0470462728
  • oclc:ocn613317364
  • LC Classification:T57.74
  • Dewey Decimal:519.7/2

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.

Read More ↓

Subjects

Writers

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Linear programming and network flows, Fourth Edit…

    PDF · 9.0 MB · updated
  • Linear Programming and Network Flows -- (.djvu)

    DJVU · 4.8 MB · updated
  • Linear Programming and Network Flows -- (.pdf)

    PDF · 8.3 MB · updated