#include <ClpMatrixBase.hpp>
Inheritance diagram for ClpMatrixBase:
Constructors, destructor<br> | |
NOTE: All constructors are protected.
There's no need to expose them, after all, this is an abstract class. | |
virtual | ~ClpMatrixBase () |
Destructor (has to be public). | |
ClpMatrixBase () | |
Default constructor. | |
ClpMatrixBase (const ClpMatrixBase &) | |
Destructor (has to be public). | |
ClpMatrixBase & | operator= (const ClpMatrixBase &) |
Destructor (has to be public). | |
Public Member Functions | |
Virtual methods that the derived classes must provide | |
virtual CoinPackedMatrix * | getPackedMatrix () const=0 |
Return a complete CoinPackedMatrix. | |
virtual bool | isColOrdered () const=0 |
Whether the packed matrix is column major ordered or not. | |
virtual CoinBigIndex | getNumElements () const=0 |
Number of entries in the packed matrix. | |
virtual int | getNumCols () const=0 |
Number of columns. | |
virtual int | getNumRows () const=0 |
Number of rows. | |
virtual const double * | getElements () const=0 |
A vector containing the elements in the packed matrix. | |
virtual const int * | getIndices () const=0 |
A vector containing the minor indices of the elements in the packed matrix. | |
virtual const CoinBigIndex * | getVectorStarts () const=0 |
Return a complete CoinPackedMatrix. | |
virtual const int * | getVectorLengths () const=0 |
The lengths of the major-dimension vectors. | |
virtual void | deleteCols (const int numDel, const int *indDel)=0 |
Delete the columns whose indices are listed in indDel . | |
virtual void | deleteRows (const int numDel, const int *indDel)=0 |
Delete the rows whose indices are listed in indDel . | |
virtual void | appendCols (int number, const CoinPackedVectorBase *const *columns) |
Append Columns. | |
virtual void | appendRows (int number, const CoinPackedVectorBase *const *rows) |
Append Rows. | |
virtual ClpMatrixBase * | reverseOrderedCopy () const |
Returns a new matrix in reverse order without gaps Is allowed to return NULL if doesn't want to have row copy. | |
virtual CoinBigIndex | fillBasis (ClpSimplex *model, const int *whichColumn, int numberRowBasic, int &numberColumnBasic, int *row, int *column, double *element)=0 |
If element NULL returns number of elements in column part of basis, If not NULL fills in as well. | |
virtual int | scale (ClpModel *model) const |
Creates scales for column copy (rowCopy in model may be modified) default does not allow scaling returns non-zero if no scaling done. | |
virtual void | scaleRowCopy (ClpModel *model) const |
Scales rowCopy if column copy scaled Only called if scales already exist. | |
virtual ClpMatrixBase * | scaledColumnCopy (ClpModel *model) const |
Realy really scales column copy Only called if scales already exist. | |
virtual bool | allElementsInRange (ClpModel *model, double smallest, double largest) |
Checks if all elements are in valid range. | |
virtual void | rangeOfElements (double &smallestNegative, double &largestNegative, double &smallestPositive, double &largestPositive) |
Returns largest and smallest elements of both signs. | |
virtual void | unpack (const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const=0 |
Unpacks a column into an CoinIndexedvector. | |
virtual void | unpackPacked (ClpSimplex *model, CoinIndexedVector *rowArray, int column) const=0 |
Unpacks a column into an CoinIndexedvector in packed foramt Note that model is NOT const. | |
virtual int | refresh (ClpSimplex *model) |
Purely for column generation and similar ideas. | |
virtual void | reallyScale (const double *rowScale, const double *columnScale) |
Return a complete CoinPackedMatrix. | |
virtual CoinBigIndex * | dubiousWeights (const ClpSimplex *model, int *inputWeights) const |
Given positive integer weights for each row fills in sum of weights for each column (and slack). | |
virtual void | add (const ClpSimplex *model, CoinIndexedVector *rowArray, int column, double multiplier) const=0 |
Adds multiple of a column into an CoinIndexedvector You can use quickAdd to add to vector. | |
virtual void | add (const ClpSimplex *model, double *array, int column, double multiplier) const=0 |
Adds multiple of a column into an array. | |
virtual void | releasePackedMatrix () const=0 |
Allow any parts of a created CoinPackedMatrix to be deleted. | |
virtual bool | canDoPartialPricing () const |
Says whether it can do partial pricing. | |
virtual int | hiddenRows () const |
Returns number of hidden rows e.g. gub. | |
virtual void | partialPricing (ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted) |
Partial pricing. | |
virtual int | extendUpdated (ClpSimplex *model, CoinIndexedVector *update, int mode) |
expands an updated column to allow for extra rows which the main solver does not know about and returns number added. | |
virtual void | primalExpanded (ClpSimplex *model, int mode) |
utility primal function for dealing with dynamic constraints mode=0 - Set up before "update" and "times" for primal solution using extended rows mode=1 - Cleanup primal solution after "times" using extended rows. | |
virtual void | dualExpanded (ClpSimplex *model, CoinIndexedVector *array, double *other, int mode) |
utility dual function for dealing with dynamic constraints mode=0 - Set up before "updateTranspose" and "transposeTimes" for duals using extended updates array (and may use other if dual values pass) mode=1 - Update dual solution after "transposeTimes" using extended rows. | |
virtual int | generalExpanded (ClpSimplex *model, int mode, int &number) |
general utility function for dealing with dynamic constraints mode=0 - Create list of non-key basics in pivotVariable_ using number as numberBasic in and out mode=1 - Set all key variables as basic mode=2 - return number extra rows needed, number gives maximum number basic mode=3 - before replaceColumn mode=4 - return 1 if can do primal, 2 if dual, 3 if both mode=5 - save any status stuff (when in good state) mode=6 - restore status stuff mode=7 - flag given variable (normally sequenceIn) mode=8 - unflag all variables mode=9 - synchronize costs and bounds mode=10 - return 1 if there may be changing bounds on variable (column generation) mode=11 - make sure set is clean (used when a variable rejected - but not flagged) mode=12 - after factorize but before permute stuff mode=13 - at end of simplex to delete stuff | |
virtual int | updatePivot (ClpSimplex *model, double oldInValue, double oldOutValue) |
update information for a pivot (and effective rhs) | |
virtual void | createVariable (ClpSimplex *model, int &bestSequence) |
Creates a variable. | |
virtual int | checkFeasible (ClpSimplex *model) const |
Just for debug if odd type matrix. | |
double | reducedCost (ClpSimplex *model, int sequence) const |
Returns reduced cost of a variable. | |
virtual void | correctSequence (int &sequenceIn, int &sequenceOut) const |
Correct sequence in and out to give true value. | |
Matrix times vector methods | |
They can be faster if scalar is +- 1 Also for simplex I am not using basic/non-basic split | |
virtual void | times (double scalar, const double *x, double *y) const=0 |
Return y + A * x * scalar in y . | |
virtual void | times (double scalar, const double *x, double *y, const double *rowScale, const double *columnScale) const |
And for scaling - default aborts for when scaling not supported (unless pointers NULL when as normal). | |
virtual void | transposeTimes (double scalar, const double *x, double *y) const=0 |
Return y + x * scalar * A in y . | |
virtual void | transposeTimes (double scalar, const double *x, double *y, const double *rowScale, const double *columnScale) const |
And for scaling - default aborts for when scaling not supported (unless pointers NULL when as normal). | |
virtual void | transposeTimes (const ClpSimplex *model, double scalar, const CoinIndexedVector *x, CoinIndexedVector *y, CoinIndexedVector *z) const=0 |
Return x * scalar *A + y in z . | |
virtual void | subsetTransposeTimes (const ClpSimplex *model, const CoinIndexedVector *x, const CoinIndexedVector *y, CoinIndexedVector *z) const=0 |
Return x *A in z but just for indices in y. | |
Other | |
Clone | |
virtual ClpMatrixBase * | clone () const=0 |
virtual ClpMatrixBase * | subsetClone (int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const |
Subset clone (without gaps). | |
int | type () const |
Returns type. | |
void | setType (int type) |
Sets type. | |
void | useEffectiveRhs (ClpSimplex *model) |
Sets up an effective RHS. | |
virtual double * | rhsOffset (ClpSimplex *model, bool forceRefresh=false, bool check=false) |
Returns effective RHS offset if it is being used. | |
int | lastRefresh () const |
If rhsOffset used this is iteration last refreshed. | |
int | refreshFrequency () const |
If rhsOffset used this is refresh frequency (0==off). | |
void | setRefreshFrequency (int value) |
bool | skipDualCheck () const |
whether to skip dual checks most of time | |
void | setSkipDualCheck (bool yes) |
int | minimumObjectsScan () const |
Partial pricing tuning parameter - minimum number of "objects" to scan. | |
void | setMinimumObjectsScan (int value) |
int | minimumGoodReducedCosts () const |
Partial pricing tuning parameter - minimum number of negative reduced costs to get. | |
void | setMinimumGoodReducedCosts (int value) |
double | startFraction () const |
Current start of search space in matrix (as fraction). | |
void | setStartFraction (double value) |
double | endFraction () const |
Current end of search space in matrix (as fraction). | |
void | setEndFraction (double value) |
double | savedBestDj () const |
Current best reduced cost. | |
void | setSavedBestDj (double value) |
int | originalWanted () const |
Initial number of negative reduced costs wanted. | |
void | setOriginalWanted (int value) |
int | currentWanted () const |
Current number of negative reduced costs which we still need. | |
void | setCurrentWanted (int value) |
int | savedBestSequence () const |
Current best sequence. | |
void | setSavedBestSequence (int value) |
Protected Attributes | |
Data members | |
The data members are protected to allow access for derived classes. | |
double * | rhsOffset_ |
Effective RHS offset if it is being used. | |
double | startFraction_ |
Current start of search space in matrix (as fraction). | |
double | endFraction_ |
Current end of search space in matrix (as fraction). | |
double | savedBestDj_ |
Best reduced cost so far. | |
int | originalWanted_ |
Initial number of negative reduced costs wanted. | |
int | currentWanted_ |
Current number of negative reduced costs which we still need. | |
int | savedBestSequence_ |
Saved best sequence in pricing. | |
int | type_ |
type (may be useful) | |
int | lastRefresh_ |
If rhsOffset used this is iteration last refreshed. | |
int | refreshFrequency_ |
If rhsOffset used this is refresh frequency (0==off). | |
int | minimumObjectsScan_ |
Partial pricing tuning parameter - minimum number of "objects" to scan. | |
int | minimumGoodReducedCosts_ |
Partial pricing tuning parameter - minimum number of negative reduced costs to get. | |
int | trueSequenceIn_ |
True sequence in (i.e. from larger problem). | |
int | trueSequenceOut_ |
True sequence out (i.e. from larger problem). | |
bool | skipDualCheck_ |
whether to skip dual checks most of time |
Since this class is abstract, no object of this type can be created.
If a derived class provides all methods then all Clp algorithms should work. Some can be very inefficient e.g. getElements etc is only used for tightening bounds for dual and the copies are deleted. Many methods can just be dummy i.e. abort(); if not all features are being used. So if column generation was being done then it makes no sense to do steepest edge so there would be no point providing subsetTransposeTimes.
Definition at line 26 of file ClpMatrixBase.hpp.
|
Default constructor.
|
|
Destructor (has to be public).
|
|
Destructor (has to be public).
|
|
Return a complete CoinPackedMatrix.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. Referenced by ClpModel::matrix(). |
|
Whether the packed matrix is column major ordered or not.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Number of entries in the packed matrix.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. Referenced by ClpModel::getNumElements(). |
|
Number of columns.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Number of rows.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
A vector containing the elements in the packed matrix. Note that there might be gaps in this list, entries that do not belong to any major-dimension vector. To get the actual elements one should look at this vector together with vectorStarts and vectorLengths. Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
A vector containing the minor indices of the elements in the packed matrix. Note that there might be gaps in this list, entries that do not belong to any major-dimension vector. To get the actual elements one should look at this vector together with vectorStarts and vectorLengths. Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Return a complete CoinPackedMatrix.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
The lengths of the major-dimension vectors.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Delete the columns whose indices are listed in
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Delete the rows whose indices are listed in
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Append Columns.
Reimplemented in ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Append Rows.
Reimplemented in ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Returns a new matrix in reverse order without gaps Is allowed to return NULL if doesn't want to have row copy.
Reimplemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. Definition at line 68 of file ClpMatrixBase.hpp. |
|
If element NULL returns number of elements in column part of basis, If not NULL fills in as well.
Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Creates scales for column copy (rowCopy in model may be modified) default does not allow scaling returns non-zero if no scaling done.
Reimplemented in ClpPackedMatrix. Definition at line 81 of file ClpMatrixBase.hpp. |
|
Scales rowCopy if column copy scaled Only called if scales already exist.
Reimplemented in ClpPackedMatrix. Definition at line 85 of file ClpMatrixBase.hpp. |
|
Realy really scales column copy Only called if scales already exist. Up to user to delete Reimplemented in ClpPackedMatrix. Definition at line 90 of file ClpMatrixBase.hpp. References clone(). |
|
Checks if all elements are in valid range. Can just return true if you are not paranoid. For Clp I will probably expect no zeros. Code can modify matrix to get rid of small elements. Reimplemented in ClpPackedMatrix. Definition at line 98 of file ClpMatrixBase.hpp. |
|
Returns largest and smallest elements of both signs. Largest refers to largest absolute value. If returns zeros then can't tell anything Reimplemented in ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Unpacks a column into an CoinIndexedvector.
Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Unpacks a column into an CoinIndexedvector in packed foramt Note that model is NOT const. Bounds and objective could be modified if doing column generation (just for this variable) Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Purely for column generation and similar ideas. Allows matrix and any bounds or costs to be updated (sensibly). Returns non-zero if any changes. Reimplemented in ClpDynamicMatrix, and ClpPackedMatrix. Definition at line 122 of file ClpMatrixBase.hpp. |
|
Return a complete CoinPackedMatrix.
Reimplemented in ClpPackedMatrix. |
|
Given positive integer weights for each row fills in sum of weights for each column (and slack). Returns weights vector Default returns vector of ones Reimplemented in ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Adds multiple of a column into an CoinIndexedvector You can use quickAdd to add to vector.
Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Adds multiple of a column into an array.
Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Allow any parts of a created CoinPackedMatrix to be deleted.
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Says whether it can do partial pricing.
Reimplemented in ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Returns number of hidden rows e.g. gub.
Reimplemented in ClpGubMatrix. |
|
Partial pricing.
Reimplemented in ClpDynamicExampleMatrix, ClpDynamicMatrix, ClpGubDynamicMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
expands an updated column to allow for extra rows which the main solver does not know about and returns number added. This will normally be a no-op - it is in for GUB but may get extended to general non-overlapping and embedded networks. mode 0 - extend mode 1 - delete etc Reimplemented in ClpGubMatrix. |
|
utility primal function for dealing with dynamic constraints mode=0 - Set up before "update" and "times" for primal solution using extended rows mode=1 - Cleanup primal solution after "times" using extended rows. mode=2 - Check (or report on) primal infeasibilities Reimplemented in ClpGubMatrix. |
|
utility dual function for dealing with dynamic constraints mode=0 - Set up before "updateTranspose" and "transposeTimes" for duals using extended updates array (and may use other if dual values pass) mode=1 - Update dual solution after "transposeTimes" using extended rows. mode=2 - Compute all djs and compute key dual infeasibilities mode=3 - Report on key dual infeasibilities mode=4 - Modify before updateTranspose in partial pricing Reimplemented in ClpDynamicMatrix, and ClpGubMatrix. |
|
general utility function for dealing with dynamic constraints mode=0 - Create list of non-key basics in pivotVariable_ using number as numberBasic in and out mode=1 - Set all key variables as basic mode=2 - return number extra rows needed, number gives maximum number basic mode=3 - before replaceColumn mode=4 - return 1 if can do primal, 2 if dual, 3 if both mode=5 - save any status stuff (when in good state) mode=6 - restore status stuff mode=7 - flag given variable (normally sequenceIn) mode=8 - unflag all variables mode=9 - synchronize costs and bounds mode=10 - return 1 if there may be changing bounds on variable (column generation) mode=11 - make sure set is clean (used when a variable rejected - but not flagged) mode=12 - after factorize but before permute stuff mode=13 - at end of simplex to delete stuff
Reimplemented in ClpDynamicMatrix, and ClpGubMatrix. |
|
update information for a pivot (and effective rhs)
Reimplemented in ClpDynamicMatrix, ClpGubDynamicMatrix, and ClpGubMatrix. |
|
Creates a variable. This is called after partial pricing and may modify matrix. May update bestSequence. Reimplemented in ClpDynamicExampleMatrix, and ClpDynamicMatrix. |
|
Just for debug if odd type matrix. Returns number of primal infeasibilities. Reimplemented in ClpGubDynamicMatrix. |
|
Returns reduced cost of a variable.
Reimplemented in ClpDynamicMatrix. |
|
Correct sequence in and out to give true value.
Reimplemented in ClpGubMatrix. |
|
Return
Implemented in ClpDummyMatrix, ClpDynamicMatrix, ClpGubDynamicMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
And for scaling - default aborts for when scaling not supported (unless pointers NULL when as normal).
Reimplemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Return
Implemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
And for scaling - default aborts for when scaling not supported (unless pointers NULL when as normal).
Reimplemented in ClpDummyMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Return Can use y as temporary array (will be empty at end) Note - If x packed mode - then z packed mode Squashes small elements and knows about ClpSimplex Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Return This is only needed for primal steepest edge. Note - z always packed mode Squashes small elements and knows about ClpSimplex Implemented in ClpDummyMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Implemented in ClpDummyMatrix, ClpDynamicExampleMatrix, ClpDynamicMatrix, ClpGubDynamicMatrix, ClpGubMatrix, ClpNetworkMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. Referenced by scaledColumnCopy(). |
|
Subset clone (without gaps). Duplicates are allowed and order is as given. Derived classes need not provide this as it may not always make sense Reimplemented in ClpGubMatrix, ClpPackedMatrix, and ClpPlusMinusOneMatrix. |
|
Returns type. The types which code may need to know about are: 1 - ClpPackedMatrix 11 - ClpNetworkMatrix 12 - ClpPlusMinusOneMatrix Definition at line 277 of file ClpMatrixBase.hpp. References type_. |
|
Sets type.
Definition at line 280 of file ClpMatrixBase.hpp. References type_. |
|
Sets up an effective RHS.
Reimplemented in ClpPackedMatrix. |
|
Returns effective RHS offset if it is being used. This is used for long problems or big gub or anywhere where going through full columns is expensive. This may re-compute Reimplemented in ClpDynamicMatrix, ClpGubDynamicMatrix, and ClpGubMatrix. |
|
If rhsOffset used this is iteration last refreshed.
Definition at line 289 of file ClpMatrixBase.hpp. References lastRefresh_. |
|
If rhsOffset used this is refresh frequency (0==off).
Definition at line 292 of file ClpMatrixBase.hpp. References refreshFrequency_. |
|
Definition at line 294 of file ClpMatrixBase.hpp. References refreshFrequency_. |
|
whether to skip dual checks most of time
Definition at line 297 of file ClpMatrixBase.hpp. References skipDualCheck_. |
|
Definition at line 299 of file ClpMatrixBase.hpp. References skipDualCheck_. |
|
Partial pricing tuning parameter - minimum number of "objects" to scan. e.g. number of Gub sets but could be number of variables Definition at line 303 of file ClpMatrixBase.hpp. References minimumObjectsScan_. |
|
Definition at line 305 of file ClpMatrixBase.hpp. References minimumObjectsScan_. |
|
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
Definition at line 308 of file ClpMatrixBase.hpp. References minimumGoodReducedCosts_. |
|
Definition at line 310 of file ClpMatrixBase.hpp. References minimumGoodReducedCosts_. |
|
Current start of search space in matrix (as fraction).
Definition at line 313 of file ClpMatrixBase.hpp. References startFraction_. |
|
Definition at line 315 of file ClpMatrixBase.hpp. References startFraction_. |
|
Current end of search space in matrix (as fraction).
Definition at line 318 of file ClpMatrixBase.hpp. References endFraction_. |
|
Definition at line 320 of file ClpMatrixBase.hpp. References endFraction_. |
|
Current best reduced cost.
Definition at line 323 of file ClpMatrixBase.hpp. References savedBestDj_. |
|
Definition at line 325 of file ClpMatrixBase.hpp. References savedBestDj_. |
|
Initial number of negative reduced costs wanted.
Definition at line 328 of file ClpMatrixBase.hpp. References originalWanted_. |
|
Definition at line 330 of file ClpMatrixBase.hpp. References originalWanted_. |
|
Current number of negative reduced costs which we still need.
Definition at line 333 of file ClpMatrixBase.hpp. References currentWanted_. |
|
Definition at line 335 of file ClpMatrixBase.hpp. References currentWanted_. |
|
Current best sequence.
Definition at line 338 of file ClpMatrixBase.hpp. References savedBestSequence_. |
|
Definition at line 340 of file ClpMatrixBase.hpp. References savedBestSequence_. |
|
Destructor (has to be public).
|
|
Effective RHS offset if it is being used. This is used for long problems or big gub or anywhere where going through full columns is expensive Definition at line 371 of file ClpMatrixBase.hpp. |
|
Current start of search space in matrix (as fraction).
Definition at line 373 of file ClpMatrixBase.hpp. Referenced by setStartFraction(), and startFraction(). |
|
Current end of search space in matrix (as fraction).
Definition at line 375 of file ClpMatrixBase.hpp. Referenced by endFraction(), and setEndFraction(). |
|
Best reduced cost so far.
Definition at line 377 of file ClpMatrixBase.hpp. Referenced by savedBestDj(), and setSavedBestDj(). |
|
Initial number of negative reduced costs wanted.
Definition at line 379 of file ClpMatrixBase.hpp. Referenced by originalWanted(), and setOriginalWanted(). |
|
Current number of negative reduced costs which we still need.
Definition at line 381 of file ClpMatrixBase.hpp. Referenced by currentWanted(), and setCurrentWanted(). |
|
Saved best sequence in pricing.
Definition at line 383 of file ClpMatrixBase.hpp. Referenced by savedBestSequence(), and setSavedBestSequence(). |
|
type (may be useful)
Definition at line 385 of file ClpMatrixBase.hpp. |
|
If rhsOffset used this is iteration last refreshed.
Definition at line 387 of file ClpMatrixBase.hpp. Referenced by lastRefresh(). |
|
If rhsOffset used this is refresh frequency (0==off).
Definition at line 389 of file ClpMatrixBase.hpp. Referenced by refreshFrequency(), and setRefreshFrequency(). |
|
Partial pricing tuning parameter - minimum number of "objects" to scan.
Definition at line 391 of file ClpMatrixBase.hpp. Referenced by minimumObjectsScan(), and setMinimumObjectsScan(). |
|
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
Definition at line 393 of file ClpMatrixBase.hpp. Referenced by minimumGoodReducedCosts(), and setMinimumGoodReducedCosts(). |
|
True sequence in (i.e. from larger problem).
Definition at line 395 of file ClpMatrixBase.hpp. |
|
True sequence out (i.e. from larger problem).
Definition at line 397 of file ClpMatrixBase.hpp. |
|
whether to skip dual checks most of time
Definition at line 399 of file ClpMatrixBase.hpp. Referenced by setSkipDualCheck(), and skipDualCheck(). |