The Minimal Distance constraint relates the choice of the given value V G to the choices made for the relation and the scale.
in general this kind of procedure can lead to computational inefficiency; in planning descriptions of proportions, however, the number of candidates should not be large enough for this to be a problem, given that most combinations will already have been eliminated by the constraints applied before labeling.