28 #ifndef _STATISTICS_H_ 29 #define _STATISTICS_H_ 65 readingTime->~Timer();
66 solvingTime->~Timer();
67 preprocessingTime->~Timer();
68 simplexTime->~Timer();
70 transformTime->~Timer();
71 rationalTime->~Timer();
72 initialPrecisionTime->~Timer();
73 extendedPrecisionTime->~Timer();
74 reconstructionTime->~Timer();
75 boostingStepTime->~Timer();
93 void clearSolvingData();
96 void print(std::ostream& os);
188 #include "statistics.hpp" 190 #endif // _STATISTICS_H_ R sumPrimalDegen
the sum of the rate of primal degeneracy at each iteration
int precBoosts
number of precision boosts
int stallRefinements
number of refinement steps without pivots
Real luFactorizationTimeReal
time for factorizing bases matrices in real precision
Real multTimeFull
time for computing A*x ignoring sparsity (setupPupdate(), PRICE step)
Timer * simplexTime
simplex time
R finalCompObj
the final objective function of the complementary problem
int iterationsFP
number of iterations/pivots in first floating-point solve
Real luFactorizationTimeRational
time for factorizing bases matrices in rational precision
int pivotRefinements
number of refinement steps until final basis is reached
int iterationsFromBasis
number of iterations from Basis
Timer * rationalTime
time for rational LP solving (included in solving time)
int callsReducedProb
number of times the reduced problem is solved. This includes the initial solve.
int boostedIterations
number of iterations/pivots in extended precision
R finalBasisCondition
condition number estimate of the optimal basis matrix
int unbdPrecBoosts
number of precision boosts during undboundedness test
SoPlexBase< R > & operator=(const SoPlexBase< R > &rhs)
assignment operator
int pivotPrecBoosts
number of precision boosts until final basis is reached
int numRedProbRows
number of rows in the reduced problem
Timer * initialPrecisionTime
solving time with initial precision (included in solving time)
int multColwiseCalls
number of products A*x columnwise (setupPupdate(), PRICE step)
int boostedIterationsFromBasis
number of iterations from Basis
R maxRowViol
the max row violations in the original problem using the red prob sol
int rationalReconstructions
number of rational reconstructions performed
int boostedIterationsPrimal
number of iterations with Primal
Timer * reconstructionTime
time for rational reconstructions
R totalBoundViol
the sum of the bound violations in the original problem using the red prob sol
Real multTimeColwise
time for computing A*x columnwise (setupPupdate(), PRICE step)
Timer * extendedPrecisionTime
solving time with extended precision (included in solving time)
Real luSolveTimeRational
time for solving linear systems in rational precision
int multSparseCalls
number of products A*x exploiting sparsity (setupPupdate(), PRICE step)
Timer * syncTime
time for synchronization between real and rational LP (included in solving time)
int iterationsCompProb
number of iterations of the complementary problem
int feasRefinements
number of refinement steps during infeasibility test
Real luSolveTimeReal
time for solving linear systems in real precision
Timer * readingTime
reading time not included in solving time
Real multTimeUnsetup
time for computing A*x w/o sparsity information (setupPupdate(), PRICE step)
int unbdRefinements
number of refinement steps during undboundedness test
R sumDualDegen
the sum of the rate of dual degeneracy at each iteration
int stallPrecBoosts
number of precision boosts without pivots
int iterationsPrimal
number of iterations with Primal
int refinements
number of refinement steps
Timer * boostingStepTime
time for the precision boosting step: boost, load LP, load basis, decrease tols (included in solving ...
R totalRowViol
the sum of the row violations in the original problem using the red prob sol
Timer::TYPE timerType
type of timer (user or wallclock)
int iterationsRedProb
number of iterations of the reduced problem
Preconfigured SoPlex LP solver.
R maxBoundViol
the max bound violation in the original problem using the red prob sol
int redProbStatus
status of the reduced problem
int luSolvesReal
number of (forward and backward) solves with basis matrix in real precision
Timer * solvingTime
solving time
Everything should be within this namespace.
int multFullCalls
number of products A*x ignoring sparsity (setupPupdate(), PRICE step)
int multUnsetupCalls
number of products A*x w/o sparsity information (setupPupdate(), PRICE step)
Real multTimeSparse
time for computing A*x exploiting sparsity (setupPupdate(), PRICE step)
int boundflips
number of dual bound flips
int luFactorizationsReal
number of basis matrix factorizations in real precision
int compProbStatus
status of the complementary problem
int numRedProbCols
number of columns in the reduced problem
int iterationsInit
number of iterations in the initial LP
int degenPivotCandPrimal
number of pivoting candidates that will produce a degenerate step in the primal
Timer * transformTime
time for transforming LPs (included in solving time)
int boostedIterationsPolish
number of iterations during solution polishing
int feasPrecBoosts
number of precision boosts during infeasibility test
int iterationsPolish
number of iterations during solution polishing
void print(std::FILE *f, const text_style &ts, const S &format_str, const Args &... args)
int luFactorizationsRational
number of basis matrix factorizations in rational precision
int degenPivotsDual
number of dual degenerate pivots
Real fpTime
time for first floating-point LP solve
int degenPivotCandDual
number of pivoting candidates that will produce a degenerate step in the dual
Timer * preprocessingTime
preprocessing time
Wrapper for the system time query methods.
int boostedBoundflips
number of dual bound flips
int iterations
number of iterations/pivots
void spx_free(T &p)
Release memory.
int degenPivotsPrimal
number of primal degenerate pivots