Lines Matching defs:computeOptimum

1364 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,
1375 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,
1404   return computeOptimum(Direction::Up, con[constraintIndex]).isBounded();
1479     if (computeOptimum(Direction::Up, dir).isUnbounded())
1482     if (computeOptimum(Direction::Down, dir).isUnbounded())
1675         simplex.computeOptimum(Direction::Up, getCoeffsForDirection(dir));
1685     // We can't just call into computeWidth or computeOptimum since we need to
1689     // ourselves, call into computeOptimum, compute the duals from the tableau
2110       computeOptimum(Simplex::Direction::Down, coeffs).map(ceil));
2112       computeOptimum(Simplex::Direction::Up, coeffs).map(floor));
2118   auto upOpt = computeOptimum(Simplex::Direction::Up, coeffs);
2119   auto downOpt = computeOptimum(Simplex::Direction::Down, coeffs);
2203   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);
2207   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);
2230   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);
2231   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);