Abstract
We considers a distributionally robust optimization problem when the ambiguity set specifies the support as well as the mean and the covariance matrix of the uncertain parameters. After deriving a general deterministic reformulation for the distributionally robust optimization problem, we obtain tractable optimization reformulations when the support set is the whole space and when it is a convex polyhedral set. A hybrid method of Gurobi and a smoothing Newton conjugate gradient method is suggested to solve the tractable optimization problems and numerical results of the hybrid method for solving an illustrative example are reported.
Funding: The research was supported by the National Natural Science Foundation of China under project No. 91330206 and 11571059.
References
[1] J. Dupačová, On minimax solutions of stochastic linear programming problems, Časopispro Pĕstování Matematiky, 91 (1966), No. 4, 423–430.10.21136/CPM.1966.117583Search in Google Scholar
[2] D. Bertsimas and M. Sim, Tractable approximations to robust conic optimization problems, Math. Programming, 107 (2006), No. 1-2, 5–36.10.1007/s10107-005-0677-1Search in Google Scholar
[3] G. C. Calafiore and L. El Ghaoui, On distributionally robust chance-constrained linear programs, J. Optim. Theory Appl., 130 (2006) No.1, 1–22.10.1007/s10957-006-9084-xSearch in Google Scholar
[4] W. Chen, M. Sim, J. Sun, and C.-P. Teo, From CVaR to uncertainty set: Implications in joint chance constrained optimization, Operations Research, 58 (2010), No. 2, 470–485.10.1287/opre.1090.0712Search in Google Scholar
[5] S.-S. Cheung, A. Man-Cho So, and K. Wang, Linear matrix inequalities with stochastically dependent perturbations and applications to chance-constrained semidefinite optimization SIAM J. Optim., 222 (2012) No. 4, 1394–1430.10.1137/110822906Search in Google Scholar
[6] E. Delage, Distributionally robust optimization in context of data-driven problem, PhD Thesis, Stanford University, USA, 2009.Search in Google Scholar
[7] E. Delage and Y. Ye, Distributionally robust optimization under moment uncertainty with application to data-driven problems, Operations Research, 58 (2010), No. 3, 596–612.10.1287/opre.1090.0741Search in Google Scholar
[8] L. El Ghaoui, M. Oks, and F. Oustry, Worst-case value-at-risk and robust portfolio optimization: A conic programming approach, Operations Research, 51 (2003), No. 4, 543–556.10.1287/opre.51.4.543.16101Search in Google Scholar
[9] H. E. Scarf, A min-max solution of an inventory problem, In: Studies in the Mathematical Theory of Inventory and Production, (Eds. K. J. Arrow, S. Karlin, and H. E. Scarf), Stanford University Press, 1958, pp. 201–209.Search in Google Scholar
[10] A. Shapiro, On duality theory of conic linear problems. In: Semi-Infinite Programming, Chapter 7, Kluwer Academic Publishers, 2001, pp. 135–165.10.1007/978-1-4757-3403-4_7Search in Google Scholar
[11] W. Wiesemann, D. Kuhn, and M. Sim, Distributionally robust convex optimization, Operations Research, 62 (2014), No. 6, 1358–1376.10.1287/opre.2014.1314Search in Google Scholar
[12] S. Zymler, D. Kuhn, and B. Rustem, Distributionally robust joint chance constraints with second-order moment information, Math. Programming, 137 (2013), No. 1-2, 167–198.10.1007/s10107-011-0494-7Search in Google Scholar
© 2018 Walter de Gruyter GmbH, Berlin/Boston
