Lines Matching refs:LexSimplex

235 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::findRationalLexMin() {
292 std::optional<unsigned> LexSimplex::maybeGetNonIntegralVarRow() const {
306 MaybeOptimum<SmallVector<DynamicAPInt, 8>> LexSimplex::findIntegerLexMin() {
337 bool LexSimplex::isSeparateInequality(ArrayRef<DynamicAPInt> coeffs) {
343 bool LexSimplex::isRedundantInequality(ArrayRef<DynamicAPInt> coeffs) {
393 /// As in LexSimplex::addCut, for this to be an integer, we want
688 bool LexSimplex::rowIsViolated(unsigned row) const {
696 std::optional<unsigned> LexSimplex::maybeGetViolatedRow() const {
706 LogicalResult LexSimplex::restoreRationalConsistency() {
1231     // Simplex and LexSimplex handle this differently, so we call out to a
1596 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::getRationalSample() const {