| /dports/math/clp/Clp-1.17.3/Clp/src/ |
| H A D | AbcSimplexFactorization.cpp | 218 int numberPivots = coinAbcFactorization_->pivots(); in timeToRefactorize() local
220 if (numberPivots > lastNumberPivots_) { in timeToRefactorize()
242 lastNumberPivots_ = numberPivots; in timeToRefactorize()
260 …= constWeightIterateX + (constWeightFactor + variableWeight) / static_cast< double >(numberPivots); in timeToRefactorize()
262 if ((numberPivots%20)==0&&!ifPrint3) in timeToRefactorize()
264 numberPivots,numberRows,effectiveStartNumberU_, in timeToRefactorize()
283 int numberPivots = coinAbcFactorization_->pivots(); in statsRefactor() local
296 …= constWeightIterateX + (constWeightFactor + variableWeight) / static_cast< double >(numberPivots); in statsRefactor()
298 when, numberPivots, numberRows, effectiveStartNumberU_, in statsRefactor()
|
| H A D | AbcSimplexParallel.cpp | 308 int numberPivots = abcFactorization_->pivots(); in getTableauColumnFlipAndStartReplaceSerial() local
350 if (numberPivots) { in getTableauColumnFlipAndStartReplaceSerial()
351 if (needFlag && numberPivots < 10) { in getTableauColumnFlipAndStartReplaceSerial()
360 btranAlpha_, alpha_, numberPivots); in getTableauColumnFlipAndStartReplaceSerial()
818 if (numberPivots) { in getTableauColumnFlipAndStartReplaceThread()
819 if (needFlag && numberPivots < 10) { in getTableauColumnFlipAndStartReplaceThread()
828 btranAlpha_, alpha_, numberPivots); in getTableauColumnFlipAndStartReplaceThread()
1032 …numberPivots = CoinMax(numberPivots - numberEarly - abcFactorization_->pivots(), numberPivots / 2); in whileIteratingCilk()
1249 if (numberPivots) { in getTableauColumnFlipAndStartReplaceCilk()
1250 if (needFlag && numberPivots < 10) { in getTableauColumnFlipAndStartReplaceCilk()
[all …]
|
| H A D | ClpPESimplex.cpp | 213 int numberPivots = model_->numberIterations(); in ~ClpPESimplex() local
229 if (numberPivots - coCompatiblePivots()) { in ~ClpPESimplex()
230 …ePivots() - coDegenerateCompatiblePivots())) / (static_cast< double >(numberPivots - coCompatibleP… in ~ClpPESimplex()
241 …mberPivots %g", static_cast< double >(coDegeneratePivots()) / static_cast< double >(numberPivots)); in ~ClpPESimplex()
|
| H A D | AbcSimplexPrimal.cpp | 772 int numberPivots = abcFactorization_->pivots(); in whileIterating() local
776 if (problemStatus_ == -1 && numberPivots < 13000) { in whileIterating()
806 int numberPivots = abcFactorization_->pivots(); in statusOfProblemInPrimal() local
809 numberPivots,type,problemStatus_,forceFactorization_,dontFactorizePivots_); in statusOfProblemInPrimal()
814 numberPivots = 9999999; in statusOfProblemInPrimal()
888 if (numberPivots <= 1) { in statusOfProblemInPrimal()
1063 if (numberPivots) { in statusOfProblemInPrimal()
1075 forceFactorization_ = CoinMin(numberPivots / 4, 100); in statusOfProblemInPrimal()
1078 CoinMax(3, numberPivots / 4)); in statusOfProblemInPrimal()
1082 if (numberPivots == 1) { in statusOfProblemInPrimal()
[all …]
|
| H A D | AbcSimplexDual.cpp | 2542 int numberPivots = abcFactorization_->pivots(); in whatNext() local
2568 if (numberPivots) { in whatNext()
2569 if (needFlag && numberPivots < 10) { in whatNext()
2578 btranAlpha_, alpha_, numberPivots); in whatNext()
2653 numberPivots = 9999999; in statusOfProblemInDual()
2895 numberPivots, in statusOfProblemInDual()
3428 if (numberFlagged && !numberPivots) { in statusOfProblemInDual()
5138 if (!numberPivots || specialCase) { in noPivotRow()
5141 if (numberFlagged_ && numberPivots) { in noPivotRow()
5151 && !numberPivots) in noPivotRow()
[all …]
|
| H A D | ClpSimplexPrimal.cpp | 796 int numberPivots = factorization_->pivots(); in whileIterating() local
800 if (problemStatus_ == -1 && numberPivots < 1000000) { in whileIterating()
811 forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
816 forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
836 int numberPivots = factorization_->pivots(); in statusOfProblemInPrimal() local
906 if (numberPivots <= 1) { in statusOfProblemInPrimal()
1015 if (numberPivots || (numberThrownOut == -123456789 && saveStatus_)) { in statusOfProblemInPrimal()
1030 forceFactorization_ = CoinMin(numberPivots / 2, 100); in statusOfProblemInPrimal()
1033 CoinMax(3, numberPivots / 2)); in statusOfProblemInPrimal()
1037 if (numberPivots == 1) { in statusOfProblemInPrimal()
[all …]
|
| H A D | ClpSimplexDual.cpp | 2041 int numberPivots = factorization_->pivots(); in whileIterating() local
2054 if (!numberPivots || specialCase) { in whileIterating()
2065 if (iRow < numberRows_ && numberPivots) { in whileIterating()
2075 && !numberPivots) in whileIterating()
2156 } else if (numberPivots) { in whileIterating()
2159 if (numberPivots < -1000) { in whileIterating()
4818 int numberPivots = factorization_->pivots(); in statusOfProblemInDual() local
4847 if (alphaAccuracy_ < 0.0 || !numberPivots || alphaAccuracy_ > 1.0e4 || numberPivots > 20) { in statusOfProblemInDual()
5252 if (numberPivots < 2) { in statusOfProblemInDual()
5265 if (numberPivots < 10) in statusOfProblemInDual()
[all …]
|
| H A D | ClpFactorization.cpp | 1531 int numberPivots = coinFactorizationA_->pivots(); in timeToRefactorize() local
1533 if (numberPivots > lastNumberPivots_) { in timeToRefactorize()
1557 lastNumberPivots_ = numberPivots; in timeToRefactorize()
1575 …= constWeightIterateX + (constWeightFactor + variableWeight) / static_cast< double >(numberPivots); in timeToRefactorize()
1577 if ((numberPivots%20)==0&&!ifPrint3) in timeToRefactorize()
1579 numberPivots,numberRows,effectiveStartNumberU_, in timeToRefactorize()
1622 int numberPivots = coinFactorizationA_->pivots(); in statsRefactor() local
1635 …= constWeightIterateX + (constWeightFactor + variableWeight) / static_cast< double >(numberPivots); in statsRefactor()
1637 when, numberPivots, numberRows, effectiveStartNumberU_, in statsRefactor()
|
| H A D | ClpSimplexOther.cpp | 4361 int numberPivots = factorization_->pivots(); in whileIterating() local
4365 … if (numberPivots < 20 && (specialOptions_ & 2048) != 0 && !numberChanged_ && perturbation_ >= 100 in whileIterating()
4374 if (!numberPivots || specialCase) { in whileIterating()
4383 if (iRow < numberRows_ && numberPivots) { in whileIterating()
4395 if (numberPivots) { in whileIterating()
4458 int numberPivots = factorization_->pivots(); in whileIterating() local
4459 forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
4468 int numberPivots = factorization_->pivots(); in whileIterating() local
4469 forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
6965 int numberPivots = factorization_->pivots(); in modifyCoefficientsAndPivot() local
[all …]
|
| H A D | AbcSimplex.cpp | 1475 int numberPivots = abcFactorization_->pivots(); in housekeeping() local
1477 numberPivots++; // allow for update not done in housekeeping()
1481 if (numberPivots == maximumPivots || maximumPivots < 2) { in housekeeping()
|
| H A D | ClpSimplex.cpp | 2251 int numberPivots = factorization_->pivots(); in housekeeping() local
2255 if (numberPivots == maximumPivots || maximumPivots < 2) { in housekeeping()
|
| /dports/math/ogdf/OGDF/src/coin/Clp/ |
| H A D | ClpSimplexDual.cpp | 1881 int numberPivots = factorization_->pivots(); in whileIterating() local
1895 if (!numberPivots || specialCase) { in whileIterating()
1904 if (iRow < numberRows_ && numberPivots) { in whileIterating()
1914 && !numberPivots) in whileIterating()
1995 } else if (numberPivots) { in whileIterating()
4016 int numberPivots = factorization_->pivots(); in statusOfProblemInDual() local
4045 if (alphaAccuracy_ < 0.0 || !numberPivots || alphaAccuracy_ > 1.0e4 || numberPivots > 20) { in statusOfProblemInDual()
4404 if (numberPivots < 2) { in statusOfProblemInDual()
4417 if (numberPivots < 10) in statusOfProblemInDual()
4986 if ((numberPrimalInfeasibilities_ || numberPivots) in statusOfProblemInDual()
[all …]
|
| H A D | ClpSimplexPrimal.cpp | 721 int numberPivots = factorization_->pivots(); in whileIterating() local
722 forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
742 int numberPivots = factorization_->pivots(); in statusOfProblemInPrimal() local
812 if (numberPivots <= 1) { in statusOfProblemInPrimal()
868 lastAverageInfeasibility < test2 && numberPivots > 10) in statusOfProblemInPrimal()
871 numberPivots > 10) in statusOfProblemInPrimal()
883 if (numberPivots) { in statusOfProblemInPrimal()
898 forceFactorization_ = CoinMin(numberPivots / 2, 100); in statusOfProblemInPrimal()
901 CoinMax(3, numberPivots / 2)); in statusOfProblemInPrimal()
905 if (numberPivots == 1) { in statusOfProblemInPrimal()
[all …]
|
| H A D | ClpSimplexOther.cpp | 3337 int numberPivots = factorization_->pivots(); in whileIterating() local
3341 if (numberPivots < 20 && in whileIterating()
3351 if (!numberPivots || specialCase) { in whileIterating()
3360 if (iRow < numberRows_ && numberPivots) { in whileIterating()
3372 if (numberPivots) { in whileIterating()
3437 int numberPivots = factorization_->pivots(); in whileIterating() local
3438 … forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
3447 int numberPivots = factorization_->pivots(); in whileIterating() local
3448 forceFactorization_ = CoinMin(forceFactorization_, (numberPivots + 1) >> 1); in whileIterating()
|
| H A D | ClpSimplex.cpp | 1967 int numberPivots = factorization_->pivots(); in housekeeping() local
1972 if (numberPivots == maximumPivots || in housekeeping()
|
| /dports/math/py-CyLP/CyLP-0.91.4/cylp/cpp/ |
| H A D | IClpSimplexPrimal.cpp | 753 int numberPivots = factorization_->pivots(); in whileIterating() local
754 forceFactorization_=CoinMin(forceFactorization_,(numberPivots+1)>>1); in whileIterating()
774 int numberPivots = factorization_->pivots(); in statusOfProblemInPrimal() local
850 if (numberPivots<=1) { in statusOfProblemInPrimal()
900 if (numberPivots) { in statusOfProblemInPrimal()
916 if (numberPivots==1) { in statusOfProblemInPrimal()
924 numberPivots=0; in statusOfProblemInPrimal()
|
| H A D | IClpSimplexPrimal_Wolfe.cpp | 725 int numberPivots = factorization_->pivots(); in whileIterating() local
726 forceFactorization_=CoinMin(forceFactorization_,(numberPivots+1)>>1); in whileIterating()
746 int numberPivots = factorization_->pivots(); in statusOfProblemInPrimal() local
822 if (numberPivots<=1) { in statusOfProblemInPrimal()
872 if (numberPivots) { in statusOfProblemInPrimal()
888 if (numberPivots==1) { in statusOfProblemInPrimal()
896 numberPivots=0; in statusOfProblemInPrimal()
|