All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
spxsolver.h File Reference main LP solver class More... #include <assert.h> #include <iostream> #include <iomanip> #include <sstream> #include "spxdefines.h" #include "timer.h" #include "timerfactory.h" #include "spxlp.h" #include "spxbasis.h" #include "array.h" #include "random.h" #include "unitvector.h" #include "updatevector.h" Go to the source code of this file.
Detailed Descriptionmain LP solver class Definition in file spxsolver.h. Macro Definition Documentation
number of refactorizations until sparsity is tested again Definition at line 40 of file spxsolver.h. Referenced by SPxSolver::computeCoTest(), SPxSolver::computeFtest(), and SPxSolver::computeTest().
size of initial candidate list for hyper pricing Definition at line 38 of file spxsolver.h. Referenced by SPxDevexPR::buildBestPriceVectorEnterCoDim(), SPxSteepPR::buildBestPriceVectorEnterCoDim(), SPxDevexPR::buildBestPriceVectorEnterDim(), SPxSteepPR::buildBestPriceVectorEnterDim(), SPxDevexPR::buildBestPriceVectorLeave(), and SPxSteepPR::buildBestPriceVectorLeave().
do (auto) hyper pricing only if problem size (cols+rows) is larger than HYPERPRICINGTHRESHOLD Definition at line 37 of file spxsolver.h. Referenced by SoPlex::_solveRealLPAndRecordStatistics().
maximum number of clock skips (iterations without time measuring) Definition at line 46 of file spxsolver.h. Referenced by SPxSolver::isTimeLimitReached().
the number of clock updates in isTimelimitReached() before clock skipping starts Definition at line 48 of file spxsolver.h. Referenced by SPxSolver::isTimeLimitReached().
the probability to skip the clock when the time limit has been reached Definition at line 47 of file spxsolver.h. Referenced by SPxSolver::isTimeLimitReached().
threshold to decide whether Ids or coIds are preferred to enter the basis; coIds are more likely to enter if SPARSITY_TRADEOFF is close to 0 Definition at line 41 of file spxsolver.h. Referenced by SPxDantzigPR::selectEnterX(), SPxDevexPR::selectEnterX(), and SPxSteepPR::selectEnterX().
percentage of infeasibilities that is considered sparse Definition at line 39 of file spxsolver.h. |