12 #ifndef ClpPESimplex_H
13 #define ClpPESimplex_H
93 void printPrimalDegenerates();
96 void printCompatibleCols();
void PEtransposeTimesSubsetAll(ClpSimplex *model, int number, const int *which, const double *COIN_RESTRICT x, double *COIN_RESTRICT y, const double *COIN_RESTRICT rowScale, const double *COIN_RESTRICT columnScale)
compute the product x^T*[A I] for the indices "which" of [A I]
void updateDualDegeneratesAvg(int coPivots)
void updateCompatibleRowsAvg(int coPivots)
void startTimer()
Start and stop the timer, and print the total recorded time.
int numberRows_
size of the original model
double * compatibilityCol_
void resetDegeneratePivotsConsecutive()
void updatePrimalDegeneratesAvg(int coPivots)
int coDualDegeneratesAvg_
double coDualDegeneratesAvg()
ClpSimplex * model_
pointer to the original model that shall be solved
void setDoStatistics(int value)
double coPrimalDegeneratesAvg()
void printTimer(std::ostream &out)
bool * isPrimalDegenerate_
double dualTolerance() const
Dual tolerance to use.
void isLastPivotCompatible(bool yesOrNo)
int coPrimalDegenerates()
BASIC GET METHODS.
double epsDegeneracy_
tolerance used for the tests of degeneracy and compatibility (resp.)
int coIdentifyCompatibles_
double coCompatibleColsAvg()
int coPrimalDegenerates_
Indices of the variables that were not at one of their bounds during the last update (non primal dege...
void updateCompatibleColsAvg(int coPivots)
int coDualDegenerates_
Indices of the non basic variables with a zero reduced cost during the last update (ndual-degenerate ...
double timeCompatibility_
Timer attribute recording the additional time spent in identifying compatible variables.
double * tempRandom_
w vectors that are used to identify the compatible columns and rows.
static double CoinCpuTime()
int doStatistics_
Do statistics.
bool isCompatibleRow(int row)
double objectiveValue() const
Objective value.
bool isLastPivotCompatible()
int coDegenerateCompatiblePivots_
void updateLastObjectiveValue()
int coDegeneratePivotsConsecutive_
~ClpPESimplex()
Destructor.
This solves LPs using the simplex method.
ClpPESimplex(ClpSimplex *model)
Constructor.
double PEdot(CoinIndexedVector &v1, const double *v2)
SHARED METHODS FOR USEFUL ALGEBRAIC OPERATIONS.
double lastObjectiveValue()
Tracking the degenerate iterations after compatible pivots.
double timeCompatibility()
double * compatibilityRow_
void identifyCompatibleRows(CoinIndexedVector *spare, CoinIndexedVector *wDual)
Identify the dual compatible rows.
int coDegeneratePivotsConsecutive()
void addCompatiblePivot()
void addDegenerateCompatiblePivot()
bool checkCompatibilityRow(int pivotRow)
DEBUG AND DISPLAY METHODS.
int coPrimalDegeneratesAvg_
number of degenerate pivots and variables
double timeLinearSystem()
int coCompatibleCols_
Table of booleans indicating whether each variable is primal compatible (true) or not (false) ...
void updateDualDegenerates()
Updates the set of dual degenerate variables.
double lastObjectiveValue_
tracking the degenerate iterations after compatible pivots
int coCompatibleRows_
Table of booleans indicating whether each constraint is dual compatible (true) or not (false) ...
void addDegeneratePivotConsecutive()
bool isCompatibleCol(int sequence)
void identifyCompatibleCols(int number, const int *which, CoinIndexedVector *spareRow2, CoinIndexedVector *wPrimal)
Identify the primal compatible columns The input argument is a temporary array that is needed for the...
void addDegeneratePivot()
Update and return the number of degenerate pivots and variables.
void updatePrimalDegenerates()
PUBLIC METHODS RELATED TO COMPATIBILITY.
int coPriorityPivots_
number of compatible pivots that were done because of the priority factor
void updateCompatibleRows(int sequence)
Update the dual compatible rows.
int coDegenerateCompatiblePivots()
bool isLastPivotCompatible_
double coCompatibleRowsAvg()
BASE CLASS FOR THE IMPROVED SIMPLEX.