Go to the documentation of this file.
12 #ifndef ClpPEDualRowSteepest_H
13 #define ClpPEDualRowSteepest_H
17 class CoinIndexedVector;
69 double &changeInObjective);
73 inline double psi()
const
This solves LPs using the simplex method.
ClpSimplex * model()
Returns model.
ClpPEDualRowSteepest(double psi=0.5, int mode=3)
Default Constructor mode: 0 is uninitialized, 1 full, 2 is partial uninitialized, 3 starts as 2 but m...
int coConsecutiveCompatibles_
Dual Row Pivot Steepest Edge Algorithm Class.
virtual void updatePrimalSolution(CoinIndexedVector *input, double theta, double &changeInObjective)
Updates primal solution (and maybe list of candidates) Uses input vector which it deletes Computes ch...
Dual Row Pivot Steepest Edge Algorithm Class.
virtual ClpDualRowPivot * clone(bool copyData=true) const
Clone.
BASE CLASS FOR THE IMPROVED SIMPLEX.
virtual void saveWeights(ClpSimplex *model, int mode)
Save weights - this may initialize weights as well This is as parent but may initialize ClpPESimplex.
ClpPEDualRowSteepest & operator=(const ClpPEDualRowSteepest &rhs)
Assignment operator.
Dual Row Pivot Abstract Base Class.
virtual ~ClpPEDualRowSteepest()
Destructor.
virtual int pivotRow()
Returns pivot row, -1 if none.