Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming
- 388 Downloads
We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at each stage), in response to observation of one or more random variables (uncertain parameters). The case that the time at which each observation occurs is decision-dependent, known as stochastic programming with endogeneous observation of uncertainty, presents particular challenges in handling non-anticipativity. Although such stochastic programs can be tackled by using binary variables to model the time at which each endogenous uncertain parameter is observed, the consequent conditional non-anticipativity constraints form a very large class, with cardinality in the order of the square of the number of scenarios. However, depending on the properties of the set of scenarios considered, only very few of these constraints may be required for validity of the model. Here we characterize minimal sufficient sets of non-anticipativity constraints, and prove that their matroid structure enables sets of minimum cardinality to be found efficiently, under general conditions on the structure of the scenario set.
KeywordsStochastic programming Endogeneous uncertainty Multistage stochastic programming
The authors are very grateful to BHP Billiton Ltd. and in particular to Merab Menabde, Peter Stone, and Mark Zuckerberg for their support of the mining-related research that inspired this work. We also thank Hamish Waterer and Laana Giles for useful discussions in the early stages of the research, and thank Hamish for his helpful suggestions and proof-reading of early versions of this paper. We are most grateful to Ignacio Grossmann for his advice and encouragement in completing the paper. This research would not have been possible without the support of the Australian Research Council, grant LP0561744. Finally, the efforts of two anonymous reviewers in improving the paper were greatly appreciated.
- 2.Asamov, T., Ruszczynński, A.: Time-consistent approximations of risk-averse multistage stochastic optimization problems. Math. Progr. 1–35 (2014). doi: 10.1007/s10107-014-0813-x
- 3.Bertsimas, D., Georghiou, A.: Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Oper. Res. 1–18 (2015). doi: 10.1287/opre.2015.1365
- 5.Boland, N., Dumitrescu, I., Froyland, G.: A multistage stochastic programming approach to open pit mine production scheduling with uncertain geology. Optim. Online (2008). http://www.optimization-online.org/DB_FILE/2008/10/2123.pdf
- 11.Georghiou, A., Wiesemann, W., Kuhn, D.: Generalized decision rule approximations for stochastic programming via liftings. Math. Progr. 1–38 (2014). doi: 10.1007/s10107-014-0789-6
- 12.Giles, L.: A Multi-stage Stochastic Model for Hydrogeological Optimisation, Masters Thesis, Department of Engineering Science, The University of Auckland (2009)Google Scholar
- 17.Gupta, V.: Modeling and Computational Strategies for Optimal Oilfield Development Planning Under Fiscal Rules and Endogenous Uncertainties, PhD Thesis, Carnegie Mellon University (2013)Google Scholar
- 22.Kozmík, V., Morton, D.P.: Evaluating policies in risk-averse stochastic dual dynamic programming. Math. Progr. 1–26 (2014). doi: 10.1007/s10107-014-0787-8
- 25.Ruszczyński, A.: Decomposition methods. In: Ruszczyński, A., Shapiro, A. (eds.) Stochastic Programming, Handbook in OR & MS, vol. 10. North-Holland Publishing Company, Amsterdam (2003)Google Scholar
- 32.Shapiro, A., Dentcheva, D., Ruszczyski, A.P.: Lectures on Stochastic Programming: Modeling and Theory, Vol. 9. SIAM (2009)Google Scholar
- 38.Vayanos, P., Kuhn, D., Rustem, B.: Decision rules for information discovery in multi-stage stochastic programming. In: Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC–ECC), Orlando, FL, December 12-15, 2011, pp. 7368–7373Google Scholar