Computational strategies for non‐convex multistage MINLP models with decision‐dependent uncertainty and gradual uncertainty resolution

In many planning problems under uncertainty the uncertainties are decision‐dependent and resolve gradually depending on the decisions made. In this paper, we address a generic non‐convex MINLP model for such planning problems where the uncertain parameters are assumed to follow discrete distributions and the decisions are made on a discrete time horizon. In order to account for the decision‐dependent uncertainties and gradual uncertainty resolution, we propose a multistage stochastic programming model in which the non‐anticipativity constraints in the model are not prespecified but change as a function of the decisions made. Furthermore, planning problems consist of several scenario subproblems where each subproblem is modeled as a nonconvex mixed‐integer nonlinear program. We propose a solution strategy that combines global optimization and outer‐approximation in order to optimize the planning decisions. We apply this generic problem structure and the proposed solution algorithm to several planning problems to illustrate the efficiency of the proposed method with respect to the method that uses only global optimization.