Linear programming and network flows

Linear programming and network flows

by Bazaraa, Mokhtar S.

Type Book
Rate 0.0 /5

Title Statements

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

Edition Statements

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

Publication Statements

  • Publisher(s):J. Wiley
  • Place of Publication:New York
  • Language:eng
  • Publication Date:cop. 2010.

Notes

Índice abreviado: Introduction 2. Linear algebra, convex analysis, and polyhedral sets 3. The simplex method 4. Starting solution and convergence 5. Special simplex implementatins and optimality conditions 6. Duality and sensitivity analyis 7. The decompositition 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.

The Physical Object

  • Description:XIV, 684 p. ; : 23 cm

Edition Identifiers

  • ISBN:9780470462720, 0470462728
  • oclc:ocn913008127
  • Dewey Decimal:519.72

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