Clp
1.17.8
|
Dual Row Pivot Steepest Edge Algorithm Class. More...
#include <AbcDualRowSteepest.hpp>
Public Member Functions | |
Constructors and destructors | |
AbcDualRowSteepest (int mode=3) | |
Default Constructor 0 is uninitialized, 1 full, 2 is partial uninitialized, 3 starts as 2 but may switch to 1. More... | |
AbcDualRowSteepest (const AbcDualRowSteepest &) | |
Copy constructor. More... | |
AbcDualRowSteepest & | operator= (const AbcDualRowSteepest &rhs) |
Assignment operator. More... | |
void | fill (const AbcDualRowSteepest &rhs) |
Fill most values. More... | |
virtual | ~AbcDualRowSteepest () |
Destructor. More... | |
virtual AbcDualRowPivot * | clone (bool copyData=true) const |
Clone. More... | |
gets and sets | |
int | mode () const |
Mode. More... | |
void | setPersistence (Persistence life) |
Set/ get persistence. More... | |
Persistence | persistence () const |
CoinIndexedVector * | infeasible () const |
Infeasible vector. More... | |
CoinIndexedVector * | weights () const |
Weights vector. More... | |
AbcSimplex * | model () const |
Model. More... | |
Public Member Functions inherited from AbcDualRowPivot | |
virtual void | checkAccuracy () |
checks accuracy and may re-initialize (may be empty) More... | |
AbcDualRowPivot () | |
Default Constructor. More... | |
AbcDualRowPivot (const AbcDualRowPivot &) | |
Copy constructor. More... | |
AbcDualRowPivot & | operator= (const AbcDualRowPivot &rhs) |
Assignment operator. More... | |
virtual | ~AbcDualRowPivot () |
Destructor. More... | |
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... | |
Private Attributes | |
Private member data | |
norm saved before going into update | |
double | norm_ |
double | factorizationRatio_ |
Ratio of size of factorization to number of rows. More... | |
int | state_ |
Status 0) Normal -1) Needs initialization 1) Weights are stored by sequence number. More... | |
int | mode_ |
If 0 then we are using uninitialized weights, 1 then full, if 2 then uninitialized partial, 3 switchable. More... | |
Persistence | persistence_ |
Life of weights. More... | |
CoinIndexedVector * | weights_ |
weight array More... | |
CoinIndexedVector * | infeasible_ |
square of infeasibility array (just for infeasible rows) More... | |
CoinIndexedVector * | savedWeights_ |
save weight array (so we can use checkpoint) More... | |
Algorithmic methods | |
enum | Persistence { normal = 0x00, keep = 0x01 } |
enums for persistence More... | |
virtual int | pivotRow () |
Returns pivot row, -1 if none. More... | |
virtual double | updateWeights (CoinIndexedVector &input, CoinIndexedVector &updatedColumn) |
Updates weights and returns pivot alpha. More... | |
virtual double | updateWeights1 (CoinIndexedVector &input, CoinIndexedVector &updateColumn) |
Does most of work for weights and returns pivot alpha. More... | |
virtual void | updateWeightsOnly (CoinIndexedVector &input) |
virtual void | updateWeights2 (CoinIndexedVector &input, CoinIndexedVector &updateColumn) |
Actually updates weights. More... | |
virtual void | updatePrimalSolution (CoinIndexedVector &input, double theta) |
Updates primal solution (and maybe list of candidates) Uses input vector which it deletes. More... | |
virtual void | updatePrimalSolutionAndWeights (CoinIndexedVector &weightsVector, CoinIndexedVector &updateColumn, double theta) |
virtual void | saveWeights (AbcSimplex *model, int mode) |
Saves any weights round factorization as pivot rows may change 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 | clearArrays () |
Gets rid of all arrays. More... | |
virtual bool | looksOptimal () const |
Returns true if would not find any row. More... | |
Additional Inherited Members | |
Protected Attributes inherited from AbcDualRowPivot | |
AbcSimplex * | model_ |
Pointer to model. More... | |
int | type_ |
Type of row pivot algorithm. More... | |
Dual Row Pivot Steepest Edge Algorithm Class.
See Forrest-Goldfarb paper for algorithm
Definition at line 20 of file AbcDualRowSteepest.hpp.
AbcDualRowSteepest::AbcDualRowSteepest | ( | int | mode = 3 | ) |
Default Constructor 0 is uninitialized, 1 full, 2 is partial uninitialized, 3 starts as 2 but may switch to 1.
By partial is meant that the weights are updated as normal but only part of the infeasible basic variables are scanned. This can be faster on very easy problems.
AbcDualRowSteepest::AbcDualRowSteepest | ( | const AbcDualRowSteepest & | ) |
Copy constructor.
|
virtual |
Destructor.
|
virtual |
Returns pivot row, -1 if none.
Implements AbcDualRowPivot.
|
virtual |
|
virtual |
Does most of work for weights and returns pivot alpha.
Also does FT update
Implements AbcDualRowPivot.
|
virtual |
Implements AbcDualRowPivot.
|
virtual |
Actually updates weights.
Implements AbcDualRowPivot.
|
virtual |
Updates primal solution (and maybe list of candidates) Uses input vector which it deletes.
Implements AbcDualRowPivot.
|
virtual |
Reimplemented from AbcDualRowPivot.
|
virtual |
Saves any weights round factorization as pivot rows may change 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 (uninitialized) , infeasibilities
Reimplemented from AbcDualRowPivot.
|
virtual |
Recompute infeasibilities.
Reimplemented from AbcDualRowPivot.
|
virtual |
Gets rid of all arrays.
Reimplemented from AbcDualRowPivot.
|
virtual |
Returns true if would not find any row.
Reimplemented from AbcDualRowPivot.
AbcDualRowSteepest& AbcDualRowSteepest::operator= | ( | const AbcDualRowSteepest & | rhs | ) |
Assignment operator.
void AbcDualRowSteepest::fill | ( | const AbcDualRowSteepest & | rhs | ) |
Fill most values.
|
virtual |
Clone.
Implements AbcDualRowPivot.
|
inline |
Mode.
Definition at line 102 of file AbcDualRowSteepest.hpp.
|
inline |
Set/ get persistence.
Definition at line 107 of file AbcDualRowSteepest.hpp.
|
inline |
Definition at line 111 of file AbcDualRowSteepest.hpp.
|
inline |
Infeasible vector.
Definition at line 116 of file AbcDualRowSteepest.hpp.
|
inline |
Weights vector.
Definition at line 121 of file AbcDualRowSteepest.hpp.
|
inline |
Model.
Definition at line 126 of file AbcDualRowSteepest.hpp.
|
private |
Definition at line 137 of file AbcDualRowSteepest.hpp.
|
private |
Ratio of size of factorization to number of rows.
Definition at line 139 of file AbcDualRowSteepest.hpp.
|
private |
Status 0) Normal -1) Needs initialization 1) Weights are stored by sequence number.
Definition at line 145 of file AbcDualRowSteepest.hpp.
|
private |
If 0 then we are using uninitialized weights, 1 then full, if 2 then uninitialized partial, 3 switchable.
Definition at line 148 of file AbcDualRowSteepest.hpp.
|
private |
Life of weights.
Definition at line 150 of file AbcDualRowSteepest.hpp.
|
private |
weight array
Definition at line 152 of file AbcDualRowSteepest.hpp.
|
private |
square of infeasibility array (just for infeasible rows)
Definition at line 154 of file AbcDualRowSteepest.hpp.
|
private |
save weight array (so we can use checkpoint)
Definition at line 156 of file AbcDualRowSteepest.hpp.