1330 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,  in computeOptimum()  function in Simplex
1341 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction,  in computeOptimum()  function in Simplex
1370   return computeOptimum(Direction::Up, con[constraintIndex]).isBounded();  in isBoundedAlongConstraint()
1444     if (computeOptimum(Direction::Up, dir).isUnbounded())  in isUnbounded()
1447     if (computeOptimum(Direction::Down, dir).isUnbounded())  in isUnbounded()
1639         simplex.computeOptimum(Direction::Up, getCoeffsForDirection(dir));  in computeWidth()
2072       computeOptimum(Simplex::Direction::Down, coeffs).map(ceil));  in computeIntegerBounds()
2074       computeOptimum(Simplex::Direction::Up, coeffs).map(floor));  in computeIntegerBounds()
2145   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);  in findIneqType()
2149   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);  in findIneqType()
2172   MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs);  in isRedundantEquality()
2173   MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs);  in isRedundantEquality()