The set of cuts will be filled in a sequence of iterations by solving the inner maximization problem of the minimax formulation. The cuts both guide the master problem towards an optimal \mathbf{y}, if one exists, and ensure that \mathbf{y} is feasible for the full problem. The set of cuts define the relationship between \mathbf{y}, \mathbf{z}, and implicitly \mathbf{x}.
