Abstract

In this paper we examine a class of stochastic optimization problems characterized by nondifferentiability of the objective function. It is shown that in many cases the expected value of the objective function is differentiable and thus the resulting optimization problem can be analyzed and solved by using classical analytical or numerical methods. The results are subsequently applied to the solution of a class of stochastic programming problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call