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