Searched refs:optimum (Results 1 – 4 of 4) sorted by relevance
39 T optimum; variable47 MaybeOptimum(const T &optimum) in MaybeOptimum() argument48 : kind(OptimumKind::Bounded), optimum(optimum) {} in MaybeOptimum()55 Optional<T> getOptimumIfBounded() const { return optimum; } in getOptimumIfBounded()59 return optimum; in getBoundedOptimum()64 return optimum; in getBoundedOptimum()75 return optimum == other.optimum;82 auto map(const Function &f) const & -> MaybeOptimum<decltype(f(optimum))> {84 return f(optimum);
1356 MaybeOptimum<Fraction> optimum = computeRowOptimum(direction, row); in computeOptimum() local1358 (optimum.isUnbounded() || *optimum < Fraction(0, 1))) { in computeOptimum()1362 return optimum; in computeOptimum()
321 If the original problem has a bounded optimum, then the final sample327 When the optimum is unbounded, the optimal value computed for
9141 In case of union sets, the optimum is computed per space.9189 In case of union relations, the optimum is computed per space.