Expected recourse functions in linear two-stage stochastic programs with mixed-integer second stage are approximated by estimating the underlying probability distribution via empirical measures. Under mild conditions, almost sure uniform convergence of the empirical means to the original expected recourse function is established.

In the area of dynamic matching algorithms, the number of changes to the matching per update step, also known as the recourse bound, is an important measure of quality, Nevertheless, the worstcase recourse bounds of almost all known dynamic approximate matching algorithms are prohibitively large, significantly larger than the corresponding update times. In this paper we fill in this gap via a s...

We investigate sample average approximation (SAA) for two-stage stochastic programs without relatively complete recourse, i.e., problems in which there are first-stage feasible solutions that not guaranteed to have a recourse action. As feasibility measure of the SAA solution, we consider "recourse likelihood", is probability solution has For $\epsilon \in (0,1)$, demonstrate likelihood below $...

Stochastic programming problems with simple recourse belong to problems depending on a random element only through the corresponding probability measure. Consequently, this probability measure can be treated as a parameter of the problem. In this paper the stability with respect to the above mentioned parameter will be studied for generalized simple recourse problems.

Stochastic optimization, especially multistage models, is well known to be computationally excruciating. In this paper, we introduce the concept of semi-complete recourse in the context of stochastic programming as a less restrictive condition compared to complete recourse and propose methods for approximating multistage stochastic programs with risk constraints and semi-complete recourse. We e...

in his collection north, heaney mythologizes the contemporary history of the people of northern ireland through conflating the mythological history of the people of ireland, with the 1960s troubles in northern ireland. used by the modernist poets, the method of representing the contemporary history through recourse to mythology have been also favored by poets who have experienced colonial and p...

We consider the online MST and TSP problems with recourse. The nodes of an unknown graph with metric edge cost appear one by one and must be connected in such a way that the resulting tree or tour has low cost. In the standard online setting, with irrevocable decisions, no algorithm can guarantee a constant competitive ratio. In our model we allow recourse actions by giving a limited budget of ...