#include <ClpPrimalQuadraticDantzig.hpp>
Inheritance diagram for ClpPrimalQuadraticDantzig:
Public Member Functions | |
Algorithmic methods | |
virtual int | pivotColumn (CoinIndexedVector *updates, CoinIndexedVector *spareRow1, CoinIndexedVector *spareRow2, CoinIndexedVector *spareColumn1, CoinIndexedVector *spareColumn2) |
virtual void | saveWeights (ClpSimplex *model, int mode) |
Just sets model. | |
Constructors and destructors | |
ClpPrimalQuadraticDantzig () | |
Default Constructor. | |
ClpPrimalQuadraticDantzig (const ClpPrimalQuadraticDantzig &) | |
Copy constructor. | |
ClpPrimalQuadraticDantzig (ClpSimplexPrimalQuadratic *model, ClpQuadraticInfo *info) | |
Constructor from model. | |
ClpPrimalQuadraticDantzig & | operator= (const ClpPrimalQuadraticDantzig &rhs) |
Assignment operator. | |
virtual | ~ClpPrimalQuadraticDantzig () |
Destructor. | |
virtual ClpPrimalColumnPivot * | clone (bool copyData=true) const |
Clone. | |
Private Attributes | |
Private member data | |
Pointer to info | |
ClpQuadraticInfo * | quadraticInfo_ |
This is simplest choice - choose largest infeasibility
Definition at line 17 of file ClpPrimalQuadraticDantzig.hpp.
|
Returns pivot column, -1 if none. Lumbers over all columns - slow updateArray has cost updates (also use pivotRow_ from last iteration) Can just do full price if you really want to be slow Implements ClpPrimalColumnPivot. |