Bazaraa, M. S.

Linear programming and network flows / Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali. - 4th ed. - Hoboken, N.J. : John Wiley & Sons, c2010. - xiv, 748 p. : ill. ; 25 cm.

Includes bibliographical references and index.

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.

9780470462720 (cloth)


Linear programming.
Network analysis (Planning)

T57.74 / .B39 2010

519.7/2

Epoka University Library, Rr. Tiranë-Rinas,Km. 12 1039 Tirana, Albania
+355 4 2232 086| FAX +355 4 2222 117|library@epoka.edu.al