Linear programming and network flows - Bazaraa, M. S.; Jarvis, John J.; Sherali, Hanif D., 1952- (Hoboken, N.J. : John Wiley & Sons, 2010)
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.
Includes bibliographical references and index.
Mathematics.
Keywords: Linear programming; Network analysis (Planning)