Searched refs:LexSimplex (Results 1 – 4 of 4) sorted by relevance
478 class LexSimplex : public LexSimplexBase {480 explicit LexSimplex(unsigned nVar) : LexSimplexBase(nVar) {} in LexSimplex() function484 explicit LexSimplex(const IntegerRelation &constraints) in LexSimplex() function674 LexSimplex domainSimplex;
235 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::findRationalLexMin() { in findRationalLexMin() 292 std::optional<unsigned> LexSimplex::maybeGetNonIntegralVarRow() const { in maybeGetNonIntegralVarRow() 306 MaybeOptimum<SmallVector<DynamicAPInt, 8>> LexSimplex::findIntegerLexMin() { in findIntegerLexMin() 337 bool LexSimplex::isSeparateInequality(ArrayRef<DynamicAPInt> coeffs) { in isSeparateInequality() 343 bool LexSimplex::isRedundantInequality(ArrayRef<DynamicAPInt> coeffs) {393 /// As in LexSimplex::addCut, for this to be an integer, we want688 bool LexSimplex::rowIsViolated(unsigned row) const { in rowIsViolated() 696 std::optional<unsigned> LexSimplex::maybeGetViolatedRow() const { in maybeGetViolatedRow() 706 LogicalResult LexSimplex::restoreRationalConsistency() { in restoreRationalConsistency() 1231 // Simplex and LexSimplex handl in undo() [all...]
145 LexSimplex(*this).findRationalLexMin(); in findRationalLexMin() 165 LexSimplex(*this).findIntegerLexMin(); in findIntegerLexMin()
32 bool isRedundantInequality(LexSimplex &simplex, ArrayRef<int64_t> coeffs) { in isRedundantInequality()38 bool isSeparateInequality(LexSimplex &simplex, ArrayRef<int64_t> coeffs) { in isSeparateInequality()582 LexSimplex simplex(/*nVar=*/1); in TEST()