Aspects of optimization with stochastic dominance

Abstract

We consider stochastic optimization problems with integral stochastic order constraints. This problem class is characterized by an infinite number of constraints indexed by a function space of increasing concave utility functions. We are interested in effective numerical methods and a Lagrangian duality theory. First, we show how sample average approximation and linear programming can be combined to provide a computational scheme for this problem class. Then, we compute the Lagrangian dual problem to gain more insight into this problem class.