Bazaraa, M. S. <br/><br/>
Linear programming and network flows / 
Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali. 
 - 4th ed. 
 - xiv, 748 p. :  ill. ;  25 cm. 
<br/><br/>
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9780470462720 (cloth) 0470462728 (cloth) 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Doğrusal programlama<br/>Linear programming<br/>Network analysis (Planning)<br/>Şebeke analizi (Planlama)
<br/><br/><label>LC Class. No.: </label>T57.74  / .B39 2010