Global optimization of robust chance constrained problems Academic Article uri icon


  • We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume that the stochastic algorithm exhibits a weak*convergence to a probability measure assigning all its mass to the discretized problem. A diffusion process is derived that has this convergence property. In the second phase, the discretization is improved by solving another nonlinear programming problem. It is shown that the algorithm converges to the solution of the original problem. We discuss the numerical performance of the algorithm and its application to process design. 2007 Springer Science+Business Media, LLC.

published proceedings


author list (cited authors)

  • Parpas, P., Rustem, B., & Pistikopoulos, E. N.

citation count

  • 9

publication date

  • March 2009