“…Remark 1. Condition (i) means that at stage t = 0 no uncertainty is resolved; condition (ii) means that information is progressively revealed, that is, one has only partial information; (iii) indicates that all information is revealed at stage T. In order to link the multistage stochastic and the information partition, we can use a particular oriented graph, called event-tree; see, e.g., [18]. In this way, for each pair (ω, t) identified in P corresponds a node ξ j t t and at each node ξ j t t of the oriented graph, we associate the elementary event F j t t , that is, F…”