Extending (2.19), we obtain

 

where J contains the indices of the s pairs i j , i ∈ S(j) , with largest parameter values. Show that the assumptions of Proposition 6 hold.

Indicate why the wait-and-see solution cannot be reasonably computed in Example 2.

Consider the TSP with stochastic demands of Section 7.2b. Order the clients in increasing distance from the depot. Examine whether

 is a valid lower bound if qj is the probability of having at least/exactly j failures.

Transcribed Image Text:

A/(35) =rp( +2 <4). A/(35) =rp( +2 <4).