{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:48:15Z","timestamp":1771048095221,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-20-1-0006"],"award-info":[{"award-number":["FA9550-20-1-0006"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"crossref","award":["CMMI 1538605"],"award-info":[{"award-number":["CMMI 1538605"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006146","name":"Office of Naval Reactors","doi-asserted-by":"publisher","award":["N00014-20-1-2077"],"award-info":[{"award-number":["N00014-20-1-2077"]}],"id":[{"id":"10.13039\/100006146","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10287-021-00400-0","type":"journal-article","created":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T12:02:32Z","timestamp":1627732952000},"page":"65-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Predictive stochastic programming"],"prefix":"10.1007","volume":"19","author":[{"given":"Yunxiao","family":"Deng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6285-8833","authenticated-orcid":false,"given":"Suvrajeet","family":"Sen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"400_CR1","unstructured":"Atakan S, Gangammanavar H, Sen S (2021) Operations planning experiments for power systems with high renewable resources. USC Epstein Dept. Working Paper"},{"key":"400_CR2","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1287\/mnsc.2016.2644","volume":"64","author":"GY Ban","year":"2019","unstructured":"Ban GY, El Karoui N, Lim AEB (2019) Machine learning and portfolio optimization. Manag Sci 64:1136\u20131154","journal-title":"Manag Sci"},{"key":"400_CR3","first-page":"90","volume":"67","author":"GY Ban","year":"2019","unstructured":"Ban GY, Rudin C (2019) The big data newsvendor: practical insights from machine learning. Manag Sci 67:90\u2013108","journal-title":"Manag Sci"},{"issue":"4","key":"400_CR4","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1287\/opre.1110.0926","volume":"59","author":"G Bayraksan","year":"2011","unstructured":"Bayraksan G, Morton DP (2011) A sequential sampling procedure for stochastic programming. Operations Res 59(4):898\u2013913","journal-title":"Operations Res"},{"issue":"4","key":"400_CR5","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1137\/090773143","volume":"22","author":"G Bayraksan","year":"2012","unstructured":"Bayraksan G, Pierre-Louis P (2012) Fixed-width sequential stopping rules for a class of stochastic programs. SIAM J Optim 22(4):1518\u20131548","journal-title":"SIAM J Optim"},{"key":"400_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM","DOI":"10.1137\/1.9780898718829"},{"key":"400_CR7","unstructured":"Bertsekas DP (2012) Dynamic programming and optimal control. No. v. 2 in Athena Scientific optimization and computation series, Athena Scientific"},{"issue":"3","key":"400_CR8","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/mnsc.2018.3253","volume":"66","author":"D Bertsimas","year":"2020","unstructured":"Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Manag Sci 66(3):1025\u20131044","journal-title":"Manag Sci"},{"issue":"1","key":"400_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/opre.2015.1436","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas D, King A (2016) OR FORUM-An algorithmic approach to linear regression. Operations Res 64(1):2\u201316","journal-title":"Operations Res"},{"issue":"2","key":"400_CR10","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1287\/opre.1060.0360","volume":"55","author":"D Bertsimas","year":"2007","unstructured":"Bertsimas D, Shioda R (2007) Classification and regression via integer optimization. Operations Res 55(2):252\u2013271","journal-title":"Operations Res"},{"issue":"1","key":"400_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim Melvyn (2004) The price of robustness. Operations Res 52(1):35\u201353","journal-title":"Operations Res"},{"key":"400_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge JR, Louveaux F (2011) Introduction to stochastic programming. Springer Science Business Media, Berlin"},{"key":"400_CR13","unstructured":"Blundell C, Cornebise J, Kavukcuoglu K, Wierstra D (2015) Weight uncertainty in neural networks. arXiv preprint arXiv:1505.05424"},{"key":"400_CR14","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.ijdrr.2017.01.017","volume":"24","author":"C Boonmee","year":"2017","unstructured":"Boonmee C, Arimura M, Asada T (2017) Facility location optimization model for emergency humanitarian logistics. Int J Disaster Risk Reduct 24:485\u2013498","journal-title":"Int J Disaster Risk Reduct"},{"issue":"3","key":"400_CR15","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.1040.0094","volume":"29","author":"DP DE Farias","year":"2004","unstructured":"DE Farias DP, Van Roy B (2004) On constraint sampling in the linear programming approach to approximate dynamic programming. Math Operations Res 29(3):462\u2013478","journal-title":"Math Operations Res"},{"key":"400_CR16","doi-asserted-by":"crossref","unstructured":"Deng Y, Liu J, Sen S (2018) Coalescing data and decisions for analytics. Doug S (eds) Tutorials in Operations Research: Recent Advances in Optimization and Modeling of Contemporary Problems, chap.\u00a02. INFORMS, Catonsville, MD, 20\u201349","DOI":"10.1287\/educ.2018.0185"},{"key":"400_CR17","first-page":"3571","volume-title":"Simple recourse problem","author":"S Dye","year":"2009","unstructured":"Dye S (2009) Simple recourse problem. Springer, US, Boston, MA, pp 3571\u20133575"},{"key":"400_CR18","doi-asserted-by":"crossref","unstructured":"Frazier P (2012) Optimization via simulation with bayesian statistics and dynamic programming. Proceedings of the Winter Simulation Conference. Winter Simulation Conference, 7","DOI":"10.1109\/WSC.2012.6465237"},{"issue":"1","key":"400_CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10589-010-9322-x","volume":"51","author":"MB Freimer","year":"2012","unstructured":"Freimer MB, Linderoth JT, Thomas DJ (2012) The impact of sampling methods on bias and variance in stochastic linear programs. Comput Optim Appl 51(1):51\u201375","journal-title":"Comput Optim Appl"},{"issue":"6","key":"400_CR20","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.jspi.2013.01.004","volume":"143","author":"J Frey","year":"2013","unstructured":"Frey J (2013) Data-driven nonparametric prediction intervals. J Stat Plan Inference 143(6):1039\u20131048","journal-title":"J Stat Plan Inference"},{"issue":"1\u20132","key":"400_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10107-012-0621-0","volume":"138","author":"PW Glynn","year":"2013","unstructured":"Glynn PW, Infanger G (2013) Simulation-based confidence bounds for two-stage stochastic programs. Math Program 138(1\u20132):15\u201342","journal-title":"Math Program"},{"key":"400_CR22","volume-title":"The elements of statistical learning: data mining, inference, and prediction","author":"TJ Hastie","year":"2011","unstructured":"Hastie TJ, Tibshirani RJ, Friedman JH (2011) The elements of statistical learning: data mining, inference, and prediction. Springer, Berlin"},{"issue":"3","key":"400_CR23","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.16.3.650","volume":"16","author":"JL Higle","year":"1991","unstructured":"Higle JL, Sen S (1991) Stochastic decomposition: an algorithm for two-stage linear programs with recourse. Math Operations Res 16(3):650\u2013669","journal-title":"Math Operations Res"},{"issue":"1\u20133","key":"400_CR24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01582219","volume":"67","author":"JL Higle","year":"1994","unstructured":"Higle JL, Sen S (1994) Finite master programs in regularized stochastic decomposition. Math Program 67(1\u20133):143\u2013168","journal-title":"Math Program"},{"issue":"2","key":"400_CR25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02592155","volume":"75","author":"JL Higle","year":"1996","unstructured":"Higle JL, Sen S (1996) Duality and statistical tests of optimality for two stage stochastic programs. Math Program 75(2):257\u2013275","journal-title":"Math Program"},{"key":"400_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4115-8","volume-title":"Stochastic decomposition","author":"JL Higle","year":"1996","unstructured":"Higle JL, Sen S (1996) Stochastic decomposition. Springer, Berlin"},{"key":"400_CR27","volume-title":"Introduction to operations research","author":"FS Hillier","year":"2012","unstructured":"Hillier FS, Lieberman GJ (2012) Introduction to operations research. Tata McGraw-Hill Education, New York"},{"issue":"1","key":"400_CR28","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.sorms.2014.05.001","volume":"19","author":"T Homem-de-Mello","year":"2014","unstructured":"Homem-de-Mello T, Bayraksan G (2014) Monte carlo sampling-based methods for stochastic optimization. Surv Operations Res Manag Sci 19(1):56\u201385","journal-title":"Surv Operations Res Manag Sci"},{"key":"400_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to statistical learning","author":"G James","year":"2013","unstructured":"James G, Witten D, Hastie T, Tibshirani R (2013) An Introduction to statistical learning. Springer, Berlin"},{"issue":"3","key":"400_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0165-1765(80)90024-5","volume":"6","author":"CM Jarque","year":"1980","unstructured":"Jarque CM, Bera AK (1980) Efficient tests for normality, homoscedasticity and serial independence of regression residuals. Econ Lett 6(3):255\u2013259","journal-title":"Econ Lett"},{"key":"400_CR31","unstructured":"Kao YH, Van\u00a0Roy B, Yan X (2009) Directed regression. Proceedings of the Neural Information Processing Conference. NIPS, 889\u2013897"},{"issue":"2","key":"400_CR32","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt AJ, Shapiro A, Homem-de-Mello T (2002) The sample average approximation method for stochastic discrete optimization. SIAM J Optim 12(2):479\u2013502","journal-title":"SIAM J Optim"},{"issue":"260","key":"400_CR33","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/01621459.1952.10483441","volume":"47","author":"WH Kruskal","year":"1952","unstructured":"Kruskal WH, Wallis WA (1952) Use of ranks in one-criterion variance analysis. J Am Stat Assoc 47(260):583\u2013621","journal-title":"J Am Stat Assoc"},{"key":"400_CR34","doi-asserted-by":"crossref","unstructured":"Kulis B et\u00a0al. (2013) Metric learning: A survey. Foundations and Trends\u00ae in Machine Learning 5(4) 287\u2013364","DOI":"10.1561\/2200000019"},{"issue":"1","key":"400_CR35","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J Linderoth","year":"2006","unstructured":"Linderoth J, Shapiro A, Wright S (2006) The empirical behavior of sampling methods for stochastic programming. Ann Operations Res 142(1):215\u2013241","journal-title":"Ann Operations Res"},{"key":"400_CR36","doi-asserted-by":"crossref","unstructured":"Liu J, Li G, Sen S (2021) Coupled learning enabled stochastic programming with endogenous uncertainty. Mathematics of Operations Research (accepted)","DOI":"10.1287\/moor.2021.1185"},{"key":"400_CR37","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/19M1247796","volume":"30","author":"J Liu","year":"2020","unstructured":"Liu J, Sen S (2020) Asymptotic results for two-stage stochastic quadratic programming. SIAM J Optim 30:823\u2013854","journal-title":"SIAM J Optim"},{"issue":"4","key":"400_CR38","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.orl.2004.08.003","volume":"33","author":"LH Liyanage","year":"2005","unstructured":"Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Operations Res Lett 33(4):341\u2013348","journal-title":"Operations Res Lett"},{"issue":"1","key":"400_CR39","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"WK Mak","year":"1999","unstructured":"Mak WK, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Operations Res Lett 24(1):47\u201356","journal-title":"Operations Res Lett"},{"issue":"1","key":"400_CR40","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/opre.1100.0847","volume":"59","author":"N Miller","year":"2011","unstructured":"Miller N, Ruszczy\u0144ski A (2011) Risk-averse two-stage stochastic linear programming: Modeling and decomposition. Operations Res 59(1):125\u2013132","journal-title":"Operations Res"},{"key":"400_CR41","unstructured":"Pawlowski N, Rajchl M, Glocker B (2017) Implicit weight uncertainty in neural networks. arXiv preprint arXiv:1711.01297"},{"key":"400_CR42","doi-asserted-by":"crossref","DOI":"10.1002\/9781118029176","volume-title":"Approximate dynamic programming: solving the curses of dimensionality","author":"WB Powell","year":"2011","unstructured":"Powell WB (2011) Approximate dynamic programming: solving the curses of dimensionality, vol 842. John Wiley & Sons, Hoboken"},{"key":"400_CR43","volume-title":"Linear models in statistics","author":"AC Rencher","year":"2008","unstructured":"Rencher AC, Schallje GB (2008) Linear models in statistics. Wiley Interscience, Hoboken"},{"issue":"2","key":"400_CR44","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10287-015-0230-5","volume":"12","author":"I Rios","year":"2015","unstructured":"Rios I, Wets RJB, Woodruff DL (2015) Multi-period forecasting and scenario generation with limited data. Comput Manag Sci 12(2):267\u2013295","journal-title":"Comput Manag Sci"},{"issue":"3","key":"400_CR45","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1287\/opre.2013.1163","volume":"61","author":"JO Royset","year":"2013","unstructured":"Royset JO, Szechtman R (2013) Optimal budget allocation for sample average approximation. Operations Res 61(3):762\u2013776","journal-title":"Operations Res"},{"key":"400_CR46","doi-asserted-by":"crossref","unstructured":"Royset JO, Wets RJB (2014) From data to assessments and decisions: Epi-spline technology. Tutorials in Operations Research: Bridging Data and Decisions. INFORMS, 27\u201353","DOI":"10.1287\/educ.2014.0126"},{"issue":"1","key":"400_CR47","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.1110.0999","volume":"60","author":"IO Ryzhov","year":"2012","unstructured":"Ryzhov IO, Powell WB, Frazier PI (2012) The knowledge gradient algorithm for a general class of online learning problems. Operations Res 60(1):180\u2013195","journal-title":"Operations Res"},{"issue":"6","key":"400_CR48","doi-asserted-by":"crossref","first-page":"1422","DOI":"10.1287\/opre.2016.1526","volume":"64","author":"S Sen","year":"2016","unstructured":"Sen S, Liu Y (2016) Mitigating uncertainty via compromise decisions in two-stage stochastic linear programming: variance reduction. Operations Res 64(6):1422\u20131437","journal-title":"Operations Res"},{"issue":"1","key":"400_CR49","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/120864854","volume":"24","author":"S Sen","year":"2014","unstructured":"Sen S, Zhou Z (2014) Multistage stochastic decomposition: a bridge between stochastic programming and approximate dynamic programming. SIAM J Optim 24(1):127\u2013153","journal-title":"SIAM J Optim"},{"key":"400_CR50","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on stochastic programming","author":"A Shapiro","year":"2009","unstructured":"Shapiro A, Dentcheva D, Ruszczynski A (2009) Lectures on stochastic programming, vol 10. SIAM, Philadelphia"},{"issue":"3","key":"400_CR51","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01580086","volume":"81","author":"A Shapiro","year":"1998","unstructured":"Shapiro A, Homem-de-Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math Program 81(3):301\u2013325","journal-title":"Math Program"},{"key":"400_CR52","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3678","author":"BPG Van Parys","year":"2020","unstructured":"Van Parys BPG, Esfahani PM, Kuhn D (2020) From data to decisions: distributionally robust optimization is optimal. Manag Sci. https:\/\/doi.org\/10.1287\/mnsc.2020.3678","journal-title":"Manag Sci"},{"issue":"4","key":"400_CR53","doi-asserted-by":"crossref","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao L, Zhang T (2014) A proximal stochastic gradient method with progressive variance reduction. SIAM J Optim 24(4):2057\u20132075","journal-title":"SIAM J Optim"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-021-00400-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10287-021-00400-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-021-00400-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T17:13:51Z","timestamp":1643130831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10287-021-00400-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,31]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["400"],"URL":"https:\/\/doi.org\/10.1007\/s10287-021-00400-0","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,31]]},"assertion":[{"value":"31 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}