01477nam a22001457a 4500008004100000020001500041050001500056100001900071245004300090260004600133300003200179500005200211505105100263650001701314120829t        xxu||||| |||| 00| 0 eng d  a0716715872  aT57.74.C54  aChvatal, Vasek  aLinear programming. /cVasek, Chvatall  aU.S.A:bW.H. Freeman and Company,cc1983.  axiii, 487 p.:bill.;c23cm.  aIncludes bibliographical references and  index.  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.   bProgramming.