<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Linear programming</title>
  </titleInfo>
  <name type="personal">
    <namePart>Chvatal, Vasek</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">xxu</placeTerm>
    </place>
    <place>
      <placeTerm type="text">U.S.A</placeTerm>
    </place>
    <publisher>W.H. Freeman and Company</publisher>
    <dateIssued>c1983</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>xiii, 487 p.: ill.; 23cm.</extent>
  </physicalDescription>
  <tableOfContents>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. </tableOfContents>
  <note type="statement of responsibility">Vasek, Chvatall</note>
  <note>Includes bibliographical references and  index.</note>
  <subject>
    <topic>Programming</topic>
  </subject>
  <classification authority="lcc">T57.74.C54</classification>
  <identifier type="isbn">0716715872</identifier>
  <recordInfo>
    <recordCreationDate encoding="marc">120829</recordCreationDate>
  </recordInfo>
</mods>
