On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse.

DOI10.1007/BF01193835zbMath1041.90521MaRDI QIDQ1298755

Georg Ch. Pflug, Rüdiger Schultz, Ruszczyński, Andrzej

Publication date: 5 October 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Constructive characterizations of the value-function of a mixed-integer program. I
• The Glivenko-Cantelli problem
• The value function of a mixed integer program: I
• Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
• Stochastic programming with simple integer recourse
• On structure and stability in stochastic programs with random technology matrix and complete integer recourse
• Stochastic programming approaches to stochastic scheduling
• Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
• Stability Results for Stochastic Programs and Sensors, Allowing for Discontinuous Objective Functions
• Rates of Convergence in Stochastic Programs with Complete Integer Recourse
• Convergence of stochastic processes