000 01689na a2200325 4500
001 5655
003 Milas
005 20140528154643.0
008 131111b tu 000 0
020 _a9780470462720 (cloth)
040 _aDLC
_cDLC
_dYDX
_dYDXCP
_dCDX
_dBWX
_dOKU
_dDLC
050 _aT57.74
_b.B39 2010
082 _a519.7/2
_222
090 _aT57.74 .B39 2010
100 _aBazaraa, M. S.
245 _aLinear programming and network flows /
_cMokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
250 _a4th ed.
260 _aHoboken, N.J. :
_bJohn Wiley & Sons,
_cc2010.
300 _axiv, 748 p. :
_bill. ;
_c25 cm.
504 _aIncludes bibliographical references and index.
505 _aLinear 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.
650 _aLinear programming.
650 _aNetwork analysis (Planning)
700 _aJarvis, John J.
700 _aSherali, Hanif D.,
_d1952-
906 _a7
_bcbc
_corignew
_d1
_eecip
_f20
_gy-gencatlg
910 _aDonated by Beder University
925 _aacquire
_xpolicy default
955 _axe04 2010-03-26 1 copy rec'd., to CIP ver.
_axh00 2010-03-30 to USPL/STM
_bxh09 2009-07-23
_fxh14 2010-05-27 Z-CipVer to BCCD
_ixh09 2009-07-23 to Dewey
_wrd05 2009-07-27
999 _c3683
_d3683