000			01528nam a22001697a 4500
008			120829t xxu||||| |||| 00| 0 eng d
020			_a0716715872
050			_aT57.74.C54
100			_aChvatal, Vasek
245			_aLinear programming. / _cVasek, Chvatall
260			_aU.S.A: _bW.H. Freeman and Company, _cc1983.
300			_axiii, 487 p.: _bill.; _c23cm.
500			_aIncludes bibliographical references and index.
505			_aContents: Basic theory: Introduction -- How the simplex method works -- Pitfalls and how to avoid them -- How fast is the simplex method -- The Duality theorem -- Gaussian elimination and matrices -- The Revised simplex method -- General LP problems: solution by the simplex method -- General LP problems: theorems on duality and infeasibility -- Sensitivity analysis -- Selected applications: Efficient allocation of scarce resources -- Scheduling production and inventory -- The Cutting-stock problem -- Approximating data by linear functions -- Matrix games -- Systems of linear inequalities -- Connections with geometry -- Finding all vertices of a polyhedron -- Network flow problems: The Network simplex method -- Applications of the network simplex method -- Upper-bounded transshipment problems -- Maximum flows through networks -- The Primal-dual method -- Advanced techniques: Updating a triangular factorization of the basis -- Generalized upper bounding -- The Dantzig-wolfe decomposition principle -- Appendix: The Ellipsoid method.
650			_bProgramming.
942			_2lcc _cBK
999			_c2233 _d9733