Home
last modified time | relevance | path

Searched refs:lastInfeasibility (Results 1 – 11 of 11) sorted by relevance

/dports/math/ogdf/OGDF/include/coin/
H A DClpSolve.hpp287 double lastInfeasibility(int back = 1) const;
/dports/math/clp/Clp-1.17.3/Clp/src/
H A DClpSolve.hpp351 double lastInfeasibility(int back = 1) const;
H A DClpSimplexPrimal.cpp1251 double lastInf = progress->lastInfeasibility(1); in statusOfProblemInPrimal()
1252 double lastInf3 = progress->lastInfeasibility(3); in statusOfProblemInPrimal()
1254 double thisInf = progress->lastInfeasibility(0); in statusOfProblemInPrimal()
H A DAbcSimplexPrimal.cpp1222 double lastInf = abcProgress_.lastInfeasibility(1); in statusOfProblemInPrimal()
1223 double lastInf3 = abcProgress_.lastInfeasibility(3); in statusOfProblemInPrimal()
1225 double thisInf = abcProgress_.lastInfeasibility(0); in statusOfProblemInPrimal()
H A DClpSimplexNonlinear.cpp359 if (progress->lastInfeasibility() < testValue) { in statusOfProblemInPrimal()
H A DClpSolve.cpp4465 ClpSimplexProgress::lastInfeasibility(int back) const in lastInfeasibility() function in ClpSimplexProgress
/dports/math/py-CyLP/CyLP-0.91.4/cylp/cpp/
H A DIClpSimplexPrimal.cpp1114 double lastInf = progress->lastInfeasibility(1); in statusOfProblemInPrimal()
1115 double lastInf3 = progress->lastInfeasibility(3); in statusOfProblemInPrimal()
1117 double thisInf = progress->lastInfeasibility(0); in statusOfProblemInPrimal()
H A DIClpSimplexPrimal_Wolfe.cpp1084 double lastInf = progress->lastInfeasibility(1); in statusOfProblemInPrimal()
1085 double lastInf3 = progress->lastInfeasibility(3); in statusOfProblemInPrimal()
1087 double thisInf = progress->lastInfeasibility(0); in statusOfProblemInPrimal()
/dports/math/ogdf/OGDF/src/coin/Clp/
H A DClpSimplexPrimal.cpp1108 double lastInf = progress->lastInfeasibility(1); in statusOfProblemInPrimal()
1109 double lastInf3 = progress->lastInfeasibility(3); in statusOfProblemInPrimal()
1111 double thisInf = progress->lastInfeasibility(0); in statusOfProblemInPrimal()
H A DClpSimplexNonlinear.cpp357 if(progress->lastInfeasibility() < testValue) { in statusOfProblemInPrimal()
H A DClpSolve.cpp3160 ClpSimplexProgress::lastInfeasibility(int back) const in lastInfeasibility() function in ClpSimplexProgress