#include <ClpPrimalColumnDantzig.hpp>
Inheritance diagram for ClpPrimalColumnDantzig:
Public Methods | |
Algorithmic methods | |
virtual int | pivotColumn (CoinIndexedVector *updates, CoinIndexedVector *spareRow1, CoinIndexedVector *spareRow2, CoinIndexedVector *spareColumn1, CoinIndexedVector *spareColumn2) |
Returns pivot column, -1 if none. | |
virtual void | saveWeights (ClpSimplex *model, int mode) |
Just sets model. | |
Constructors and destructors | |
ClpPrimalColumnDantzig () | |
Default Constructor. | |
ClpPrimalColumnDantzig (const ClpPrimalColumnDantzig &) | |
Copy constructor. | |
ClpPrimalColumnDantzig & | operator= (const ClpPrimalColumnDantzig &rhs) |
Assignment operator. | |
virtual | ~ClpPrimalColumnDantzig () |
Destructor. | |
virtual ClpPrimalColumnPivot * | clone (bool copyData=true) const |
Clone. |
This is simplest choice - choose largest infeasibility
Definition at line 16 of file ClpPrimalColumnDantzig.hpp.
|
Default Constructor.
|
|
Copy constructor.
|
|
Destructor.
|
|
Returns pivot column, -1 if none. Lumbers over all columns - slow The Packed CoinIndexedVector updates has cost updates - for normal LP that is just +-weight where a feasibility changed. It also has reduced cost from last iteration in pivot row Can just do full price if you really want to be slow Implements ClpPrimalColumnPivot. |
|
Just sets model.
Implements ClpPrimalColumnPivot. Definition at line 37 of file ClpPrimalColumnDantzig.hpp. References ClpPrimalColumnPivot::model_. |
|
Assignment operator.
|
|
Clone.
Implements ClpPrimalColumnPivot. |