6 #ifndef ClpPlusMinusOneMatrix_H
7 #define ClpPlusMinusOneMatrix_H
64 virtual void deleteCols(
const int numDel,
const int *indDel);
66 virtual void deleteRows(
const int numDel,
const int *indDel);
78 const double *element,
int numberOther = -1);
84 const int *whichColumn,
85 int &numberColumnBasic);
88 const int *whichColumn,
89 int &numberColumnBasic,
91 int *rowCount,
int *columnCount,
101 virtual void rangeOfElements(
double &smallestNegative,
double &largestNegative,
102 double &smallestPositive,
double &largestPositive);
117 int column,
double multiplier)
const;
120 int column,
double multiplier)
const;
138 virtual void times(
double scalar,
139 const double *x,
double *y)
const;
141 virtual void times(
double scalar,
142 const double *x,
double *y,
143 const double *rowScale,
144 const double *columnScale)
const;
149 const double *x,
double *y)
const;
152 const double *x,
double *y,
153 const double *rowScale,
154 const double *columnScale,
double *spare = NULL)
const;
191 double referenceIn,
double devex,
193 unsigned int *reference,
194 double *weights,
double scaleFactor);
199 double referenceIn,
double devex,
201 unsigned int *reference,
202 double *weights,
double scaleFactor);
240 bool columnOrdered,
const int *indices,
245 int numberRows,
const int *whichRows,
246 int numberColumns,
const int *whichColumns);
254 int numberRows,
const int *whichRows,
255 int numberColumns,
const int *whichColumns)
const;
257 void passInCopy(
int numberRows,
int numberColumns,
258 bool columnOrdered,
int *indices,
264 int &bestSequence,
int &numberWanted);
284 #ifdef CLP_PLUS_ONE_MATRIX
288 mutable int otherFlags_;
299 #define CLP_POOL_SIZE 32 - CLP_POOL_MATRIX
300 #if CLP_POOL_MATRIX == 16
303 unsigned short pool_;
307 unsigned int row_ : CLP_POOL_MATRIX;
308 unsigned short pool_ : CLP_POOL_SIZE;
324 inline int getNumDifferentElements()
const
326 return numberDifferent_;
331 return numberColumns_;
351 int *getMutableIndices()
const;
359 virtual void deleteCols(
const int numDel,
const int *indDel);
361 virtual void deleteRows(
const int numDel,
const int *indDel);
366 const int *whichColumn,
367 int &numberColumnBasic);
370 const int *whichColumn,
371 int &numberColumnBasic,
372 int *row,
int *start,
373 int *rowCount,
int *columnCount,
378 virtual void rangeOfElements(
double &smallestNegative,
double &largestNegative,
379 double &smallestPositive,
double &largestPositive);
394 int column,
double multiplier)
const;
397 int column,
double multiplier)
const;
407 void checkValid(
bool detail)
const;
415 virtual void times(
double scalar,
416 const double *x,
double *y)
const;
418 virtual void times(
double scalar,
419 const double *x,
double *y,
420 const double *rowScale,
421 const double *columnScale)
const;
426 const double *x,
double *y)
const;
429 const double *x,
double *y,
430 const double *rowScale,
431 const double *columnScale,
double *spare = NULL)
const;
445 virtual void transposeTimesByRow(
const ClpSimplex *model,
double scalar,
470 double *infeas,
double *reducedCost,
471 double referenceIn,
double devex,
473 unsigned int *reference,
474 double *weights,
double scaleFactor);
479 double referenceIn,
double devex,
481 unsigned int *reference,
482 double *weights,
double scaleFactor);
499 virtual ~ClpPoolMatrix();
505 ClpPoolMatrix(
const ClpPoolMatrix &);
510 ClpPoolMatrix(
int numberRows,
int numberColumns,
511 const int *indices,
const double *elements,
514 ClpPoolMatrix(
int numberColumns,
CoinBigIndex *columnStart,
515 poolInfo *stuff,
double *elements);
518 ClpPoolMatrix(
const ClpPoolMatrix &wholeModel,
519 int numberRows,
const int *whichRows,
520 int numberColumns,
const int *whichColumns);
522 ClpPoolMatrix &
operator=(
const ClpPoolMatrix &);
528 int numberRows,
const int *whichRows,
529 int numberColumns,
const int *whichColumns)
const;
534 int &bestSequence,
int &numberWanted);
545 mutable int *lengths_;
557 int numberDifferent_;
int numberColumns_
Number of columns.
virtual void unpackPacked(ClpSimplex *model, CoinIndexedVector *rowArray, int column) const =0
Unpacks a column into an CoinIndexedvector in packed format Note that model is NOT const...
virtual ClpMatrixBase * reverseOrderedCopy() const
Returns a new matrix in reverse order without gaps Is allowed to return NULL if doesn't want to have ...
virtual int transposeTimes2(const ClpSimplex *model, const CoinIndexedVector *pi1, CoinIndexedVector *dj1, const CoinIndexedVector *pi2, CoinIndexedVector *spare, double *infeas, double *reducedCost, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor)
Updates two arrays for steepest and does devex weights (need not be coded) Returns nonzero if updates...
virtual ClpMatrixBase * subsetClone(int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const
Subset clone (without gaps).
virtual const int * getIndices() const
A vector containing the minor indices of the elements in the packed matrix.
CoinPackedMatrix * matrix_
For fake CoinPackedMatrix.
virtual ClpMatrixBase * clone() const =0
Subset clone (without gaps).
virtual int getNumCols() const
Number of columns.
virtual void releasePackedMatrix() const
Allow any parts of a created CoinMatrix to be deleted.
int *COIN_RESTRICT indices_
Data -1, then +1 rows in pairs (row==-1 if one entry)
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 const CoinBigIndex * getVectorStarts() const
Return a complete CoinPackedMatrix.
virtual void transposeTimes(double scalar, const double *x, double *y) const
Return y + x * scalar * A in y.
virtual const double * getElements() const =0
A vector containing the elements in the packed matrix.
virtual bool canCombine(const ClpSimplex *, const CoinIndexedVector *) const
Returns true if can combine transposeTimes and subsetTransposeTimes and if it would be faster...
virtual void fillBasis(ClpSimplex *model, const int *whichColumn, int &numberColumnBasic, int *row, int *start, int *rowCount, int *columnCount, CoinFactorizationDouble *element)
Fills in column part of basis.
int * lengths_
For fake CoinPackedMatrix.
virtual void deleteCols(const int numDel, const int *indDel)=0
Delete the columns whose indices are listed in indDel.
virtual int getNumCols() const =0
Number of columns.
virtual void unpackPacked(ClpSimplex *model, CoinIndexedVector *rowArray, int column) const
Unpacks a column into an CoinIndexedvector in packed foramt Note that model is NOT const...
virtual void times(double scalar, const double *COIN_RESTRICT x, double *COIN_RESTRICT y) const =0
Return y + A * x * scalar in y.
Sparse Matrix Base Class.
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.
bool columnOrdered_
True if column ordered.
virtual void unpack(const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const
Unpacks a column into an CoinIndexedvector.
virtual const int * getVectorLengths() const =0
The lengths of the major-dimension vectors.
virtual bool canDoPartialPricing() const
Says whether it can do partial pricing.
ClpPlusMinusOneMatrix & operator=(const ClpPlusMinusOneMatrix &)
The copy constructor.
virtual const int * getVectorLengths() const
The lengths of the major-dimension vectors.
virtual void unpack(const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const =0
Unpacks a column into an CoinIndexedvector.
virtual const double * getElements() const
A vector containing the elements in the packed matrix.
virtual void transposeTimes(double scalar, const double *COIN_RESTRICT x, double *COIN_RESTRICT y) const =0
Return y + x * scalar * A in y.
Abstract base class for various sparse vectors.
int type() const
Returns type.
int * getMutableIndices() const
Return a complete CoinPackedMatrix.
virtual bool isColOrdered() const =0
Whether the packed matrix is column major ordered or not.
double CoinFactorizationDouble
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
virtual void deleteRows(const int numDel, const int *indDel)=0
Delete the rows whose indices are listed in indDel.
virtual bool canCombine(const ClpSimplex *model, const CoinIndexedVector *pi) const
Returns true if can combine transposeTimes and subsetTransposeTimes and if it would be faster...
virtual const int * getIndices() const =0
A vector containing the minor indices of the elements in the packed matrix.
virtual CoinBigIndex getNumElements() const =0
Number of entries in the packed matrix.
void checkValid(bool detail) const
Just checks matrix valid - will say if dimensions not quite right if detail.
ClpPlusMinusOneMatrix()
Default constructor.
virtual void rangeOfElements(double &smallestNegative, double &largestNegative, double &smallestPositive, double &largestPositive)
Returns largest and smallest elements of both signs.
virtual void appendRows(int number, const CoinPackedVectorBase *const *rows)
Append Rows.
virtual ~ClpPlusMinusOneMatrix()
Destructor.
virtual int getNumRows() const
Number of rows.
virtual void transposeTimesByRow(const ClpSimplex *model, double scalar, const CoinIndexedVector *x, CoinIndexedVector *y, CoinIndexedVector *z) const
Return x * scalar * A + y in z.
This solves LPs using the simplex method.
virtual int transposeTimes2(const ClpSimplex *model, const CoinIndexedVector *pi1, CoinIndexedVector *dj1, const CoinIndexedVector *pi2, CoinIndexedVector *spare, double *infeas, double *reducedCost, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor)
Updates two arrays for steepest and does devex weights Returns nonzero if updates reduced cost and in...
CoinBigIndex * startPositive() const
Return starts of +1s.
Abstract base class for Clp Matrices.
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
CoinBigIndex *COIN_RESTRICT startNegative_
Start of -1's for each.
int numberRows_
Number of rows.
virtual int getNumRows() const =0
Number of rows.
ClpMatrixBase & operator=(const ClpMatrixBase &)
Destructor (has to be public)
virtual void deleteRows(const int numDel, const int *indDel)
Delete the rows whose indices are listed in indDel.
virtual CoinPackedMatrix * getPackedMatrix() const =0
Return a complete CoinPackedMatrix.
virtual void subsetTimes2(const ClpSimplex *model, CoinIndexedVector *dj1, const CoinIndexedVector *pi2, CoinIndexedVector *dj2, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor)
Updates second array for steepest and does devex weights (need not be coded)
double reducedCost(ClpSimplex *model, int sequence) const
Returns reduced cost of a variable.
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 setDimensions(int numrows, int numcols)
Set the dimensions of the matrix.
virtual void setDimensions(int numrows, int numcols)
Set the dimensions of the matrix.
virtual void rangeOfElements(double &smallestNegative, double &largestNegative, double &smallestPositive, double &largestPositive)
Returns largest and smallest elements of both signs.
virtual void appendCols(int number, const CoinPackedVectorBase *const *columns)
Append Columns.
virtual const CoinBigIndex * getVectorStarts() const =0
Return a complete CoinPackedMatrix.
virtual void subsetTransposeTimes(const ClpSimplex *model, const CoinIndexedVector *x, const CoinIndexedVector *y, CoinIndexedVector *z) const
Return x *A in z but just for indices in y.
virtual CoinPackedMatrix * getPackedMatrix() const
Return a complete CoinPackedMatrix.
virtual void add(const ClpSimplex *model, CoinIndexedVector *rowArray, int column, double multiplier) const
Adds multiple of a column into an CoinIndexedvector You can use quickAdd to add to vector...
CoinBigIndex * startNegative() const
Return starts of -1s.
virtual ClpMatrixBase * reverseOrderedCopy() const
Returns a new matrix in reverse order without gaps.
virtual int countBasis(const int *whichColumn, int &numberColumnBasic)
Returns number of elements in column part of basis.
virtual void fillBasis(ClpSimplex *model, const int *whichColumn, int &numberColumnBasic, int *row, int *start, int *rowCount, int *columnCount, CoinFactorizationDouble *element)=0
Fills in column part of basis.
virtual int getVectorLength(int index) const
The length of a single major-dimension vector.
void passInCopy(int numberRows, int numberColumns, bool columnOrdered, int *indices, CoinBigIndex *startPositive, CoinBigIndex *startNegative)
pass in copy (object takes ownership)
virtual void deleteCols(const int numDel, const int *indDel)
Delete the columns whose indices are listed in indDel.
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
virtual int appendMatrix(int number, int type, const CoinBigIndex *starts, const int *index, const double *element, int numberOther=-1)
Append a set of rows/columns to the end of the matrix.
CoinBigIndex *COIN_RESTRICT startPositive_
Start of +1's for each.
virtual void releasePackedMatrix() const =0
Allow any parts of a created CoinPackedMatrix to be deleted.
virtual void subsetTimes2(const ClpSimplex *model, CoinIndexedVector *dj1, const CoinIndexedVector *pi2, CoinIndexedVector *dj2, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor)
Updates second array for steepest and does devex weights.
virtual ClpMatrixBase * subsetClone(int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const
Subset clone (without gaps).
virtual ClpMatrixBase * clone() const
Clone.
virtual bool canDoPartialPricing() const
Says whether it can do partial pricing.
This implements a simple +- one matrix as derived from ClpMatrixBase.
virtual bool isColOrdered() const
Whether the packed matrix is column major ordered or not.
virtual CoinBigIndex getNumElements() const
Number of entries in the packed matrix.
virtual int countBasis(const int *whichColumn, int &numberColumnBasic)=0
Returns number of elements in column part of basis.