Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction

References

• Bassok Y, Anupindi R, Akella R (1999) Single-period multiproduct inventory models with substitution. Oper. Res. 47(4):632–642.Link, Google Scholar
• Bayraksan G, Morton DP (2011) A sequential sampling procedure for stochastic programming. Oper. Res. 59(4):898–913.Link, Google Scholar
• Birge JR, Louveaux FV (2011) Introduction to Stochastic Programming (Springer, New York).Crossref, Google Scholar
• Chen X, Sim M, Sun P, Zhang J (2008) A linear decision-based approximation approach to stochastic programming. Oper. Res. 56(2):344–357.Link, Google Scholar
• Efron B (1979) Bootstrap methods: Another look at the jackknife. Ann. Statist. 7(1):1–26.Crossref, Google Scholar
• Fu M (2002) Optimization for simulation: Theory vs. practice. INFORMS J. Comput. 14(3):192–215.Link, Google Scholar
• Gangammanavar H, Sen S, Zavala VM (2015) Stochastic optimization of sub-hourly economic dispatch with wind energy. IEEE Trans. Power Systems 31(2):949–959.Crossref, Google Scholar
• Glynn PW, Infanger G (2013) Simulation-based confidence bounds for two-stage stochastic programs. Math. Programming 138(1–2):15–42.Crossref, Google Scholar
• Grasso A, LaPlante W (2011) Enhancing adaptability of U.S. military forces. Office of the Under Secretary of Defense for Acquisition, Technology and Logistics, Washington, DC.Google Scholar
• Hastie T, Tibshirani R, Friedman J (2009) The Elements of Statistical Learning: Data Mining, Inference, and Prediction (Springer, New York).Crossref, Google Scholar
• Herer YT, Tzur M, Yücesan E (2006) The multilocation transshipment problem. IIE Trans. 38(3):185–200.Crossref, Google Scholar
• Higle JL, Sen S (1991a) Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16(3):650–669.Link, Google Scholar
• Higle JL, Sen S (1991b) Statistical verification of optimality conditions for stochastic programs with recourse. Ann. Oper. Res. 30(1):215–239.Crossref, Google Scholar
• Higle JL, Sen S (1994) Finite master programs in regularized stochastic decomposition. Math. Programming 67(1–3):143–168.Crossref, Google Scholar
• Higle JL, Sen S (1996a) Duality and statistical tests of optimality for two stage stochastic programs. Math. Programming 75(2):257–275.Crossref, Google Scholar
• Higle JL, Sen S (1996b) Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming (Springer, New York).Crossref, Google Scholar
• Higle JL, Sen S (1999) Statistical approximations for stochastic linear programming problems. Ann. Oper. Res. 85:173–193.Crossref, Google Scholar
• Holdren J, Lander E, Varmus H (2010) Report to the President and Congress Designing a Digital Future: Federally Funded Research and Development in Networking and Information Technology. Executive Office of the President and President’s Council of Advisors on Science and Technology, Washington, DC.Google Scholar
• Infanger G (1999) Private communication.Google Scholar
• Kim S, Pasupathy R, Henderson SG (2015) A guide to sample average approximation. Fu MC, ed. Handbook of Simulation Optimization (Springer, New York), 207–243.Crossref, Google Scholar
• Kleywegt AJ, Shapiro A, de Mello H (2002) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2):479–502.Crossref, Google Scholar
• Kuhn D, Wiesemann W, Georghiou A (2011) Primal and dual linear decision rules in stochastic and robust optimization. Math. Programming 130(1):177–209.Crossref, Google Scholar
• Linderoth J, Wright S (2003) Decomposition algorithms for stochastic programming on a computational grid. Computational Optim. Appl. 24(2–3):207–250.Crossref, Google Scholar
• Linderoth J, Shapiro A, Wright S (2006) The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1):215–241.Crossref, Google Scholar
• Liu Y (2016) Computational stochastic programming with stochastic decomposition. Doctoral dissertation, University of Southern California, Los Angeles.Google Scholar
• Louveaux F, Smeers Y (1988) Optimal investments for electricity generation: A stochastic model and a test problem. Ermoliev Y, Wets RJB, eds. Numerical Techniques for Stochastic Optim. (Springer, Berlin), 33–64.Crossref, Google Scholar
• Mak W, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1):47–56.Crossref, Google Scholar
• Mulvey JM, Ruszczyński A (1995) A new scenario decomposition method for large-scale stochastic optimization. Oper. Res. 43(3):477–490.Link, Google Scholar
• Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Crossref, Google Scholar
• Nesterov Y, Vial J (2008) Confidence level solutions for stochastic programming. Automatica 44(6):1559–1568.Crossref, Google Scholar
• Oliveira W, Sagastizábal C, Scheimberg S (2011) Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21(2):517–544.Crossref, Google Scholar
• Pasupathy R (2010) On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58(4:889–901.Link, Google Scholar
• Polyak BT, Juditsky AB (1992) Acceleration of stochastic approximation by averaging. SIAM J. Control and Optim. 30(4):838–855 Crossref, Google Scholar
• Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality, Vol. 703 (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Römisch W (2003) Stability of stochastic programming problems. Handbooks in Oper. Res. Management Sci. Vol. 10 (Elsevier, Amsterdam), 483–554.Crossref, Google Scholar
• Royset JO, Szechtman R (2013) Optimal budget allocation for sample average approximation. Oper. Res. 61(3):762–776.Link, Google Scholar
• Sen S, Doverspike RD, Cosares S (1994) Network planning with random demand. Telecomm. Systems 3(1):11–30.Crossref, Google Scholar
• Shapiro A, Homem de Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math. Programming 81(3):301–325.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory, Vol. 9 (SIAM, Philadelphia).Crossref, Google Scholar
• Shapiro A, Homem de Mello T, Kim J (2002) Conditioning of convex piecewise linear stochastic programs. Math. Programming 94(1):1–19.Crossref, Google Scholar
• Singh K (1981) On the asymptotic accuracy of Efron’s bootstrap. Ann. Statist. 1187–1195.Crossref, Google Scholar
• Vogel S (2008) Universal confidence sets for solutions of optimization problems. SIAM J. Optim. 19(3):1467–1488.Crossref, Google Scholar
• Zverovich V, Fábián CI, Ellison EF, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders’ decomposition. Math. Programming Comput. 4(3):211–238.Crossref, Google Scholar