000			01476nam a2200325 a 4500
001			394
003			ANKAREF
005			20220209064333.0
007			t
008			170217s2010 |||||| ||||||||||eng
020			_a9780470462720
040			_aBursa Teknik Üniversitesi
041			_aeng
050			_aT57.74 _b.B393 2010
082			_a519.7
100	1		_aBazaraa, M. S. _948163
245	1	0	_aLinear programming and network flows / _cMokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
250			_a4. baskı
260			_aHoboken, N.J. : _bJohn Wiley & Sons, _c2010.
300			_axiv, 748 sayfa ; _c25 cm.
500			_aDizin : 733-748 s.
504			_aKaynakça : 681-732 s.
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		0	_aLinear programming. _948164
650		0	_aDoğrusal programlama. _948165
650		0	_aNetwork analysis (Planning). _947002
650		0	_aAğ çözümleme (Planlama). _948166
700	1		_aJarvis, John J. _948167
700	1		_aSherali, Hanif D. _948168
999			_c119410 _d119410