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|
Browsing Epoka University Library Shelves Close shelf browser
|T 57.7 .T33 1975 Integer programming :||T 57.7 .W55 1978 Model building in mathematical programming /||T 57.74 .A43 1984 Topics in relaxation and ellipsoidal methods /||T 57.74 .B39 2010 Linear programming and network flows /||T 57 .74 .H33 1962 Linear programming.||T 57.74 .M87 1983 Linear programming /||T 57 .74 .S26 1975 Integer programming /|
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.