6 #ifndef AbcSimplexFactorization_H
7 #define AbcSimplexFactorization_H
16 #ifndef ABC_USE_COIN_FACTORIZATION
41 #ifdef EARLY_FACTORIZE
76 #ifdef ABC_LONG_FACTORIZATION
90 #ifdef ABC_LONG_FACTORIZATION
100 #ifdef MOVE_REPLACE_PART1A
121 #ifdef ABC_LONG_FACTORIZATION
128 #ifdef ABC_LONG_FACTORIZATION
129 inline void clearHiddenArrays()
141 #ifdef ABC_LONG_FACTORIZATION
152 #ifdef ABC_LONG_FACTORIZATION
156 #ifdef EARLY_FACTORIZE
157 inline int replaceColumns(
const AbcSimplex *model,
160 int firstPivot,
int lastPivot,
bool cleanUp)
239 #ifndef ABC_USE_COIN_FACTORIZATION
250 #ifndef ABC_USE_COIN_FACTORIZATION
271 #ifndef ABC_USE_COIN_FACTORIZATION
350 #if ABC_PARALLEL == 2
351 inline void setParallelMode(
int value)
363 #if CLP_FACTORIZATION_NEW_TIMING > 1
364 void statsRefactor(
char when)
const;
466 #ifndef ABC_USE_COIN_FACTORIZATION
484 #ifndef ABC_USE_COIN_FACTORIZATION
504 #ifndef ABC_USE_COIN_FACTORIZATION
509 #ifdef CLP_FACTORIZATION_NEW_TIMING
510 mutable double shortestAverage_;
512 mutable double totalInR_;
513 mutable double totalInIncreasingU_;
514 mutable int endLengthU_;
515 mutable int lastNumberPivots_;
516 mutable int effectiveStartNumberU_;
bool timeToRefactorize() const
double zeroTolerance() const
Zero tolerance.
int numberDense() const
Returns number of dense rows.
void setGoLongThreshold(int value)
Set switch to long/ordered if number rows >= this.
void updateColumnFT(CoinIndexedVector ®ionSparseFT, CoinIndexedVector &partialUpdate, int which)
Updates one column (FTRAN) Tries to do FT update puts partial update in vector.
void areaFactor(double value)
Set whether larger areas needed.
This just implements AbcFactorization when an AbcMatrix object is passed.
void setPivots(int value) const
Sets number of pivots since factorization.
virtual double checkReplacePart1(CoinIndexedVector *, int)
Checks if can replace one Column to basis, returns update alpha Fills in region for use later partial...
int updateColumn(CoinIndexedVector ®ionSparse) const
Updates one column (FTRAN)
void synchronize(const ClpFactorization *otherFactorization, const AbcSimplex *model)
Synchronize stuff.
double * pivotRegion() const
pivot region
int goLongThreshold_
Switch to long/ordered if number rows >= this.
int numberSlacks_
Number of slacks at last factorization.
Abstract base class which also has some scalars so can be used from Dense or Simp.
~AbcSimplexFactorization()
Destructor.
void updateColumnTransposeCpu(CoinIndexedVector ®ionSparse, int whichCpu) const
Updates one column (BTRAN)
virtual void updateFullColumnTranspose(CoinIndexedVector ®ionSparse) const =0
Updates one column (BTRAN) from unpacked regionSparse.
virtual int updateColumnFTPart1(CoinIndexedVector ®ionSparse)=0
void saferTolerances(double zeroTolerance, double pivotTolerance)
Set tolerances to safer of existing and given.
virtual int updateColumnTranspose(CoinIndexedVector ®ionSparse) const =0
Updates one column (BTRAN) from unpacked regionSparse.
double areaFactor() const
Area factor.
int factorize(AbcSimplex *model, int solveType, bool valuesPass)
When part of LP - given by basic variables.
virtual void updateFullColumn(CoinIndexedVector ®ionSparse) const =0
This version does FTRAN on array when indices not set up.
AbcSimplexFactorization & operator=(const AbcSimplexFactorization &)
void checkMarkArrays() const
int goSmallThreshold() const
Get switch to small if number rows <= this.
This just implements CoinFactorization when an ClpMatrixBase object is passed.
virtual int updateTwoColumnsFT(CoinIndexedVector ®ionFT, CoinIndexedVector ®ionOther)=0
does FTRAN on two unpacked columns
int updateTwoColumnsFT(CoinIndexedVector ®ionSparseFT, CoinIndexedVector ®ionSparseOther)
Updates one column (FTRAN) from regionFT Tries to do FT update number returned is negative if no room...
int numberRows() const
Number of Rows after factorization.
int updateColumnFTPart1(CoinIndexedVector ®ionSparseFT)
virtual CoinFactorizationDouble * pivotRegion() const
AbcSimplexFactorization(int numberRows=0)
Default constructor.
void setStatus(int value)
Sets status.
int status() const
Returns status.
double checkReplacePart1(CoinIndexedVector *regionSparse, CoinIndexedVector *partialUpdate, int pivotRow)
Checks if can replace one Column to basis, returns update alpha Fills in region for use later partial...
int updateColumnFT(CoinIndexedVector ®ionSparseFT)
Updates one column (FTRAN) Tries to do FT update number returned is negative if no room...
virtual void updateColumnCpu(CoinIndexedVector ®ionSparse, int whichCpu) const
Updates one column (FTRAN)
double pivotTolerance() const
Pivot tolerance.
void zeroTolerance(double value)
Set zero tolerance.
virtual int updateColumnFT(CoinIndexedVector ®ionSparse)=0
Updates one column (FTRAN) from unpacked regionSparse Tries to do FT update number returned is negati...
void pivotTolerance(double value)
Set pivot tolerance.
double pivotTolerance() const
Pivot tolerance.
int goLongThreshold() const
Get switch to long/ordered if number rows >= this.
void updateFullColumn(CoinIndexedVector ®ionSparse) const
Updates one full column (FTRAN)
int checkReplacePart2(int pivotRow, double btranAlpha, double ftranAlpha, double ftAlpha)
Checks if can replace one Column to basis, returns 0=OK, 1=Probably OK, 2=singular, 3=no room, 5 max pivots.
int numberSlacks() const
Number of slacks at last factorization.
CoinSimplexInt numberDense() const
Number of dense rows after factorization.
void updateWeights(CoinIndexedVector ®ionSparse) const
Updates one column for dual steepest edge weights (FTRAN)
int pivots() const
Returns number of pivots since factorization.
void clearArrays()
Get rid of all memory.
double zeroTolerance() const
Zero tolerance.
void setModel(AbcSimplex *model)
Sets model.
int forceB_
If nonzero force use of 1,dense 2,small 3,long.
void updateFullColumnTranspose(CoinIndexedVector ®ionSparse) const
Updates one full column (BTRAN)
int goDenseThreshold() const
Get switch to dense if number rows <= this.
void setFactorization(AbcSimplexFactorization &rhs)
Sets factorization.
void maximumPivots(int value)
Set maximum number of pivots between factorizations.
void goSparse()
makes a row copy of L for speed and to allow very sparse problems
void setStatus(int value)
Sets status.
virtual void updateColumnTransposeCpu(CoinIndexedVector ®ionSparse, int whichCpu) const
Updates one column (BTRAN)
void forceOtherFactorization(int which)
If nonzero force use of 1,dense 2,small 3,long.
void updateColumnCpu(CoinIndexedVector ®ionSparse, int whichCpu) const
Updates one column (FTRAN)
CoinAbcAnyFactorization * factorization() const
Pointer to factorization.
virtual int updateColumn(CoinIndexedVector ®ionSparse) const =0
This version has same effect as above with FTUpdate==false so number returned is always >=0...
virtual void checkReplacePart1a(CoinIndexedVector *, int)
virtual int numberElements() const =0
Total number of elements in factorization.
void replaceColumnPart3(const AbcSimplex *model, CoinIndexedVector *regionSparse, CoinIndexedVector *tableauColumn, int pivotRow, double alpha)
Replaces one Column to basis, partial update already in U.
int typeOfFactorization() const
Returns type.
void setPivots(int value)
Sets number of pivots since factorization.
double minimumPivotTolerance() const
Minimum pivot tolerance.
virtual bool wantsTableauColumn() const
Returns true if wants tableauColumn in replaceColumn.
double areaFactor() const
Whether larger areas needed.
double minimumPivotTolerance() const
Minimum pivot tolerance.
int getDenseThreshold() const
int numberRows() const
Number of Rows after factorization.
int goSmallThreshold_
Switch to small if number rows <= this.
void setGoSmallThreshold(int value)
Set switch to small if number rows <= this.
This deals with Factorization and Updates.
virtual double checkReplacePart1b(CoinIndexedVector *, int)
virtual void updateWeights(CoinIndexedVector ®ionSparse) const =0
Updates one column for dual steepest edge weights (FTRAN)
void almostDestructor()
Allows change of pivot accuracy check 1.0 == none >1.0 relaxed.
virtual int checkReplacePart2(int pivotRow, double btranAlpha, double ftranAlpha, double ftAlpha, double acceptablePivot=1.0e-8)=0
Checks if can replace one Column to basis, returns 0=OK, 1=Probably OK, 2=singular, 3=no room, 5 max pivots.
bool usingFT() const
Returns true if doing FT.
int goDenseThreshold_
Switch to dense if number rows <= this.
int pivots() const
Returns number of pivots since factorization.
int updateColumnTranspose(CoinIndexedVector ®ionSparse) const
Updates one column (BTRAN)
double checkReplacePart1(CoinIndexedVector *regionSparse, int pivotRow)
Checks if can replace one Column to basis, returns update alpha Fills in region for use later partial...
void setGoDenseThreshold(int value)
Set switch to dense if number rows <= this.
void setDenseThreshold(int number)
So we can temporarily switch off dense.
int numberElements() const
Total number of elements in factorization.
int status() const
Returns status.
int maximumPivots() const
Maximum number of pivots between factorizations.
void minimumPivotTolerance(double value)
Set minimum pivot tolerance.
void goDenseOrSmall(int numberRows)
Go over to dense code.
virtual void checkMarkArrays() const
virtual void clearArrays()
Get rid of all memory.
CoinAbcAnyFactorization * coinAbcFactorization_
Pointer to factorization.
int maximumPivots() const
Maximum number of pivots between factorizations.
void updateColumnFTPart2(CoinIndexedVector ®ionSparseFT)
bool needToReorder() const
Says whether to redo pivot order.
virtual void updateColumnFTPart2(CoinIndexedVector ®ionSparse)=0
AbcSimplex * model_
Pointer to model.