This chapter describes PySP, a stochastic programming extension to Pyomo. PySP enables the expression of stochastic programming problems as extensions of deterministic models, which are often formulated first. To formulate a stochastic program in PySP, the user specifies both the deterministic base model and the scenario tree with associated uncertain parameters in Pyomo. Given these two models, PySP provides two paths for solving the corresponding stochastic program. The first alternative involves PySP writing the extensive form and invoking a standard deterministic solver. For more complex stochastic programs, PySP includes an implementation of Rockafellar and Wets’ Progressive Hedging algorithm, which provides an effective heuristic for approximating general multi-stage, mixed-integer stochastic programs. By leveraging the combination of a high-level programming language and the embedding of the base deterministic model in that language, PySP provides completely generic and highly configurable solver implementations.
CITATION STYLE
Hart, W. E., Laird, C. D., Watson, J. P., Woodruff, D. L., Hackebeil, G. A., Nicholson, B. L., & Siirola, J. D. (2017). Stochastic programming extensions. In Springer Optimization and Its Applications (Vol. 67, pp. 165–199). Springer International Publishing. https://doi.org/10.1007/978-3-319-58821-6_10
Mendeley helps you to discover research relevant for your work.