Lines Matching defs:minimum

207 /// Thus, since we can attain x = b, that is the lexicographic minimum.
1458     MaybeOptimum<Fraction> minimum = computeRowOptimum(Direction::Down, row);
1459     if (minimum.isUnbounded() || *minimum < Fraction(0, 1)) {
1976 /// follows. Compute the minimum and maximum rational values of this direction.
2105 /// Compute the minimum and maximum integer values the expression can take. We
2194 /// Internally, this computes the minimum and the maximum the inequality with
2195 /// coefficients `coeffs` can take. If the minimum is >= 0, the inequality holds
2196 /// for all points in the polytope, so it is redundant.  If the minimum is <= 0
2197 /// and the maximum is >= 0, the points in between the minimum and the
2203   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);
2204   if (minimum.isBounded() && *minimum >= Fraction(0, 1)) {
2208   if ((!minimum.isBounded() || *minimum <= Fraction(0, 1)) &&
2226 /// when the minimum and maximum value that `coeffs` can take are both zero.
2230   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);
2232   assert((!minimum.isEmpty() && !maximum.isEmpty()) &&
2234   return minimum.isBounded() && maximum.isBounded() &&
2235          *maximum == Fraction(0, 1) && *minimum == Fraction(0, 1);