Solving Nonlinear Programming Problems with Stochastic Objective Functions

In many nonlinear programming applications the objective function has an inherent uncertainty that depends upon a set of random variables that have a known distribution. If one wishes to optimize the expectation of the objective, as suggested by the expected utility theorem, then as is shown here one can often solve such problems by modifying standard nonlinear programming algorithms. To illustrate what is involved, the details and justification for the application of the interior parametric sequential unconstrained maximization technique and the generalized programming method for the solution of such problems are given. Some related problems with stochastic constraints for which the solution method applies are mentioned and an example of a portfolio selection problem is given.