Article
Full entry |
PDF
(0.3 MB)
Feedback
PDF
(0.3 MB)
Feedback
Keywords:
stochastic programming; Generalized Benders Decomposition; {\it L}-shaped method; warm–start
stochastic programming; Generalized Benders Decomposition; {\it L}-shaped method; warm–start
Summary:
In this paper, we describe a decomposition algorithm suitable for two-stage convex stochastic programs known as Generalized Benders Decomposition. For this algorithm we propose a new reformulation that incorporates a lower bound cut that serves as a warm-start, decreasing the overall computation time. Additionally, we test the performance of the proposed reformulation on two modifications of the algorithm (bunching and multicut) using numerical examples. The numerical part is programmed in MATLAB and uses state-of-the-art conic solvers.
References:
[1] Bazaraa, M. S., Sherali, H. D., Shetty, C. M.: Nonlinear Programming: Theory and Algorithms. Third edition. Wiley-Interscience, Hoboken, N. J. 2006. DOI 10.1002/0471787779 | MR 2218478
[2] Benders, J. F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 (1962), 1, 238-252. DOI 10.1007/bf01386316 | MR 0147303 | Zbl 1115.90361
[3] Birge, J. R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York 2000. MR 2807730
[4] Boyd, S. P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York 2004. DOI 10.1017/cbo9780511804441 | MR 2061575 | Zbl 1058.90049
[5] Floudas, C. A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford 1995.
[6] Floudas, C. A., Pardalos, P. M.: Encyclopedia of Optimization. Springer, New York 2009. DOI 10.1007/978-0-387-74759-0 | MR 3593766
[7] Geoffrion, A. M.: Generalized Benders decomposition. Journal of Optimization Theory and Applications 10 (1972), 4, 237-260. DOI 10.1007/bf00934810 | MR 0327310
[8] Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Recent Advances in Learning and Control (V. Blondel, S. Boyd and H. Kimura, eds.), Springer-Verlag Limited, Berlin 2008, pp. 95-110. DOI 10.1007/978-1-84800-155-8_7 | MR 2409077
[9] Madansky, A.: Inequalities for stochastic linear programming problems. Management Science 6 (1960), 197-204. DOI 10.1287/mnsc.6.2.197 | MR 0110581
[10] Mittelmann, H. D.: The state-of-the-art in conic optimization software. In: Handbook on Semidefinite, Conic and Polynomial Optimization (M. F. Anjos and J. B. Lasserre, eds.), Springer US, New York 2012, pp. 671-686. DOI 10.1007/978-1-4614-0769-0_23 | MR 2894667
[11] Pflug, G., Maggioni, F.: Bounds and approximations for multistage stochastic programs. SIAM J. Optim. 26 (2016), 1, 831-855. DOI 10.1137/140971889 | MR 3477324
[12] Slyke, R. M. Van, Wets, R.: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming. SIAM J. Appl. Math. 17 (1969), 4, 638-663. DOI 10.1137/0117061 | MR 0253741
[13] Wolf, C., Fabián, C. I., Koberstein, A., Suhl, L.: Applying oracles of on-demand accuracy in two-stage stochastic programming - A computational study. Europ. J. Oper. Res. 239 (2014), 2, 437-448. DOI 10.1016/j.ejor.2014.05.010 | MR 3231913
[14] Zverovich, V., Fabián, C. I., Ellison, E. F. D., Mitra, G.: A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition. Math. Program. Computation 4 (2012), 3, 211-238. DOI 10.1007/s12532-012-0038-z | MR 2967981
Search
Partner of
