Sampling methods for multi-stage robust optimization problems

20480 7 109326 2 331674 document 109326 s10479-025-06545-4.pdf application/pdf 9209f65951d874aa43b3f3b074af8cc6 MD5 1084342 2025-03-27 08:11:38 https://pure.iiasa.ac.at/id/eprint/20480/1/s10479-025-06545-4.pdf 20480 1 1 application/pdf text en public cc_by_4

s10479-025-06545-4.pdf

published 109327 1 331681 document 109327 indexcodes.txt text/x-c d888cf55641b520cdccf4bd42a12eb89 MD5 13681 2025-03-27 08:21:25 https://pure.iiasa.ac.at/id/eprint/20480/2/indexcodes.txt 20480 2 2 text/x-c other Generate index codes conversion from text to indexcodes en public

indexcodes.txt

lightbox.jpg

preview.jpg

medium.jpg

small.jpg

http://eprints.org/relation/isVersionOf https://pure.iiasa.ac.at/id/document/109326 http://eprints.org/relation/isVolatileVersionOf https://pure.iiasa.ac.at/id/document/109326 http://eprints.org/relation/issmallThumbnailVersionOf https://pure.iiasa.ac.at/id/document/109326 archive 353 disk0/00/02/04/80 2025-03-27 08:13:24 2025-03-27 08:13:24 2025-03-27 08:13:24 article show Maggioni F. Dabbene F. Pflug G. 1361 0000-0001-8215-3550 Sampling methods for multi-stage robust optimization problems pub ASA SYRR Multi-stage robust optimization, Constraint sampling, Scenario approach in optimization, Randomized algorithms In this paper, we consider multi-stage robust optimization problems of the minimax type. We assume that the total uncertainty set is the cartesian product of stagewise compact uncertainty sets and approximate the given problem by a sampled subproblem. Instead of looking for the worst case among the infinite and typically uncountable set of uncertain parameters, we consider only the worst case among a randomly selected subset of parameters. By adopting such a strategy, two main questions arise: (1) Can we quantify the error committed by the random approximation, especially as a function of the sample size? (2) If the sample size tends to infinity, does the optimal value converge to the “true” optimal value? Both questions will be answered in this paper. An explicit bound on the probability of violation is given and chain of lower bounds on the original multi-stage robust optimization problem provided. Numerical results dealing with a multi-stage inventory management problem show that the proposed approach works well for problems with two or three time periods while for larger ones the number of required samples is prohibitively large for computational tractability. Despite this, we believe that our results can be useful for problems with such small number of time periods, and it sheds some light on the challenge for problems with more time periods. 2025-03-19 published Springer doi:10.1007/s10479-025-06545-4 229 public Annals of Operations Research TRUE 1572-9338 no info:eu-repo/semantics/article