Abstract.
We consider nonlinear stochastic optimization 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received: August 2003/Final version received: January 2004
Research supported by the NSF awards DMS-0303545 and DMS-0303728.
Rights and permissions
About this article
Cite this article
Dentcheva, D., Lai, B. & Ruszczyński, A. Dual methods for probabilistic optimization problems*. Math Meth Oper Res 60, 331–346 (2004). https://doi.org/10.1007/s001860400371
Issue Date:
DOI: https://doi.org/10.1007/s001860400371