000			01554 a2200337 4500
001			200043547
999			_c200043547 _d35112
003			TR-AnTOB
005			20200606143249.0
008			111122s2010 nju 001 0
020			_a9780470462720 (cloth)
020			_a0470462728 (cloth)
040			_aDLC _cDLC _dTR-AnTOB
041			_aeng
050	0	0	_aT57.74 _b.B39 2010
090			_aT57.74 .B39 2010
100	1		_aBazaraa, M. S. _939522
245	1	0	_aLinear programming and network flows / _cMokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
250			_a4th ed.
264		1	_aHoboken, N.J. : _bJohn Wiley & Sons, _cc2010.
300			_axiv, 748 p. : _bill. ; _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.
650		7	_aDoğrusal programlama _2etuturkob _912342
650		0	_aLinear programming _923357
650		0	_aNetwork analysis (Planning) _94603
650		0	_aŞebeke analizi (Planlama) _939525
700	1		_aJarvis, John J. _939523
700	1		_aSherali, Hanif D., _d1952- _939524
942			_cBK