Dip
0.92.4
|
Dual Row Pivot Abstract Base Class. More...
#include <AbcDualRowPivot.hpp>
Public Member Functions | |
Algorithmic methods | |
virtual int | pivotRow ()=0 |
Returns pivot row, -1 if none. More... | |
virtual double | updateWeights1 (CoinIndexedVector &input, CoinIndexedVector &updateColumn)=0 |
Does most of work for weights and returns pivot alpha. More... | |
virtual void | updateWeightsOnly (CoinIndexedVector &input)=0 |
Returns pivot row, -1 if none. More... | |
virtual double | updateWeights (CoinIndexedVector &input, CoinIndexedVector &updateColumn)=0 |
Returns pivot row, -1 if none. More... | |
virtual void | updateWeights2 (CoinIndexedVector &input, CoinIndexedVector &updateColumn)=0 |
Actually updates weights. More... | |
virtual void | updatePrimalSolution (CoinIndexedVector &updateColumn, double theta)=0 |
Updates primal solution (and maybe list of candidates) Uses input vector which it deletes Would be faster if we kept basic regions, but on other hand it means everything is always in sync. More... | |
virtual void | updatePrimalSolutionAndWeights (CoinIndexedVector &weightsVector, CoinIndexedVector &updateColumn, double theta) |
Returns pivot row, -1 if none. More... | |
virtual void | saveWeights (AbcSimplex *model, int mode) |
Saves any weights round factorization as pivot rows may change Will be empty unless steepest edge (will save model) May also recompute infeasibility stuff 1) before factorization 2) after good factorization (if weights empty may initialize) 3) after something happened but no factorization (e.g. More... | |
virtual void | recomputeInfeasibilities () |
Recompute infeasibilities. More... | |
virtual void | checkAccuracy () |
checks accuracy and may re-initialize (may be empty) More... | |
virtual void | clearArrays () |
Gets rid of all arrays (may be empty) More... | |
virtual bool | looksOptimal () const |
Returns true if would not find any row. More... | |
Constructors and destructors | |
AbcDualRowPivot () | |
Default Constructor. More... | |
AbcDualRowPivot (const AbcDualRowPivot &) | |
Copy constructor. More... | |
AbcDualRowPivot & | operator= (const AbcDualRowPivot &rhs) |
Assignment operator. More... | |
virtual | ~AbcDualRowPivot () |
Destructor. More... | |
virtual AbcDualRowPivot * | clone (bool copyData=true) const =0 |
Clone. More... | |
Other | |
AbcSimplex * | model () |
Returns model. More... | |
void | setModel (AbcSimplex *newmodel) |
Sets model (normally to NULL) More... | |
int | type () |
Returns type (above 63 is extra information) More... | |
Protected Attributes | |
Protected member data | |
AbcSimplex * | model_ |
Pointer to model. More... | |
int | type_ |
Type of row pivot algorithm. More... | |
Dual Row Pivot Abstract Base Class.
Abstract Base Class for describing an interface to an algorithm to choose row pivot in dual simplex algorithm. For some algorithms e.g. Dantzig choice then some functions may be null.
Definition at line 23 of file AbcDualRowPivot.hpp.
AbcDualRowPivot::AbcDualRowPivot | ( | ) |
Default Constructor.
AbcDualRowPivot::AbcDualRowPivot | ( | const AbcDualRowPivot & | ) |
Copy constructor.
|
virtual |
Destructor.
|
pure virtual |
Returns pivot row, -1 if none.
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
pure virtual |
Does most of work for weights and returns pivot alpha.
Also does FT update
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
pure virtual |
Returns pivot row, -1 if none.
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
pure virtual |
Returns pivot row, -1 if none.
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
pure virtual |
Actually updates weights.
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
pure virtual |
Updates primal solution (and maybe list of candidates) Uses input vector which it deletes Would be faster if we kept basic regions, but on other hand it means everything is always in sync.
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
virtual |
Returns pivot row, -1 if none.
Reimplemented in AbcDualRowSteepest.
|
virtual |
Saves any weights round factorization as pivot rows may change Will be empty unless steepest edge (will save model) May also recompute infeasibility stuff 1) before factorization 2) after good factorization (if weights empty may initialize) 3) after something happened but no factorization (e.g.
check for infeasible) 4) as 2 but restore weights from previous snapshot 5) for strong branching - initialize , infeasibilities
Reimplemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
virtual |
Recompute infeasibilities.
Reimplemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
virtual |
checks accuracy and may re-initialize (may be empty)
|
virtual |
Gets rid of all arrays (may be empty)
Reimplemented in AbcDualRowSteepest.
|
inlinevirtual |
Returns true if would not find any row.
Reimplemented in AbcDualRowSteepest.
Definition at line 69 of file AbcDualRowPivot.hpp.
AbcDualRowPivot& AbcDualRowPivot::operator= | ( | const AbcDualRowPivot & | rhs | ) |
Assignment operator.
|
pure virtual |
Clone.
Implemented in AbcDualRowSteepest, and AbcDualRowDantzig.
|
inline |
Returns model.
Definition at line 97 of file AbcDualRowPivot.hpp.
|
inline |
Sets model (normally to NULL)
Definition at line 103 of file AbcDualRowPivot.hpp.
References model_.
|
inline |
Returns type (above 63 is extra information)
Definition at line 109 of file AbcDualRowPivot.hpp.
References type_.
|
protected |
Pointer to model.
Definition at line 122 of file AbcDualRowPivot.hpp.
Referenced by AbcDualRowSteepest::model(), and setModel().
|
protected |
Type of row pivot algorithm.
Definition at line 124 of file AbcDualRowPivot.hpp.
Referenced by type().