A Benders squared (B2) framework for infinite-horizon stochastic linear programs

We propose a nested decomposition scheme for infinite-horizon stochastic linear programs. Our approach can be seen as a provably convergent extension of stochastic dual dynamic programming to the infinite-horizon setting: we explore a sequence of finite-horizon problems of increasing length until we can guarantee convergence with a given confidence level. The methodology alternates between a forward pass to explore sample paths and determine trial solutions, and a backward pass to generate a polyhedral approximation of the optimal value function by computing subgradients from the dual of the scenario subproblems. A computational study on a large set of randomly generated instances for two classes of problems shows that the proposed algorithm is able to effectively solve instances of moderate size to high precision, provided that the instance structure allows the construction of what we call constant-statepolicies with satisfactory objective function value.

[1]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[2]  J. Mulvey,et al.  Stochastic network programming for financial planning problems , 1992 .

[3]  John M. Mulvey,et al.  Solving multistage stochastic networks: An application of scenario aggregation , 1991, Networks.

[4]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[5]  Horand I. Gassmann,et al.  Mslip: A computer code for the multistage stochastic linear programming problem , 1990, Math. Program..

[6]  Gerd Infanger,et al.  Cut sharing for multistage stochastic linear programs with interstage dependency , 1996, Math. Program..

[7]  R. J. Duffin,et al.  An Infinite Linear Program with a Duality Gap , 1965 .

[8]  Erlon Cristian Finardi,et al.  Improving the performance of Stochastic Dual Dynamic Programming , 2015, J. Comput. Appl. Math..

[9]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[10]  John R. Birge,et al.  The Abridged Nested Decomposition Method for Multistage Stochastic Linear Programs with Relatively Complete Recourse , 2006, Algorithmic Oper. Res..

[11]  Robert L. Smith,et al.  Finite dimensional approximation in infinite dimensional mathematical programming , 1992, Math. Program..

[12]  John R. Birge,et al.  Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs , 1985, Oper. Res..

[13]  Alexander Shapiro,et al.  Analysis of stochastic dual dynamic programming method , 2011, Eur. J. Oper. Res..

[14]  M. V. F. Pereira,et al.  Multi-stage stochastic optimization applied to energy planning , 1991, Math. Program..

[15]  Teemu Pennanen.  Financial Optimization , 2006, OR.

[16]  J. Birge,et al.  A multicut algorithm for two-stage stochastic linear programs , 1988 .

[17]  Robert L. Smith,et al.  Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs , 2009, Manuf. Serv. Oper. Manag..

[18]  Warren B. Powell,et al.  Regularized Decomposition of High-Dimensional Multistage Stochastic Programs with Markov Uncertainty , 2015, SIAM J. Optim..

[19]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[20]  Vincent Guigues,et al.  SDDP for some interstage dependent risk-averse problems and application to hydro-thermal planning , 2014, Comput. Optim. Appl..

[21]  S. Zenios.  Financial optimization: Models , 1993 .

[22]  Pierre Girardeau,et al.  On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs , 2015, Math. Oper. Res..

[23]  Laurent Pfeiffer,et al.  Two methods of pruning Benders' cuts and their application to the management of a gas portfolio , 2012 .

[24]  Xu Andy Sun,et al.  Nested Decomposition of Multistage Stochastic Integer Programs with Binary State Variables , 2016 .

[25]  Weini Zhang,et al.  Water Network Design and Management via Stochastic Programming , 2013 .

[26]  Werner Römisch,et al.  Scenario tree modeling for multistage stochastic programs , 2009, Math. Program..

[27]  Gilbert Laporte,et al.  Shared mobility systems , 2015, 4OR.

[28]  R. Bellman.  Dynamic programming. , 1957, Science.

[29]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[30]  Robert L. Smith,et al.  Duality in infinite dimensional linear programming , 1992, Math. Program..

[31]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[32]  Richard Grinold,et al.  Finite horizon approximations of infinite horizon linear programs , 1977, Math. Program..

[33]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[34]  Sanjay Mehrotra,et al.  A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management , 2015, Oper. Res..