4 #ifndef ClpMatrixBase_H
5 #define ClpMatrixBase_H
7 #include "CoinPragma.hpp"
8 #include "CoinFinite.hpp"
10 #include "CoinPackedMatrix.hpp"
11 class CoinIndexedVector;
62 virtual void deleteCols(
const int numDel,
const int * indDel) = 0;
64 virtual void deleteRows(
const int numDel,
const int * indDel) = 0;
66 virtual void appendCols(
int number,
const CoinPackedVectorBase *
const * columns);
69 virtual void appendRows(
int number,
const CoinPackedVectorBase *
const * rows);
75 bool keepZero =
false);
81 const CoinBigIndex * starts,
const int * index,
82 const double * element,
int numberOther = -1);
91 virtual CoinBigIndex
countBasis(
const int * whichColumn,
92 int & numberColumnBasic) = 0;
95 const int * whichColumn,
96 int & numberColumnBasic,
97 int * row,
int * start,
98 int * rowCount,
int * columnCount,
99 CoinFactorizationDouble * element) = 0;
117 return this->
clone();
144 virtual void rangeOfElements(
double & smallestNegative,
double & largestNegative,
145 double & smallestPositive,
double & largestPositive);
150 int column)
const = 0;
156 CoinIndexedVector * rowArray,
157 int column)
const = 0;
167 virtual void reallyScale(
const double * rowScale,
const double * columnScale);
176 virtual void add(
const ClpSimplex * model, CoinIndexedVector * rowArray,
177 int column,
double multiplier)
const = 0;
180 int column,
double multiplier)
const = 0;
189 int & bestSequence,
int & numberWanted);
217 double * other,
int mode);
263 virtual void times(
double scalar,
264 const double * x,
double * y)
const = 0;
268 virtual void times(
double scalar,
269 const double * x,
double * y,
270 const double * rowScale,
271 const double * columnScale)
const;
276 const double * x,
double * y)
const = 0;
281 const double * x,
double * y,
282 const double * rowScale,
283 const double * columnScale,
284 double * spare = NULL)
const;
287 virtual void times(CoinWorkDouble scalar,
288 const CoinWorkDouble * x, CoinWorkDouble * y)
const ;
290 const CoinWorkDouble * x, CoinWorkDouble * y)
const ;
297 const CoinIndexedVector * x,
298 CoinIndexedVector * y,
299 CoinIndexedVector * z)
const = 0;
305 const CoinIndexedVector * x,
306 const CoinIndexedVector * y,
307 CoinIndexedVector * z)
const = 0;
311 const CoinIndexedVector * )
const {
316 const CoinIndexedVector * pi1, CoinIndexedVector * dj1,
317 const CoinIndexedVector * pi2,
318 CoinIndexedVector * spare,
319 double referenceIn,
double devex,
321 unsigned int * reference,
322 double * weights,
double scaleFactor);
325 CoinIndexedVector * dj1,
326 const CoinIndexedVector * pi2, CoinIndexedVector * dj2,
327 double referenceIn,
double devex,
329 unsigned int * reference,
330 double * weights,
double scaleFactor);
350 int numberRows,
const int * whichRows,
351 int numberColumns,
const int * whichColumns)
const;
510 #define FREE_BIAS 1.0e1
512 #define FREE_ACCEPT 1.0e2
virtual int refresh(ClpSimplex *)
Purely for column generation and similar ideas.
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...
void setStartFraction(double value)
Subset clone (without gaps).
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 double * rhsOffset(ClpSimplex *model, bool forceRefresh=false, bool check=false)
Returns effective RHS offset if it is being used.
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.
int originalWanted() const
Initial number of negative reduced costs wanted.
int trueSequenceIn_
True sequence in (i.e. from larger problem)
double endFraction_
Current end of search space in matrix (as fraction)
virtual ClpMatrixBase * clone() const =0
Subset clone (without gaps).
int trueSequenceOut_
True sequence out (i.e. from larger problem)
virtual void scaleRowCopy(ClpModel *) const
Scales rowCopy if column copy scaled Only called if scales already exist.
int minimumObjectsScan() const
Partial pricing tuning parameter - minimum number of "objects" to scan.
virtual void primalExpanded(ClpSimplex *model, int mode)
utility primal function for dealing with dynamic constraints mode=0 - Set up before "update" and "tim...
void setSkipDualCheck(bool yes)
Subset clone (without gaps).
virtual void correctSequence(const ClpSimplex *model, int &sequenceIn, int &sequenceOut)
Correct sequence in and out to give true value (if both -1 maybe do whole matrix) ...
double savedBestDj_
Best reduced cost so far.
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 ...
double startFraction_
Current start of search space in matrix (as fraction)
void setMinimumObjectsScan(int value)
Subset clone (without gaps).
int savedBestSequence_
Saved best sequence in pricing.
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...
double endFraction() const
Current end of search space in matrix (as fraction)
virtual int updatePivot(ClpSimplex *model, double oldInValue, double oldOutValue)
update information for a pivot (and effective rhs)
virtual void deleteCols(const int numDel, const int *indDel)=0
Delete the columns whose indices are listed in indDel.
double startFraction() const
Current start of search space in matrix (as fraction)
virtual int getNumCols() const =0
Number of columns.
virtual int checkFeasible(ClpSimplex *model, double &sum) const
Just for debug if odd type matrix.
virtual int hiddenRows() const
Returns number of hidden rows e.g. gub.
virtual int scale(ClpModel *, const ClpSimplex *=NULL) const
Creates scales for column copy (rowCopy in model may be modified) default does not allow scaling retu...
virtual void modifyCoefficient(int row, int column, double newElement, bool keepZero=false)
Modify one element of packed matrix.
virtual void times(double scalar, const double *x, double *y) const =0
Return y + A * x * scalar in y.
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.
virtual void transposeTimes2(const ClpSimplex *model, const CoinIndexedVector *pi1, CoinIndexedVector *dj1, const CoinIndexedVector *pi2, CoinIndexedVector *spare, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor)
Updates two arrays for steepest and does devex weights (need not be coded)
virtual const int * getVectorLengths() const =0
The lengths of the major-dimension vectors.
int refreshFrequency_
If rhsOffset used this is refresh frequency (0==off)
void setRefreshFrequency(int value)
Subset clone (without gaps).
void setType(int newtype)
Sets type.
int minimumGoodReducedCosts() const
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
virtual void unpack(const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const =0
Unpacks a column into an CoinIndexedvector.
void setOriginalWanted(int value)
Subset clone (without gaps).
int type() const
Returns type.
int refreshFrequency() const
If rhsOffset used this is refresh frequency (0==off)
virtual bool isColOrdered() const =0
Whether the packed matrix is column major ordered or not.
int lastRefresh() const
If rhsOffset used this is iteration last refreshed.
virtual void reallyScale(const double *rowScale, const double *columnScale)
Return a complete CoinPackedMatrix.
virtual void listTransposeTimes(const ClpSimplex *model, double *x, int *y, int number, double *z) const
Return x *A in z but just for number indices in y.
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" a...
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.
double savedBestDj() const
Current best reduced cost.
int minimumObjectsScan_
Partial pricing tuning parameter - minimum number of "objects" to scan.
double * rhsOffset_
Effective RHS offset if it is being used.
virtual const int * getIndices() const =0
A vector containing the minor indices of the elements in the packed matrix.
virtual ClpMatrixBase * scaledColumnCopy(ClpModel *) const
Realy really scales column copy Only called if scales already exist.
virtual CoinBigIndex getNumElements() const =0
Number of entries in the packed matrix.
virtual ~ClpMatrixBase()
Destructor (has to be public)
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 retur...
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)...
void setMinimumGoodReducedCosts(int value)
Subset clone (without gaps).
virtual bool canGetRowCopy() const
Returns true if can create row copy.
This solves LPs using the simplex method.
void setEndFraction(double value)
Subset clone (without gaps).
void setCurrentWanted(int value)
Subset clone (without gaps).
int type_
type (may be useful)
Abstract base class for Clp Matrices.
virtual int getNumRows() const =0
Number of rows.
bool skipDualCheck_
whether to skip dual checks most of time
void setSavedBestDj(double value)
Subset clone (without gaps).
ClpMatrixBase & operator=(const ClpMatrixBase &)
Destructor (has to be public)
ClpMatrixBase()
Default constructor.
virtual CoinBigIndex countBasis(const int *whichColumn, int &numberColumnBasic)=0
Returns number of elements in column part of basis.
virtual CoinPackedMatrix * getPackedMatrix() const =0
Return a complete CoinPackedMatrix.
int currentWanted() const
Current number of negative reduced costs which we still need.
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 rangeOfElements(double &smallestNegative, double &largestNegative, double &smallestPositive, double &largestPositive)
Returns largest and smallest elements of both signs.
virtual const CoinBigIndex * getVectorStarts() const =0
Return a complete CoinPackedMatrix.
virtual void appendCols(int number, const CoinPackedVectorBase *const *columns)
Append Columns.
int originalWanted_
Initial number of negative reduced costs wanted.
virtual void createVariable(ClpSimplex *model, int &bestSequence)
Creates a variable.
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.
int minimumGoodReducedCosts_
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
virtual int getVectorLength(int index) const
The length of a single major-dimension vector.
bool skipDualCheck() const
whether to skip dual checks most of time
virtual void backToBasics()
Gets rid of any mutable by products.
virtual void releasePackedMatrix() const =0
Allow any parts of a created CoinPackedMatrix to be deleted.
int currentWanted_
Current number of negative reduced costs which we still need.
virtual ClpMatrixBase * subsetClone(int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const
Subset clone (without gaps).
int savedBestSequence() const
Current best sequence.
virtual bool canDoPartialPricing() const
Says whether it can do partial pricing.
void useEffectiveRhs(ClpSimplex *model)
Sets up an effective RHS.
virtual void appendRows(int number, const CoinPackedVectorBase *const *rows)
Append Rows.
void setSavedBestSequence(int value)
Subset clone (without gaps).
virtual bool allElementsInRange(ClpModel *, double, double, int=15)
Checks if all elements are in valid range.
virtual void transposeTimes(double scalar, const double *x, double *y) const =0
Return y + x * scalar * A in y.
int lastRefresh_
If rhsOffset used this is iteration last refreshed.