Rollout Algorithms Based on Greedy Algorithms) In the context of the rollout algorithm, suppose that given a partial solution

It then augments P with the arc flows y thus obtained, and repeats up to obtaining a complete solution. Assume that the set of arcs T selected depends only on P. Furthermore, the ties in the minimization of Eq. (10.36) are resolved in a fixed manner that depends only on P. Show that the rollout algorithm that uses the greedy algorithm as a base heuristic is sequentially consistent.