SoPlex
Sequential object-oriented simPlex
Sequential object-oriented simPlex
#include <statistics.h>
Public Member Functions | |
Construction, resetting, printing | |
| Statistics (Timer::TYPE ttype=Timer::USER_TIME) | |
| default constructor More... | |
| Statistics (const Statistics &base) | |
| copy constructor More... | |
| Statistics & | operator= (const Statistics &rhs) |
| assignment operator More... | |
| ~Statistics () | |
| destructor More... | |
| void | clearAllData () |
| clears all statistics More... | |
| void | clearSolvingData () |
| clears statistics on solving process More... | |
| void | print (std::ostream &os) |
| prints statistics More... | |
Public Attributes | |
Data | |
| Timer * | readingTime |
| reading time not included in solving time More... | |
| Timer * | solvingTime |
| solving time More... | |
| Timer * | preprocessingTime |
| preprocessing time More... | |
| Timer * | simplexTime |
| simplex time More... | |
| Timer * | syncTime |
| time for synchronization between real and rational LP (included in solving time) More... | |
| Timer * | transformTime |
| time for transforming LPs (included in solving time) More... | |
| Timer * | rationalTime |
| time for rational LP solving (included in solving time) More... | |
| Timer * | reconstructionTime |
| time for rational reconstructions More... | |
| Timer::TYPE | timerType |
| type of timer (user or wallclock) More... | |
| Real | multTimeSparse |
| time for computing A*x exploiting sparsity (setupPupdate(), PRICE step) More... | |
| Real | multTimeFull |
| time for computing A*x ignoring sparsity (setupPupdate(), PRICE step) More... | |
| Real | multTimeColwise |
| time for computing A*x columnwise (setupPupdate(), PRICE step) More... | |
| Real | multTimeUnsetup |
| time for computing A*x w/o sparsity information (setupPupdate(), PRICE step) More... | |
| int | multSparseCalls |
| number of products A*x exploiting sparsity (setupPupdate(), PRICE step) More... | |
| int | multFullCalls |
| number of products A*x ignoring sparsity (setupPupdate(), PRICE step) More... | |
| int | multColwiseCalls |
| number of products A*x columnwise (setupPupdate(), PRICE step) More... | |
| int | multUnsetupCalls |
| number of products A*x w/o sparsity information (setupPupdate(), PRICE step) More... | |
| Real | luFactorizationTimeReal |
| time for factorizing bases matrices in real precision More... | |
| Real | luSolveTimeReal |
| time for solving linear systems in real precision More... | |
| Real | luFactorizationTimeRational |
| time for factorizing bases matrices in rational precision More... | |
| Real | luSolveTimeRational |
| time for solving linear systems in rational precision More... | |
| int | iterations |
| number of iterations/pivots More... | |
| int | iterationsPrimal |
| number of iterations with Primal More... | |
| int | iterationsFromBasis |
| number of iterations from Basis More... | |
| int | iterationsPolish |
| number of iterations during solution polishing More... | |
| int | boundflips |
| number of dual bound flips More... | |
| int | luFactorizationsReal |
| number of basis matrix factorizations in real precision More... | |
| int | luSolvesReal |
| number of (forward and backward) solves with basis matrix in real precision More... | |
| int | luFactorizationsRational |
| number of basis matrix factorizations in rational precision More... | |
| int | rationalReconstructions |
| number of rational reconstructions performed More... | |
| int | refinements |
| number of refinement steps More... | |
| int | stallRefinements |
| number of refinement steps without pivots More... | |
| int | pivotRefinements |
| number of refinement steps until final basis is reached More... | |
| int | feasRefinements |
| number of refinement steps during infeasibility test More... | |
| int | unbdRefinements |
| number of refinement steps during undboundedness test More... | |
| int | callsReducedProb |
| number of times the reduced problem is solved. This includes the initial solve. More... | |
| int | iterationsInit |
| number of iterations in the initial LP More... | |
| int | iterationsRedProb |
| number of iterations of the reduced problem More... | |
| int | iterationsCompProb |
| number of iterations of the complementary problem More... | |
| int | numRedProbRows |
| number of rows in the reduced problem More... | |
| int | numRedProbCols |
| number of columns in the reduced problem More... | |
| int | degenPivotsPrimal |
| number of primal degenerate pivots More... | |
| int | degenPivotsDual |
| number of dual degenerate pivots More... | |
| int | degenPivotCandPrimal |
| number of pivoting candidates that will produce a degenerate step in the primal More... | |
| int | degenPivotCandDual |
| number of pivoting candidates that will produce a degenerate step in the dual More... | |
| R | sumDualDegen |
| the sum of the rate of dual degeneracy at each iteration More... | |
| R | sumPrimalDegen |
| the sum of the rate of primal degeneracy at each iteration More... | |
| R | decompBasisCondNum |
| the condition number for the basis used to perform the decomposition More... | |
| R | totalBoundViol |
| the sum of the bound violations in the original problem using the red prob sol More... | |
| R | totalRowViol |
| the sum of the row violations in the original problem using the red prob sol More... | |
| R | maxBoundViol |
| the max bound violation in the original problem using the red prob sol More... | |
| R | maxRowViol |
| the max row violations in the original problem using the red prob sol More... | |
| int | redProbStatus |
| status of the reduced problem More... | |
| int | compProbStatus |
| status of the complementary problem More... | |
| R | finalCompObj |
| the final objective function of the complementary problem More... | |
| R | finalBasisCondition |
| condition number estimate of the optimal basis matrix More... | |
Definition at line 34 of file statistics.h.
| Statistics | ( | Timer::TYPE | ttype = Timer::USER_TIME | ) |
default constructor
| Statistics | ( | const Statistics< R > & | base | ) |
copy constructor
| ~Statistics | ( | ) |
| void clearAllData | ( | ) |
clears all statistics
| void clearSolvingData | ( | ) |
clears statistics on solving process
| Statistics& operator= | ( | const Statistics< R > & | rhs | ) |
assignment operator
| void print | ( | std::ostream & | os | ) |
prints statistics
| int boundflips |
number of dual bound flips
Definition at line 117 of file statistics.h.
| int callsReducedProb |
number of times the reduced problem is solved. This includes the initial solve.
Definition at line 129 of file statistics.h.
| int compProbStatus |
status of the complementary problem
Definition at line 147 of file statistics.h.
| R decompBasisCondNum |
the condition number for the basis used to perform the decomposition
Definition at line 141 of file statistics.h.
| int degenPivotCandDual |
number of pivoting candidates that will produce a degenerate step in the dual
Definition at line 138 of file statistics.h.
| int degenPivotCandPrimal |
number of pivoting candidates that will produce a degenerate step in the primal
Definition at line 137 of file statistics.h.
| int degenPivotsDual |
number of dual degenerate pivots
Definition at line 136 of file statistics.h.
| int degenPivotsPrimal |
number of primal degenerate pivots
Definition at line 135 of file statistics.h.
| int feasRefinements |
number of refinement steps during infeasibility test
Definition at line 125 of file statistics.h.
| R finalBasisCondition |
condition number estimate of the optimal basis matrix
Definition at line 151 of file statistics.h.
| R finalCompObj |
the final objective function of the complementary problem
Definition at line 148 of file statistics.h.
| int iterations |
number of iterations/pivots
Definition at line 113 of file statistics.h.
| int iterationsCompProb |
number of iterations of the complementary problem
Definition at line 132 of file statistics.h.
| int iterationsFromBasis |
number of iterations from Basis
Definition at line 115 of file statistics.h.
| int iterationsInit |
number of iterations in the initial LP
Definition at line 130 of file statistics.h.
| int iterationsPolish |
number of iterations during solution polishing
Definition at line 116 of file statistics.h.
| int iterationsPrimal |
number of iterations with Primal
Definition at line 114 of file statistics.h.
| int iterationsRedProb |
number of iterations of the reduced problem
Definition at line 131 of file statistics.h.
| int luFactorizationsRational |
number of basis matrix factorizations in rational precision
Definition at line 120 of file statistics.h.
| int luFactorizationsReal |
number of basis matrix factorizations in real precision
Definition at line 118 of file statistics.h.
| Real luFactorizationTimeRational |
time for factorizing bases matrices in rational precision
Definition at line 111 of file statistics.h.
| Real luFactorizationTimeReal |
time for factorizing bases matrices in real precision
Definition at line 109 of file statistics.h.
| int luSolvesReal |
number of (forward and backward) solves with basis matrix in real precision
Definition at line 119 of file statistics.h.
| Real luSolveTimeRational |
time for solving linear systems in rational precision
Definition at line 112 of file statistics.h.
| Real luSolveTimeReal |
time for solving linear systems in real precision
Definition at line 110 of file statistics.h.
| R maxBoundViol |
the max bound violation in the original problem using the red prob sol
Definition at line 144 of file statistics.h.
| R maxRowViol |
the max row violations in the original problem using the red prob sol
Definition at line 145 of file statistics.h.
| int multColwiseCalls |
number of products A*x columnwise (setupPupdate(), PRICE step)
Definition at line 106 of file statistics.h.
| int multFullCalls |
number of products A*x ignoring sparsity (setupPupdate(), PRICE step)
Definition at line 105 of file statistics.h.
| int multSparseCalls |
number of products A*x exploiting sparsity (setupPupdate(), PRICE step)
Definition at line 104 of file statistics.h.
| Real multTimeColwise |
time for computing A*x columnwise (setupPupdate(), PRICE step)
Definition at line 102 of file statistics.h.
| Real multTimeFull |
time for computing A*x ignoring sparsity (setupPupdate(), PRICE step)
Definition at line 101 of file statistics.h.
| Real multTimeSparse |
time for computing A*x exploiting sparsity (setupPupdate(), PRICE step)
Definition at line 100 of file statistics.h.
| Real multTimeUnsetup |
time for computing A*x w/o sparsity information (setupPupdate(), PRICE step)
Definition at line 103 of file statistics.h.
| int multUnsetupCalls |
number of products A*x w/o sparsity information (setupPupdate(), PRICE step)
Definition at line 107 of file statistics.h.
| int numRedProbCols |
number of columns in the reduced problem
Definition at line 134 of file statistics.h.
| int numRedProbRows |
number of rows in the reduced problem
Definition at line 133 of file statistics.h.
| int pivotRefinements |
number of refinement steps until final basis is reached
Definition at line 124 of file statistics.h.
| Timer* preprocessingTime |
preprocessing time
Definition at line 92 of file statistics.h.
| int rationalReconstructions |
number of rational reconstructions performed
Definition at line 121 of file statistics.h.
| Timer* rationalTime |
time for rational LP solving (included in solving time)
Definition at line 96 of file statistics.h.
| Timer* readingTime |
reading time not included in solving time
Definition at line 90 of file statistics.h.
| Timer* reconstructionTime |
time for rational reconstructions
Definition at line 97 of file statistics.h.
| int redProbStatus |
status of the reduced problem
Definition at line 146 of file statistics.h.
| int refinements |
number of refinement steps
Definition at line 122 of file statistics.h.
| Timer* simplexTime |
simplex time
Definition at line 93 of file statistics.h.
| Timer* solvingTime |
solving time
Definition at line 91 of file statistics.h.
| int stallRefinements |
number of refinement steps without pivots
Definition at line 123 of file statistics.h.
| R sumDualDegen |
the sum of the rate of dual degeneracy at each iteration
Definition at line 139 of file statistics.h.
| R sumPrimalDegen |
the sum of the rate of primal degeneracy at each iteration
Definition at line 140 of file statistics.h.
| Timer* syncTime |
time for synchronization between real and rational LP (included in solving time)
Definition at line 94 of file statistics.h.
| Timer::TYPE timerType |
type of timer (user or wallclock)
Definition at line 98 of file statistics.h.
| R totalBoundViol |
the sum of the bound violations in the original problem using the red prob sol
Definition at line 142 of file statistics.h.
| R totalRowViol |
the sum of the row violations in the original problem using the red prob sol
Definition at line 143 of file statistics.h.
| Timer* transformTime |
time for transforming LPs (included in solving time)
Definition at line 95 of file statistics.h.
| int unbdRefinements |
number of refinement steps during undboundedness test
Definition at line 126 of file statistics.h.