9#include "CoinPragma.hpp"
10#include "CoinTypes.hpp"
12#include "CoinPackedMatrix.hpp"
13class CoinIndexedVector;
18#ifdef COIN_USE_RESTRICT
19#define COIN_RESTRICT __restrict
72 virtual void deleteCols(
const int numDel,
const int *indDel) = 0;
74 virtual void deleteRows(
const int numDel,
const int *indDel) = 0;
77 virtual void appendCols(
int number,
const CoinPackedVectorBase *
const *columns);
79 virtual void appendRows(
int number,
const CoinPackedVectorBase *
const *rows);
85 bool keepZero =
false);
91 const CoinBigIndex *starts,
const int *index,
92 const double *element,
int numberOther = -1);
103 int &numberColumnBasic)
107 const int *whichColumn,
108 int &numberColumnBasic,
109 int *row,
int *start,
110 int *rowCount,
int *columnCount,
111 CoinFactorizationDouble *element)
133 return this->
clone();
162 double &smallestPositive,
double &largestPositive);
167 int column)
const = 0;
173 CoinIndexedVector *rowArray,
174 int column)
const = 0;
185 virtual void reallyScale(
const double *rowScale,
const double *columnScale);
195 int column,
double multiplier)
const = 0;
198 int column,
double multiplier)
const = 0;
207 int &bestSequence,
int &numberWanted);
235 double *other,
int mode);
305 virtual void times(CoinWorkDouble scalar,
315 const CoinIndexedVector *x,
316 CoinIndexedVector *y,
317 CoinIndexedVector *z)
const = 0;
323 const CoinIndexedVector *x,
324 const CoinIndexedVector *y,
325 CoinIndexedVector *z)
const = 0;
329 const CoinIndexedVector *)
const
338 const CoinIndexedVector *pi1, CoinIndexedVector *dj1,
339 const CoinIndexedVector *pi2,
340 CoinIndexedVector *spare,
342 double referenceIn,
double devex,
344 unsigned int *reference,
345 double *weights,
double scaleFactor);
348 CoinIndexedVector *dj1,
349 const CoinIndexedVector *pi2, CoinIndexedVector *dj2,
350 double referenceIn,
double devex,
352 unsigned int *reference,
353 double *weights,
double scaleFactor);
373 int numberRows,
const int *whichRows,
374 int numberColumns,
const int *whichColumns)
const;
554#define FREE_BIAS 1.0e1
556#define FREE_ACCEPT 1.0e2
Abstract base class for Clp Matrices.
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 bool isColOrdered() const =0
Whether the packed matrix is column major ordered or not.
virtual void transposeTimes(double scalar, const double *COIN_RESTRICT x, double *COIN_RESTRICT y, const double *COIN_RESTRICT rowScale, const double *COIN_RESTRICT columnScale, double *COIN_RESTRICT spare=NULL) const
And for scaling - default aborts for when scaling not supported (unless pointers NULL when as normal)
virtual const int * getIndices() const =0
A vector containing the minor indices of the elements in the packed matrix.
int lastRefresh() const
If rhsOffset used this is iteration last refreshed.
virtual void setDimensions(int numrows, int numcols)
Set the dimensions of the matrix.
virtual void releasePackedMatrix() const =0
Allow any parts of a created CoinPackedMatrix to be deleted.
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 int * getVectorLengths() const =0
The lengths of the major-dimension vectors.
int trueSequenceIn_
True sequence in (i.e. from larger problem)
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 checkFeasible(ClpSimplex *model, double &sum) const
Just for debug if odd type matrix.
double savedBestDj_
Best reduced cost so far.
virtual double * rhsOffset(ClpSimplex *model, bool forceRefresh=false, bool check=false)
Returns effective RHS offset if it is being used.
void setEndFraction(double value)
int minimumGoodReducedCosts_
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
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.
void setMinimumGoodReducedCosts(int value)
virtual void appendCols(int number, const CoinPackedVectorBase *const *columns)
Append Columns.
int savedBestSequence_
Saved best sequence in pricing.
virtual ClpMatrixBase * subsetClone(int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const
Subset clone (without gaps).
virtual ClpMatrixBase * scaledColumnCopy(ClpModel *) const
Realy really scales column copy Only called if scales already exist.
virtual void backToBasics()
Gets rid of any mutable by products.
double startFraction() const
Current start of search space in matrix (as fraction)
virtual void add(const ClpSimplex *model, double *array, int column, double multiplier) const =0
Adds multiple of a column into an array.
void setSavedBestSequence(int value)
virtual void primalExpanded(ClpSimplex *model, int mode)
utility primal function for dealing with dynamic constraints mode=0 - Set up before "update" and "tim...
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 ...
void setOriginalWanted(int value)
virtual int getNumCols() const =0
Number of columns.
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)
int savedBestSequence() const
Current best sequence.
virtual void times(double scalar, const double *COIN_RESTRICT x, double *COIN_RESTRICT y, const double *COIN_RESTRICT rowScale, const double *COIN_RESTRICT columnScale) const
And for scaling - default aborts for when scaling not supported (unless pointers NULL when as normal)
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 unpack(const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const =0
Unpacks a column into an CoinIndexedvector.
void setSavedBestDj(double value)
virtual bool allElementsInRange(ClpModel *, double, double, int=15)
Checks if all elements are in valid range.
int currentWanted_
Current number of negative reduced costs which we still need.
bool skipDualCheck_
whether to skip dual checks most of time
void setCurrentWanted(int value)
virtual int updatePivot(ClpSimplex *model, double oldInValue, double oldOutValue)
update information for a pivot (and effective rhs)
virtual int getNumRows() const =0
Number of rows.
double reducedCost(ClpSimplex *model, int sequence) const
Returns reduced cost of a variable.
ClpMatrixBase()
Default constructor.
int minimumObjectsScan_
Partial pricing tuning parameter - minimum number of "objects" to scan.
void setType(int newtype)
Sets type.
virtual CoinPackedMatrix * getPackedMatrix() const =0
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 transposeTimes(double scalar, const double *COIN_RESTRICT x, double *COIN_RESTRICT y) const =0
Return y + x * scalar * A in y.
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)
int type() const
Returns type.
virtual const CoinBigIndex * getVectorStarts() const =0
int minimumGoodReducedCosts() const
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
virtual bool canDoPartialPricing() const
Says whether it can do partial pricing.
virtual int countBasis(const int *whichColumn, int &numberColumnBasic)=0
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.
int type_
type (may be useful)
int lastRefresh_
If rhsOffset used this is iteration last refreshed.
int refreshFrequency() const
If rhsOffset used this is refresh frequency (0==off)
virtual void modifyCoefficient(int row, int column, double newElement, bool keepZero=false)
Modify one element of packed matrix.
void setMinimumObjectsScan(int value)
virtual void appendRows(int number, const CoinPackedVectorBase *const *rows)
Append Rows.
void useEffectiveRhs(ClpSimplex *model)
Sets up an effective RHS.
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...
double endFraction() const
Current end of search space in matrix (as fraction)
int originalWanted() const
Initial number of negative reduced costs wanted.
virtual void reallyScale(const double *rowScale, const double *columnScale)
virtual void createVariable(ClpSimplex *model, int &bestSequence)
Creates a variable.
virtual int scale(ClpModel *, ClpSimplex *=NULL) const
Creates scales for column copy (rowCopy in model may be modified) default does not allow scaling retu...
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 const double * getElements() const =0
A vector containing the elements in the packed matrix.
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 rangeOfElements(double &smallestNegative, double &largestNegative, double &smallestPositive, double &largestPositive)
Returns largest and smallest elements of both signs.
void setRefreshFrequency(int value)
virtual int refresh(ClpSimplex *)
Purely for column generation and similar ideas.
int minimumObjectsScan() const
Partial pricing tuning parameter - minimum number of "objects" to scan.
bool skipDualCheck() const
whether to skip dual checks most of time
int refreshFrequency_
If rhsOffset used this is refresh frequency (0==off)
double startFraction_
Current start of search space in matrix (as fraction)
virtual void scaleRowCopy(ClpModel *) const
Scales rowCopy if column copy scaled Only called if scales already exist.
virtual void deleteRows(const int numDel, const int *indDel)=0
Delete the rows whose indices are listed in indDel.
ClpMatrixBase(const ClpMatrixBase &)
void setStartFraction(double value)
double savedBestDj() const
Current best reduced cost.
virtual void times(double scalar, const double *COIN_RESTRICT x, double *COIN_RESTRICT y) const =0
Return y + A * x * scalar in y.
int trueSequenceOut_
True sequence out (i.e. from larger problem)
virtual bool canCombine(const ClpSimplex *, const CoinIndexedVector *) const
Returns true if can combine transposeTimes and subsetTransposeTimes and if it would be faster.
ClpMatrixBase & operator=(const ClpMatrixBase &)
virtual ClpMatrixBase * clone() const =0
double * rhsOffset_
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.
virtual ~ClpMatrixBase()
Destructor (has to be public)
virtual CoinBigIndex getNumElements() const =0
Number of entries in the packed matrix.
double endFraction_
Current end of search space in matrix (as fraction)
virtual int getVectorLength(int index) const
The length of a single major-dimension vector.
virtual bool canGetRowCopy() const
Returns true if can create row copy.
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
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.
int currentWanted() const
Current number of negative reduced costs which we still need.
void setSkipDualCheck(bool yes)
virtual int hiddenRows() const
Returns number of hidden rows e.g. gub.
int originalWanted_
Initial number of negative reduced costs wanted.
virtual void deleteCols(const int numDel, const int *indDel)=0
Delete the columns whose indices are listed in indDel.
This solves LPs using the simplex method.