Stochastic Programs with Incomplete Information

This paper treats a simple recourse problem. We consider the problem of reducing the feasible set into a smaller efficient set when partial information about the random parameters is known. We analyze some examples and give applications to stochastic programs with compete information.