Ambiguous Joint Chance Constraints Under Mean and Dispersion Information

Published Online:https://doi.org/10.1287/opre.2016.1583

References

  • An H, Eheart JW (2007) A screening technique for joint chance-constrained programming for air-quality management. Oper. Res. 55(4):792–798.LinkGoogle Scholar
  • Beck A, Ben-Tal A (2009) Duality in robust optimization: Primal worst equals dual best. Oper. Res. Lett. 37(1):1–6.CrossrefGoogle Scholar
  • Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming A 88(3):411–424.CrossrefGoogle Scholar
  • Ben-Tal A, Nemirovski A (2009) On safe tractable approximations of chance-constrained linear matrix inequalities. Math. Oper. Res. 34(1):1–25.LinkGoogle Scholar
  • Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Bertsimas D, Popescu I (2004) Optimal inequalities in probability theory: A convex optimization approach. SIAM J. Optim. 15(3):780–804.CrossrefGoogle Scholar
  • Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.LinkGoogle Scholar
  • Bertsimas D, Natarajan K, Teo CP (2002) Applications of semidefinite optimization in stochastic project scheduling. Technical Report, High Performance Comput. Engineered Systems, Singapore-MIT Alliance.Google Scholar
  • Bertsimas D, Gupta V, Kallus N (2013) Data-driven robust optimization. Preprint arXiv:1401.0212.Google Scholar
  • Bordley RF, Pollock SM (2009) A decision-analytic approach to reliability-based design optimization. Oper. Res. 57(5):1262–1270.LinkGoogle Scholar
  • Calafiore GC, El Ghaoui L (2006) On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1):1–22.CrossrefGoogle Scholar
  • Casella G, Berger RL (2002) Statistical Inference, 2nd ed. (Duxbury Thomson Learning, Pacific Grove, CA).Google Scholar
  • Charnes A, Cooper WW (1959) Chance-constrained programming. Management Sci. 6(1):73–79.LinkGoogle Scholar
  • Charnes A, Cooper WW, Symonds GH (1958) Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil. Management Sci. 4(3):235–263.LinkGoogle Scholar
  • Chen W, Sim M, Sun J, Teo C-P (2010) From CVaR to uncertainty set: Implications in joint chance-constrained optimization. Oper. Res. 58(2):470–485.LinkGoogle Scholar
  • Chen X, Sim M, Sun P (2007) A robust optimization perspective on stochastic programming. Oper. Res. 55(6):1058–1071.LinkGoogle Scholar
  • Cheung S-S, So AM-C, Wang K (2012) Linear matrix inequalities with stochastically dependent perturbations and applications to chance-constrained semidefinite optimization. SIAM J. Optim. 22(4):1394–1430.CrossrefGoogle Scholar
  • Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. Barnhart C, Laporte G, eds. Transportation Handbooks in Operations Research and Management Science, Vol. 14, Chap. 6 (North-Holland, Amsterdam, Netherlands), 367–428.Google Scholar
  • Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.LinkGoogle Scholar
  • Demeulemeester EL, Herroelen WS (2002) Project Scheduling—A Research Handbook (Kluwer Academic Publishers, Boston).Google Scholar
  • DeMiguel V, Nogales FJ (2009) Portfolio selection with robust estimation. Oper. Res. 57(3):560–577.LinkGoogle Scholar
  • Dert C, Oldenkamp B (2000) Optimal guaranteed return portfolios and the casino effect. Oper. Res. 48(5):768–775.LinkGoogle Scholar
  • Dyer ME, Frieze AM (1988) On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5):967–974.CrossrefGoogle Scholar
  • El Ghaoui L, Oks M, Oustry F (2003) Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. 51(4):543–556.LinkGoogle Scholar
  • Erdoğan E, Iyengar G (2006) Ambiguous chance constrained problems and robust optimization. Math. Programming B 107(1–2):37–61.CrossrefGoogle Scholar
  • Flajolet A, Blandin S, Jaillet P (2014) Robust adaptive routing under uncertainty. Preprint arXiv:1408.3374.Google Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York).Google Scholar
  • Georghiou A, Wiesemann W, Kuhn D (2011) The decision rule approach to optimisation under uncertainty: Methodology and applications in operations management. Accessed March 2017, http://www.optimization-online.org/DB_HTML/2011/12/3290.html.Google Scholar
  • Goldfarb D, Yin W (2005) Second-order cone programming methods for total variation-based image restoration. SIAM J. Sci. Comput. 27(2):622–645.CrossrefGoogle Scholar
  • Gorissen BL, Blanc H, den Hertog D, Ben-Tal A (2014) Technical note–Deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets. Oper. Res. 62(3):672–679.LinkGoogle Scholar
  • Gurvich I, Luedtke J, Tezcan T (2010) Staffing call centers with uncertain demand forecasts: A chance-constrained optimization approach. Management Sci. 56(7):1093–1115.LinkGoogle Scholar
  • Han S, Tao M, Topcu U, Owhadi H, Murray RM (2015) Convex optimal uncertainty quantification. SIAM J. Optim. 25(3):1368–1387.CrossrefGoogle Scholar
  • Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2015) A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Programming 151(1):35–62.CrossrefGoogle Scholar
  • Hu Z, Hong LJ (2012) Kullback-Leibler divergence constrained distributionally robust optimization. Accessed March 2017, http://www.optimization-online.org/DB_HTML/2012/11/3677.html.Google Scholar
  • Hu Z, Hong LJ, So AMC (2013) Ambiguous probabilistic programs. Accessed March 2017, http://www.optimization-online.org/DB_HTML/2013/09/4039.html.Google Scholar
  • Jiang R, Guan Y (2016) Data-driven chance constrained stochastic program. Math. Programming 158(1):291–327.CrossrefGoogle Scholar
  • Konno H, Yamazaki H (1991) Mean-absolute deviation portfolio optimization model and its applications to tokyo stock market. Management Sci. 37(5):519–531.LinkGoogle Scholar
  • Korski J, Pfeuffer F, Klamroth K (2007) Biconvex sets and optimization with biconvex functions: A survey and extensions. Math. Methods Oper. Res. 66(3):373–407.CrossrefGoogle Scholar
  • Levi R, Perakis G, Uichanco J (2011) Regret optimization for stochastic inventory models with spread information. Technical Report, Massachusetts Institute of Technology.Google Scholar
  • Liu C, Freeman WT, Szeliski R, Kang SB (2006) Noise estimation from a single image. Proc. IEEE Conf. Comput. Vision Pattern Recognition (IEEE Computer Society), 901–908.Google Scholar
  • Nemirovski A (2012) On safe tractable approximations of chance constraints. Eur. J. Oper. Res. 219(3):707–718.CrossrefGoogle Scholar
  • Nemirovski A, Shapiro A (2006) Convex approximations of chance constrained programs. SIAM J. Optim. 17(4):969–996.CrossrefGoogle Scholar
  • Osher S, Burger M, Goldfarb D, Xu J, Yin W (2005) An iterative regularization method for total variation-based image restoration. Multiscale Modeling and Simulation 4(2):460–489.CrossrefGoogle Scholar
  • Owhadi H, Scovel C, Sullivan TJ, McKerns M, Ortiz M (2013) Optimal uncertainty quantification. SIAM Rev. 55(2):271–345.CrossrefGoogle Scholar
  • Postek K, Ben-Tal A, den Hertog D, Melenberg B (2015) Exact robust counterparts of ambiguous stochastic constraints under mean and dispersion information. Accessed March 2017, http://www.optimization-online.org/DB_HTML/2015/06/4946.html.Google Scholar
  • Prékopa A (1995) Stochastic Programming (Kluwer Academic Publishers, Dordrecht, Netherlands).CrossrefGoogle Scholar
  • Rockafellar RT (1997) Convex Analysis (Princeton University Press, Princeton, NJ).Google Scholar
  • Shapiro A (2001) On duality theory of conic linear problems. Goberna MÁ, López MA eds. Semi-Infinite Programming (Kluwer Academic Publishers, Dordrecht, Netherlands), 135–165.CrossrefGoogle Scholar
  • Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modelling and Theory (SIAM, Philadelphia).CrossrefGoogle Scholar
  • Shen S, Smith JC, Ahmed S (2010) Expectation and chance-constrained models and algorithms for insuring critical paths. Management Sci. 56(10):1794–1814.LinkGoogle Scholar
  • Vandenberghe L, Boyd S, Comanor K (2007) Generalized Chebyshev bounds via semidefinite programming. SIAM Rev. 49(1):52–64.CrossrefGoogle Scholar
  • Van Parys BPG, Kuhn D, Goulart PJ, Morari M (2016) Distributionally robust control of constrained stochastic systems. IEEE Trans. Automatic Control 61(2):430–442.Google Scholar
  • Wang J (2007) The β-reliable median on a network with discrete probabilistic demand weights. Oper. Res. 55(5):966–975.LinkGoogle Scholar
  • Wiesemann W, Kuhn D, Rustem B (2012a) Multi-resource allocation in stochastic project scheduling. Ann. Oper. Res. 193(1):193–220.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn D, Rustem B (2012b) Robust resource allocations in temporal networks. Math. Programming A 135(1):437–471.CrossrefGoogle Scholar
  • Wiesemann W, Kuhn D, Rustem B (2013) Robust Markov decision processes. Math. Oper. Res. 38(1):153–183.LinkGoogle Scholar
  • Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.LinkGoogle Scholar
  • Xu H, Caramanis C, Mannor S (2012) Optimization under probabilistic envelope constraints. Oper. Res. 60(3):682–699.LinkGoogle Scholar
  • Yanıkoğlu İ, den Hertog D (2013) Safe approximations of ambiguous chance constraints using historical data. INFORMS J. Comput. 25(4):666–681.LinkGoogle Scholar
  • Zymler S, Kuhn D, Rustem B (2013) Distributionally robust joint chance constraints with second-order moment information. Math. Programming A 137(1–2):167–198.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.