Computational complexity of stochastic programming problems

Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast quantity of literature on the subject has appeared. Developments in the theory of computational complexity allow us to establish the theoretical complexity of a variety of stochastic programming problems studied in this literature. Under the assumption that the stochastic parameters are independently distributed, we show that two-stage stochastic programming problems are ♯P-hard. Under the same assumption we show that certain multi-stage stochastic programming problems are PSPACE-hard. The problems we consider are non-standard in that distributions of stochastic parameters in later stages depend on decisions made in earlier stages.

[1]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[2]  L. Stougie,et al.  Approximation in Stochastic integer programming , 2003 .

[3]  B. J. Lageweg,et al.  Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems , 1983, Math. Oper. Res..

[4]  Peter Kall,et al.  Stochastic Programming , 1995 .

[5]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[6]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[7]  Maarten Hendrikus van der Vlerk.  Stochastic programming with integer recourse , 1995 .

[8]  Leen Stougie.  Design and analysis of algorithms for stochastic integer programming , 1987 .

[9]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[10]  A. Ruszczynski.  Stochastic Programming Models , 2003 .

[11]  B ShmoysDavid,et al.  An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[14]  Martin E. Dyer,et al.  On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..

[15]  J. Lawrence.  Polytope volume computation , 1991 .

[16]  Roger J.-B. Wets,et al.  Stochastic Programming: Solution Techniques and Approximation Schemes , 1982, ISMP.

[17]  R. Wets,et al.  Stochastic programming , 1989 .

[18]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[19]  M. Dyer.  Computing the volume of convex bodies : a case where randomness provably helps , 1991 .

[20]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.