Chvatal, Vasek
Linear programming. / Vasek, Chvatall - U.S.A: W.H. Freeman and Company, c1983. - xiii, 487 p.: ill.; 23cm.
Includes bibliographical references and index.
Contents: 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.
0716715872
Programming.
T57.74.C54
Linear programming. / Vasek, Chvatall - U.S.A: W.H. Freeman and Company, c1983. - xiii, 487 p.: ill.; 23cm.
Includes bibliographical references and index.
Contents: 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.
0716715872
Programming.
T57.74.C54