000			01175 a2200205 4500
003			NUST
005			20220801133140.0
020			_a0471485993
020			_a9780471485995
082			_a519.72,BAZ
100	1		_aBazaraa, Mokhtar S. _98787
245	1	0	_aLinear Programming and Network Flows / _cMokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali.
250			_a3rd ed.
260			_a[S.l.] : _bWiley-Interscience, _c2004.
300			_a744 p. ; _c24 cm.
505			_aIntroduction (Page-1), Linear Algebra, Convex Analysis, and Polyhedral Sets (Page-43), The Simplex Method (Page-89), Starting Solution and Convergence (Page-149), Special Simplex Implementations and Optimality Conditions (Page-197), Duality and Sensitivity Analysis (Page-255), The Decomposition Principle (Page-333), Complexity of the Simplex Algorithms (Page-383), Minimal-Cost Network Flows (Page-445), The Transportation and Assignment Problems (Page-505), The Out-of-Kilter Algorithm (Page-555), Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems (Page-595).
700	1		_aJarvis, John J. _98788
700	1		_aSherali, Hanif D. _98789
942			_cREF _k519.72 BAZ _2ddc
999			_c176940 _d176940