000			01712cam a2200349 a 4500
001			15831721
003			BD-ChPU
005			20240424103126.0
008			090723s2010 njua b 001 0 eng
010			_a2009028769
020			_a9780470462720 (cloth)
020			_a0470462728 (cloth)
035			_a(OCoLC)ocn419865390
040			_aDLC _cDLC _dYDX _dYDXCP _dCDX _dBWX _dOKU _dDLC _dBD-ChPU
050	0	0	_aT57.74 _b.B39 2010
082	0	0	_a519.72 B362l 2010 _222
100	1		_aBazaraa, M. S.
245	1	0	_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 pages. : _b illustrations. ; _c25 cm.
504			_aIncludes bibliographical references and index.
505	0		_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.
526			_aMathematics.
650		0	_aLinear programming.
650		0	_aNetwork analysis (Planning)
700	1		_aJarvis, John J.
700	1		_aSherali, Hanif D., _d1952-
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c7520 _d7520