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):Wiley-Blackwell
  • Place of Publication:Oxford
  • Language:eng
  • Publication Date:©2010.

The Physical Object

  • Description:xiv, 748 pages : : illustrations ; : 24 cm

Edition Identifiers

  • ISBN:9780470462720, 0470462728
  • oclc:ocn444397202
  • LC Classification:T57.74
  • Dewey Decimal:519.72

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.

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