Zilberstein's "LP-dominate" pruning explained?
I think I found the solution. When in PR(W), D=∅, the weight is:

b[i] = 0          for { i | w[i]&lt;max(w) }, 

and

b[i] = 1.0/max(w) for { i | w[i]==max(w) }.