论文信息 - Stochastic Programs with Incomplete Information

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.

Aharon Ben-Tal | Eithan Hochman

[1] A. Ben-Tal,et al. More bounds on the expectation of a convex function of a random variable , 1972, Journal of Applied Probability.

[2] M. Rothschild,et al. Increasing risk II: Its economic consequences , 1971 .

[3] Mordecai Avriel,et al. The Value of Information and Stochastic Programming , 1970, Oper. Res..

[4] William T. Ziemba. Computational Algorithms for Convex Stochastic Programs with Simple Recourse , 1970, Oper. Res..

[5] A. Sandmo. On the theory of the competitive firm under price uncertainty , 1971 .

[6] Olvi L. Mangasarian. Nonlinear Programming Problems with Stochastic Objective Functions , 1964 .

[7] J. Hammond. Simplifying the Choice between Uncertain Prospects Where Preference is Nonlinear , 1974 .