6 #ifndef ClpPrimalcolumnPivot_H 
    7 #define ClpPrimalcolumnPivot_H 
  157 #ifndef CLP_PRIMAL_SLACK_MULTIPLIER 
  158 #define CLP_PRIMAL_SLACK_MULTIPLIER 1.01 
virtual void maximumPivotsChanged()
Called when maximum pivots changes. 
ClpSimplex * model_
Pointer to model. 
Primal Column Pivot Abstract Base Class. 
virtual void saveWeights(ClpSimplex *model, int mode)=0
Saves any weights round factorization as pivot rows may change Will be empty unless steepest edge (wi...
virtual void clearArrays()
Gets rid of all arrays (may be empty) 
bool looksOptimal_
Says if looks optimal (normally computed) 
virtual void switchOffSprint()
Switch off sprint idea. 
ClpPrimalColumnPivot & operator=(const ClpPrimalColumnPivot &rhs)
Assignment operator. 
virtual void updateWeights(CoinIndexedVector *input)
Updates weights - part 1 (may be empty) 
virtual ClpPrimalColumnPivot * clone(bool copyData=true) const =0
Clone. 
virtual int pivotRow(double &way)
Signals pivot row choice: -2 (default) - use normal pivot row choice -1 to numberRows-1 - use this (w...
int type()
Returns type (above 63 is extra information) 
This solves LPs using the simplex method. 
virtual int pivotColumn(CoinIndexedVector *updates, CoinIndexedVector *spareRow1, CoinIndexedVector *spareRow2, CoinIndexedVector *spareColumn1, CoinIndexedVector *spareColumn2)=0
Returns pivot column, -1 if none. 
virtual void setLooksOptimal(bool flag)
Sets optimality flag (for advanced use) 
ClpPrimalColumnPivot()
Default Constructor. 
virtual int numberSprintColumns(int &numberIterations) const 
Returns number of extra columns for sprint algorithm - 0 means off. 
virtual bool looksOptimal() const 
Returns true if would not find any column. 
ClpSimplex * model()
Returns model. 
virtual ~ClpPrimalColumnPivot()
Destructor. 
int type_
Type of column pivot algorithm. 
void setModel(ClpSimplex *newmodel)
Sets model.