<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
<record>
  <controlfield tag="001">168</controlfield>
  <datafield tag="041" ind1="0" ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Carøe, Claus C.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">L-shaped decomposition of two-stage stochastic programs with integer recourse</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">We consider two-stage stochastic programming problems with integer recourse. The L-shaped method of stochastic linear programming is generalized to these problems by using generalized Benders decomposition. Nonlinear feasibility and optimality cuts are determined via general duality theory and can be generated when the second stage problem is solved by standard techniques. Finite convergence of the method is established when Gomory's fractional cutting plane algorithm or a branch-and-bound algorithm is applied..</subfield>
  </datafield>
  <datafield tag="594" ind1=" " ind2=" ">
    <subfield code="a">Article de fons.</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">Stochastic programming</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">Integer programming</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">Benders decomposition</subfield>
  </datafield>
  <datafield tag="653" ind1="1" ind2=" ">
    <subfield code="a">General duality theory</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">Article</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Tind, Jørgen</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="d">Elsevier</subfield>
    <subfield code="g">vol. 83 n. 3 (1998) p. 451-464</subfield>
    <subfield code="q">83:3&amp;amp;amp;lt;451</subfield>
    <subfield code="t">Mathematical Programming</subfield>
    <subfield code="x">0025-5610</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
    <subfield code="a">00255610v83n3p451</subfield>
  </datafield>
  <datafield tag="973" ind1=" " ind2=" ">
    <subfield code="f">451</subfield>
    <subfield code="l">464</subfield>
    <subfield code="m">11</subfield>
    <subfield code="n">3</subfield>
    <subfield code="v">83</subfield>
    <subfield code="x">00255610v83n3</subfield>
    <subfield code="y">1998</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">ARTPUB</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">info:eu-repo/semantics/article</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">info:eu-repo/semantics/publishedVersion</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="u">http://ddd.uab.cat/uab/matpro/00255610v83n3p451.pdf</subfield>
    <subfield code="p">14</subfield>
    <subfield code="s">650282</subfield>
  </datafield>
</record>
</collection>