Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models

Published Online:https://doi.org/10.1287/ijoc.2016.0725

References

  • Ahmed S, Tawarmalani M, Sahinidis NV (2004) A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Programming 100(2):355–377.CrossrefGoogle Scholar
  • Avramidis AN, Bauer KW, Wilson JR (1991) Simulation of stochastic activity networks using path control variates. Naval Res. Logist. 38(2):183–201.CrossrefGoogle Scholar
  • Bayraksan G, Morton DP (2006) Assessing solution quality in stochastic programs. Math. Programming 108(2):495–514.CrossrefGoogle Scholar
  • Bayraksan G, Morton DP (2009) Assessing solution quality in stochastic programs via sampling. Oskoorouchi MR, ed. Tutorials in Operations Research (INFORMS, Hanover, MD), 102–122.LinkGoogle Scholar
  • Birge JR, Louveaux FV (2011) Introduction to Stochastic Programming, 2nd ed. (Springer, New York).CrossrefGoogle Scholar
  • Carøe CC, Schultz R (1999) Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1–2):37–45.CrossrefGoogle Scholar
  • Donohue CJ, Birge JR (1995) An upper bound on the network recourse function. Working paper, Department of Industrial and Operations Engineering University of Michigan, Ann Arbor.Google Scholar
  • Elmaghraby SE (1977) Activity Networks: Project Planning and Control by Network Models (Wiley, New York).Google Scholar
  • 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–75.CrossrefGoogle Scholar
  • Glynn PW, Infanger G (2013) Simulation-based confidence bounds for two-stage stochastic programs. Math. Programming 138(1):15–42.CrossrefGoogle Scholar
  • Higle JL, Sen S (1991) Stochastic decomposition: An algorithm for two-stage linear programs with recourse. Math. Oper. Res. 16(3):650–669.LinkGoogle Scholar
  • Higle JL, Sen S (1996) Duality and statistical tests of optimality for two stage stochastic programs. Math. Programming 75(2):257–275.CrossrefGoogle Scholar
  • Klein Haneveld WK, van der Vlerk MH (1999) Stochastic integer programming: General models and algorithms. Ann. Oper. Res. 85:39–57.CrossrefGoogle Scholar
  • Klein Haneveld WK, Stougie L, van der Vlerk MH (2006) Simple integer recourse models: Convexity and convex approximations. Math. Programming 108(2):435–473.CrossrefGoogle Scholar
  • Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.CrossrefGoogle Scholar
  • Louveaux FV, Schultz R (2003) Stochastic integer programming. Ruszczyński A, Shapiro A, eds. Handbooks in Operations Research and Management Science, Stochastic Programming, Vol. 10 (Elsevier, Amsterdam), 213–266.CrossrefGoogle Scholar
  • Mak WK, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1–2):47–56.CrossrefGoogle Scholar
  • Prékopa A (1995) Stochastic Programming (Kluwer Academic Publishers, Dordrecht, Netherlands).CrossrefGoogle Scholar
  • Rinnooy Kan AHG, Stougie L (1988) Stochastic integer programming. Ermoliev Y, Wets RJ-B, eds. Numerical Techniques for Stochastic Optimization, Springer Ser. Comput. Math., Vol. 10 (Springer, New York), 201–213.Google Scholar
  • Romeijnders W, Stougie L, van der Vlerk MH (2014) Approximation in two-stage stochastic integer programming. Surveys Oper. Res. Management Sci. 19(1):17–33.CrossrefGoogle Scholar
  • Romeijnders W, van der Vlerk MH, Klein Haneveld WK (2015) Convex approximations of totally unimodular integer recourse models: A uniform error bound. SIAM J. Optim. 25(1):130–158.CrossrefGoogle Scholar
  • Romeijnders W, van der Vlerk MH, Klein Haneveld WK (2016) Total variation bounds on the expectation of periodic functions with applications to recourse approximations. Math. Programming 157(1):3–46.CrossrefGoogle Scholar
  • Ruszczyński A (1986) A regularized decomposition method for minimizing a sum of polyhedral functions. Math. Programming 35(3):309–333.CrossrefGoogle Scholar
  • Schrijver A (1986) Theory of Linear and Integer Programming (Wiley, Chichester, UK).Google Scholar
  • Schultz R (2003) Stochastic programming with integer variables. Math. Programming 97(1):285–309.CrossrefGoogle Scholar
  • Sen S (2005) Algorithms for stochastic mixed-integer programming models. Aardal K, Nemhauser GL, Weismantel R, eds. Handbooks in Operations Research and Management Science, Discrete Optimization, Vol. 12 (Elsevier, Amsterdam), 515–558.CrossrefGoogle Scholar
  • Sen S, Higle JL (2005) The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math. Programming 104(1):1–20.CrossrefGoogle Scholar
  • Sen S, Liu Y (2016) Mitigating uncertainty via compromise decisions in two-stage stochastic linear programming: Variance reduction. Oper. Res. 64(6):1422–1437.LinkGoogle Scholar
  • Shapiro A, Homem-de-Mello T (1998) A simulation-based approach to two-stage stochastic programming with recourse. Math. Programming 81(1):301–325.CrossrefGoogle Scholar
  • Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory (SIAM, Philadelphia).CrossrefGoogle Scholar
  • van der Vlerk MH (2004) Convex approximations for complete integer recourse models. Math. Programming 99(2):297–310.CrossrefGoogle Scholar
  • van der Vlerk MH (2010) Convex approximations for a class of mixed-integer recourse models. Ann. Oper. Res. 177(1):139–150.CrossrefGoogle Scholar
  • van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4):638–663.CrossrefGoogle Scholar
  • Wallace SW, Ziemba WT, eds. (2005) Applications of Stochastic Programming, MPS-SIAM Series on Optimization (SIAM, Philadelphia).CrossrefGoogle Scholar
  • Zverovich V, Fábián CI, Ellison EFD, 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.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.