For a connection request between two nodes s and t, the flow
can drop to a fraction q of the demand with at most probability
P. Again, the snapshot model is used, and the set of link
failure probabilities P are conditional given a network failure
has occurred. Before proceeding with the MILP, we determine
the complexity of MAGP to be NP-Hard.