L-shaped decomposition of two-stage stochastic programs with integer recourse

@article{Care1998LshapedDO,
  title={L-shaped decomposition of two-stage stochastic programs with integer recourse},
  author={Claus C. Car\oe and J\orgen Tind},
  journal={Math. Program.},
  year={1998},
  volume={83},
  pages={451-464}
}
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… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
75 Extracted Citations
11 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 75 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 11 references

Multilevel optimization: A common framework for decomposition in general mathematical programming (Publication no

  • J Tind
  • Multilevel optimization: A common framework for…
  • 1993

\The integer L-shaped method for stochastic integer programs with complete recourse

  • G Laporte, F V Louveaux
  • Operations Research Letters
  • 1993

\A resource decomposition algorithm for general mathematical programs

  • L A Wolsey
  • Mathematical Programming Study
  • 1981

Similar Papers

Loading similar papers…