Global optimization of robust chance constrained problems
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.
Unable to display preview. Download preview PDF.
- 2.Birge J. and Louveaux F. (1997). Introduction to Stochastic Programming. Springer Series in Operations Research, Springer-Verlag, New York Google Scholar
- 3.Dupačová, J., Consigli, G., Wallace, S.: Scenarios for multistage stochastic programs. Ann. Oper. Res. 100, 25–53 (2001), 2000Google Scholar
- 5.Floudas, C.: Deterministic Global Optimization. Nonconvex Optimization and its Applications, vol. 37. Kluwer Academic Publishers, Theory, Methods and Applications, Dordrecht (2000)Google Scholar
- 6.Floudas C., Pardalos P., Adjiman C., Esposito W., Gümüş Z., Harding S., Klepeis J., Meyer C. and Schweiger C. (1999). Handbook of Test Problems in local and Global Optimization. Nonconvex Optimization and its Applications, vol. 33. Kluwer Academic Publishers, Dordrecht Google Scholar
- 8.Rönnqvist, M.: Modelling techniques for nonlinear pooling problems. In: From Local to Global Optimization (Rimforsa, 1997). Nonconvex Optim. Appl., vol. 53, pp. 85–103. Kluwer Academic Publications, Dordrecht (2001)Google Scholar
- 12.Adjiman C., Androulakis I. and Floudas C. (1997). Global optimization of minlp problems in process synthesis and design. Comput. Chem. Eng. 21: 455–450 Google Scholar
- 13.Karlin S. and Studden W. (1966). Tchebycheff Systems: With Applications in Analysis and Statistics. Pure and Applied Mathematics, vol. XV. Interscience Publishers John Wiley & Sons, New York Google Scholar
- 17.Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly. In: Positive Polynomials in Control. Lecture Notes in Control and Inform. Sci., vol. 312, pp. 293–310. Springer, Berlin (2005)Google Scholar
- 18.Parpas, P.: Constrained global optimization and stochastic differential equations. Technical Report, Department of Computing, Imperial College London, (2007)Google Scholar
- 23.Martínez, J., Pilotta, E.: Inexact restoration methods for nonlinear programming: advances and perspectives. In: Optimization and Control with Applications. Applied Optimization, vol. 96, pp. 271–291. Springer, New York (2005)Google Scholar
- 26.Gidas, B.: The Langevin equation as a global minimization algorithm. In: Disordered systems and biological organization (Les Houches, 1985). NATO Adv. Sci. Inst. Ser. F Comput. Systems Sci., vol. 20, pp. 321–326. Springer, Berlin (1986)Google Scholar
- 30.Lasota, A., Mackey, M.: Chaos, Fractals, and Noise. Applied Mathematical Sciences, vol. 97, 2nd edn., Stochastic aspects of dynamics. Springer-Verlag, New York (1994)Google Scholar