Linear programming and network flows /Publisher: Hoboken, N.J. : John Wiley & Sons, c2010Edition: 4th ed.Description: xiv, 748 p. : ill. ; 25 cm.ISBN: 9780470462720 (cloth).Subject(s): Linear programming | Network analysis (Planning)
|Item type||Location||Call number||Status||Date due|
Epoka University Library
|T 57.74 .B39 2010 (Browse shelf)||Available|
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.