Searched refs:isUnbounded (Results 1 – 6 of 6) sorted by relevance
109 TEST(SimplexTest, isUnbounded) { in TEST() argument112 .isUnbounded()); in TEST()116 .isUnbounded()); in TEST()120 .isUnbounded()); in TEST()122 EXPECT_TRUE(simplexFromConstraints(2, {}, {}).isUnbounded()); in TEST()134 .isUnbounded()); in TEST()145 .isUnbounded()); in TEST()156 .isUnbounded()); in TEST()164 .isUnbounded()); in TEST()172 .isUnbounded()); in TEST()[all …]
85 if (maybeLexMin.isUnbounded()) { in checkSample()86 EXPECT_TRUE(Simplex(poly).isUnbounded()); in checkSample()
52 bool isUnbounded() const { return kind == OptimumKind::Unbounded; } in isUnbounded() function
774 bool isUnbounded();
312 if (sample.isUnbounded()) in findIntegerLexMin()1358 (optimum.isUnbounded() || *optimum < Fraction(0, 1))) { in computeOptimum()1424 if (minimum.isUnbounded() || *minimum < Fraction(0, 1)) { in detectRedundant()1436 bool Simplex::isUnbounded() { in isUnbounded() function in Simplex1444 if (computeOptimum(Direction::Up, dir).isUnbounded()) in isUnbounded()1447 if (computeOptimum(Direction::Down, dir).isUnbounded()) in isUnbounded()
776 if (!simplex.isUnbounded()) in findIntegerSample()1120 if (min.isUnbounded() || max.isUnbounded()) { in computeVolume()