Sample average approximation methods for stochastic MINLPs

One approach to process design with uncertain parameters is to formulate a stochastic MINLP. When there are many uncertain parameters, the number of samples becomes unmanageably large and computing the solution to the MINLP can be difficult and very time consuming. In this paper, two new algorithms (the optimality gap method (OGM) and the confidence level method (CLM)) are presented for solving convex stochastic MINLPs. At each iteration, the sample average approximation method is applied to the NLP sub-problem and MILP master problem. A smaller sample size problem is solved multiple times with different batches of i.i.d. samples to make decisions and a larger sample size problem (with continuous/discrete decision variables fixed) is solved to re-evaluate the objective values. In the first algorithm, the sample sizes are iteratively increased until the optimality gap intervals of the upper and lower bound are within a pre-specified tolerance. Instead of requiring a small optimality gap, the second algorithm uses tight bounds for comparing the objective values of NLP sub-problems and weak bounds for cutting off solutions in the MILP master problems, hence the confidence of finding the optimal discrete solution can be adjusted by the parameter used to tighten and weaken the bounds. The case studies show that the algorithms can significantly reduce the computational time required to find a solution with a given degree of confidence.

[1]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[2]  Zdravko Kravanja,et al.  Mixed-Integer Nonlinear Programming Problem Process Synthesis under Uncertainty by Reduced Dimensional Stochastic Optimization , 1999 .

[3]  Urmila M. Diwekar,et al.  An efficient sampling technique for off-line quality control , 1997 .

[4]  Urmila M. Diwekar,et al.  Efficient Combinatorial Optimization under Uncertainty. 1. Algorithmic Development , 2002 .

[5]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[6]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

[7]  Christodoulos A. Floudas,et al.  Stochastic programming in process synthesis: A two-stage model with MINLP recourse for multiperiod heat-integrated distillation sequences , 1992 .

[8]  Ignacio E. Grossmann,et al.  Optimal process design under uncertainty , 1983 .

[9]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[10]  Alexander Shapiro,et al.  The empirical behavior of sampling methods for stochastic programming , 2006, Ann. Oper. Res..

[11]  Efstratios N. Pistikopoulos,et al.  Uncertainty in process design and operations , 1995 .

[12]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[13]  Alexander Shapiro,et al.  Asymptotic analysis of stochastic programs , 1991, Ann. Oper. Res..

[14]  Zdravko Kravanja,et al.  The two-level strategy for MINLP synthesis of process flowsheets under uncertainty , 2000 .

[15]  Efstratios N. Pistikopoulos,et al.  Stochastic optimization based algorithms for process synthesis under uncertainty , 1998 .

[16]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..

[17]  Paul I. Barton,et al.  Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems , 2000 .

[18]  R. Tyrrell Rockafellar,et al.  Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming , 1993, Math. Oper. Res..

[19]  Efstratios N. Pistikopoulos,et al.  Computational studies of stochastic optimization algorithms for process synthesis under uncertainty , 1996 .