Searched refs:Simplex (Results 1 – 9 of 9) sorted by relevance
26 Simplex simplex(2); in TEST()51 Simplex simplex(1); in TEST()68 Simplex simplex(3); in TEST()237 Simplex simplex(0); in TEST()246 Simplex simplex(0); in TEST()254 Simplex simplex(1); in TEST()263 Simplex simplex(1); in TEST()271 Simplex simplex(1); in TEST()279 Simplex simplex(1); in TEST()513 Simplex sim1(s1); in TEST()[all …]
86 EXPECT_TRUE(Simplex(poly).isUnbounded()); in checkSample()
18 using Direction = Simplex::Direction;962 LogicalResult Simplex::restoreRow(Unknown &u) { in restoreRow()1151 void Simplex::undoLastConstraint() { in undoLastConstraint()1385 void Simplex::markRowRedundant(Unknown &u) { in markRowRedundant()1436 bool Simplex::isUnbounded() { in isUnbounded()1464 Simplex Simplex::makeProduct(const Simplex &a, const Simplex &b) { in makeProduct()1467 Simplex result(numVar); in makeProduct()1620 using Orientation = Simplex::Orientation;1623 GBRSimplex(const Simplex &originalSimplex) in GBRSimplex()1727 Simplex simplex;[all …]
197 Simplex simplex(b); in getSetDifference()510 SmallVector<Simplex, 2> simplices;581 Simplex simp(disjuncts[i]); in SetCoalescer()657 simplices[n - 2] = Simplex(disjuncts[n - 2]); in addCoalescedDisjunct()674 simplices[n - 2] = Simplex(disjuncts[n - 2]); in addCoalescedDisjunct()697 Simplex &simp = simplices[i]; in coalescePairCutCase()717 Simplex::IneqType type = simp.findIneqType(ineq); in typeInequality()718 if (type == Simplex::IneqType::Redundant) in typeInequality()720 else if (type == Simplex::IneqType::Cut) in typeInequality()755 Simplex &simpA = simplices[i]; in coalescePair()[all …]
9 Simplex.cpp
683 Simplex simplex(*this); in getBoundedDirections()771 Simplex simplex(*this); in findIntegerSample()806 Simplex(boundedSet).findIntegerSample(); in findIntegerSample()854 Simplex shrunkenConeSimplex(cone); in findIntegerSample()1057 Simplex simplex(*this); in removeRedundantConstraints()1086 Simplex simplex(*this); in computeVolume()
693 class Simplex : public SimplexBase {697 Simplex() = delete;698 explicit Simplex(unsigned nVar) : SimplexBase(nVar, /*mustUseBigM=*/false) {} in Simplex() function699 explicit Simplex(const IntegerRelation &constraints) in Simplex() function700 : Simplex(constraints.getNumVars()) { in Simplex()703 ~Simplex() override = default;778 static Simplex makeProduct(const Simplex &a, const Simplex &b);
183 \subsection{The Dual Simplex Method}618 \subsubsection{Dual Simplex + Gomory Cuts}
7556 mlir/include/mlir/Analysis/Presburger/Simplex.h7936 mlir/lib/Analysis/Presburger/Simplex.cpp