Global optimization of robust chance constrained problems

  • Authors:
  • Panos Parpas;Berç Rustem;Efstratios N. Pistikopoulos

  • Affiliations:
  • Department of Computing, Imperial College, London, UK SW7 2AZ;Department of Computing, Imperial College, London, UK SW7 2AZ;Centre for Process Systems Engineering, Imperial College, London, UK SW7 2AZ

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.