Differential Constraints Study Notes

Differential constraint requirements can be divided into the maximum or minimum;

1. selecting the maximum value:

Seeking a maximum value of the form f [n] -f [0], then the formula must have an upper bound, then we need to list the form xi-xj <= d (even a j -> i is the right side side) d equations, but also because in the maximum value of the equation, we get the upper bound is certainly the smallest that one, it is built to run on the shortest of the map;

2. The minimum requirements:

Seeking the minimum of the form f [n] -f [0], then the formula must have a lower bound, then we need to list the form xi-xj> = d (even a i -> j is a right side - on the side) equations d, and because when the minimum value of the expression, that we take the lower bound is certainly the largest that one, so it built the longest run of the road map;

3, for the conversion of inequalities given topic

You may experience inequality symbols in the same situation do not question, but we can make the appropriate transformation of their

(1) given by the equation: X [n-1] -X [0]> = T, can transpose into: X [0] -X [n-1] <= - T.

(2) given by the equation: X [n-1] -X [0] <T, may be converted into X [n-1] -X [0] <= T-1.

(3) given by the equation: X [n-1] -X [0] = T, may be converted into X [n-1] -X [0] <= T && X [n-1] -X [0]> = T, then using (1) was transformed to