Searched refs:LexSimplexBase (Results 1 – 2 of 2) sorted by relevance
412 class LexSimplexBase : public SimplexBase {414 ~LexSimplexBase() override = default;428 LexSimplexBase(unsigned nVar) : SimplexBase(nVar, /*mustUseBigM=*/true) {} in LexSimplexBase() function429 LexSimplexBase(unsigned nVar, const llvm::SmallBitVector &isSymbol) in LexSimplexBase() function431 explicit LexSimplexBase(const IntegerRelation &constraints) in LexSimplexBase() function432 : LexSimplexBase(constraints.getNumVars()) { in LexSimplexBase()435 explicit LexSimplexBase(const IntegerRelation &constraints, in LexSimplexBase() function437 : LexSimplexBase(constraints.getNumVars(), isSymbol) { in LexSimplexBase()478 class LexSimplex : public LexSimplexBase {480 explicit LexSimplex(unsigned nVar) : LexSimplexBase(nVar) {} in LexSimplex()[all …]
271 /// non-negative in LexSimplexBase. (We used the big M trick to make the281 LogicalResult LexSimplexBase::addCut(unsigned row) { in addCut() 365 void LexSimplexBase::appendSymbol() { in appendSymbol() 385 /// This proceeds similarly to LexSimplexBase::addCut(). We are given a row that777 LogicalResult LexSimplexBase::moveRowUnknownToColumn(unsigned row) { in moveRowUnknownToColumn() 793 unsigned LexSimplexBase::getLexMinPivotColumn(unsigned row, unsigned colA, in getLexMinPivotColumn() 1213 void LexSimplexBase::undoLastConstraint() { in undoLastConstraint() 1592 void LexSimplexBase::addInequality(ArrayRef<DynamicAPInt> coeffs) { in getRationalSample()