2003-10-20Buch DOI: 10.18452/8307
Efficient point methods for probabilistic optimization problems
We consider nonlinear stochastic programming problems with probabilistic constraints. The concept of a p-efficient point of a probability distribution is used to derive equivalent problem formulations, and necessary and sufficient optimality conditions. We analyze the dual functional and its subdifferential. Two numerical methods are developed based on approximations of the p-efficient frontier. The algorithms yield an optimal solution for problems involving r-concave probability distributions. For arbitrary distributions, the algorithms provide upper and lower bounds for the optimal value and nearly optimal solutions. The operation of the methods is illustrated on a cash matching problem with a probabilistic liquidity constraint.
Is Part Of Series: Mathematical methods of operations research, 60, 2, 2004