Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems

We propose the use of sequences of separable, piecewise linear approximations for solving nondifferentiable stochastic optimization problems. The approximations are constructed adaptively using a combination of stochastic subgradient information and possibly sample information on the objective function itself. We prove the convergence of several versions of such methods when the objective function is separable and has integer break points, and we illustrate their behavior on numerical examples. We then demonstrate the performance on nonseparable problems that arise in the context of two-stage stochastic programming problems, and demonstrate that these techniques provide near-optimal solutions with a very fast rate of convergence compared with other solution techniques.

[1]  Warren B. Powell,et al.  An algorithm for approximating piecewise linear concave functions from sample gradients , 2003, Oper. Res. Lett..

[2]  Warren B. Powell,et al.  Stochastic programs over trees with random arc capacities , 1994, Networks.

[3]  Andrzej Ruszczynski,et al.  A Linearization Method for Nonsmooth Stochastic Programming Problems , 1987, Math. Oper. Res..

[4]  Warren B. Powell,et al.  Stochastic Programming in Transportation and Logistics , 2003 .

[5]  Carlos S. Kubrusly,et al.  Stochastic approximation algorithms and applications , 1973, CDC 1973.

[6]  Warrren B Powell,et al.  An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution , 2001 .

[7]  Jing-Sheng Song,et al.  On "The Censored Newsvendor and the Optimal Acquisition of Information" , 2005, Oper. Res..

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

[9]  Linos F. Frantzeskakis,et al.  A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems , 1990, Transp. Sci..

[10]  Warren B. Powell,et al.  Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management , 1998, Transp. Sci..

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

[12]  LaporteGilbert,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993 .

[13]  Warren B. Powell,et al.  A Stochastic Model of the Dynamic Vehicle Allocation Problem , 1986, Transp. Sci..

[14]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[15]  Roger J.-B. Wets,et al.  Random LSC Functions: An Ergodic Theorem , 2001, Math. Oper. Res..

[16]  Yuri Ermoliev,et al.  Numerical techniques for stochastic optimization , 1988 .

[17]  Warrren B Powell,et al.  Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse , 1999 .

[18]  Stein W. Wallace.  A piecewise linear upper bound on the network recourse function , 1987, Math. Program..

[19]  G. Cohen,et al.  Decomposition/coordination algorithms in stochastic optimization , 1990 .

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

[21]  Warren B. Powell,et al.  Shape - a Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs , 2000, Oper. Res..

[22]  Yuri Ermoliev,et al.  Stochastic quasigradient methods. Numerical techniques for stochastic optimization , 1988 .

[23]  Andrzej Ruszczynski,et al.  Feasible direction methods for stochastic programming problems , 1980, Math. Program..

[24]  Evan L. Porteus.  Chapter 12 Stochastic inventory theory , 1990 .

[25]  Martin L. Puterman,et al.  The Censored Newsvendor and the Optimal Acquisition of Information , 2002, Oper. Res..

[26]  J. Birge,et al.  A separable piecewise linear upper bound for stochastic linear programs , 1988 .

[27]  Andrzej Ruszczyński,et al.  A method of feasible directions for solving nonsmooth stochastic programming problems , 1986 .

[28]  Alexander Shapiro,et al.  On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs , 2000, SIAM J. Optim..

[29]  Rhonda Righter,et al.  A Resource Allocation Problem in a Random Environment , 1989, Oper. Res..

[30]  Warren B. Powell,et al.  An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management , 1996, Oper. Res..

[31]  Warren B. Powell,et al.  A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM , 1988 .

[32]  Warren B. Powell,et al.  THE DYNAMIC VEHICLE ALLOCATION PROBLEM WITH UNCERTAIN DEMANDS , 1987 .

[33]  Stein W. Wallace,et al.  Solving stochastic programs with network recourse , 1986, Networks.

[34]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[35]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.