عنوان
پدید آورنده
موضوع
رده
T 57.74 .B39 2010
T
57
.
74
.
B39
2010
کتابخانه
محل استقرار
English
Linear programming and network flows
Hoboken, N.J.
John Wiley & Sons
c2010
xiv, 748 p. : ill.
Includes bibliographical references and index
Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
1
2
1
Linear 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
، Linear programming
، Network analysis )Planning(
519
.
7/2
T
57
.
74
.
B39
2010
Bazaraa, M. S.
AU
AU Jarvis, John J
AU Sherali, Hanif D 1952-
TI
