Discrete approximation and convergence analysis for a class of decision-dependent two-stage stochastic linear programs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A comment on ``Computational complexity of stochastic programming problems
Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
Optimization of R\&D project portfolios under endogenous uncertainty
A class of stochastic programs with decision dependent random elements
Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
Foundations of quantization for probability distributions
Decision-dependent probabilities in stochastic programs with recourse
Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
Computational complexity of stochastic programming problems
A class of stochastic programs with decision dependent uncertainty
The Sample Average Approximation Method for Stochastic Discrete Optimization
Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems
Multistage Stochastic Optimization
The Methods of Distances in the Theory of Probability and Statistics
Introduction to Stochastic Programming
On-Line Optimization of Simulated Markovian Processes
Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
The Theory of Moral Hazard and Unobservable Behaviour: Part I
Regularized Two-Stage Stochastic Variational Inequalities for Cournot-Nash Equilibrium Under Uncertainty
Discrete Approximation and Quantification in Distributionally Robust Optimization
Quantitative Stability in Stochastic Programming: The Method of Probability Metrics

This page was built for publication: Discrete approximation and convergence analysis for a class of decision-dependent two-stage stochastic linear programs