9 #include "CoinPragma.hpp" 37 return matrix_->getNumElements();
55 return matrix_->getMutableElements();
63 return matrix_->getMutableIndices();
67 return matrix_->getVectorStarts();
70 return matrix_->getMutableVectorStarts();
74 return matrix_->getVectorLengths();
78 return matrix_->getMutableVectorLengths();
83 CoinBigIndex *
rowEnd()
const;
91 CoinBigIndex
countBasis(
const int * whichColumn,
92 int & numberColumnBasic);
95 int & numberColumnBasic,
96 int * row,
int * start,
97 int * rowCount,
int * columnCount,
101 int & numberColumnBasic,
102 int * row,
int * start,
103 int * rowCount,
int * columnCount,
104 long double * element);
107 void scale(
int numberRowsAlreadyScaled);
125 void unpack(CoinIndexedVector & rowArray,
129 void add(CoinIndexedVector & rowArray,
int column,
double multiplier)
const ;
138 const double * x,
double * y)
const;
143 const double * x,
double * y)
const;
148 const double * x,
double * y)
const;
153 const double * x,
double * y)
const;
162 const double * x,
double * y)
const;
174 const CoinIndexedVector & x,
175 CoinIndexedVector & z)
const;
177 double dualColumn1(
const CoinIndexedVector & update,
178 CoinPartitionedVector & tableauRow,
179 CoinPartitionedVector & candidateList)
const;
181 double dualColumn1Row(
int iBlock,
double upperThetaSlack,
int & freeSequence,
182 const CoinIndexedVector & update,
183 CoinPartitionedVector & tableauRow,
184 CoinPartitionedVector & candidateList)
const;
187 const CoinIndexedVector & update,
188 CoinPartitionedVector & tableauRow,
189 CoinPartitionedVector & candidateList)
const;
192 const CoinIndexedVector & update,
193 CoinPartitionedVector & tableauRow,
194 CoinPartitionedVector & candidateList)
const;
197 const CoinIndexedVector & update,
198 CoinPartitionedVector & tableauRow,
199 CoinPartitionedVector & candidateList)
const;
204 const CoinIndexedVector & update,
205 CoinPartitionedVector & tableauRow,
206 CoinPartitionedVector & candidateList)
const;
211 CoinPartitionedVector & spare)
const;
214 CoinPartitionedVector & spare,
215 double & bestValue)
const;
217 int primalColumnRow(
int iBlock,
bool doByRow,
const CoinIndexedVector & update,
218 CoinPartitionedVector & tableauRow)
const;
221 const CoinIndexedVector & updateDjs,
222 CoinPartitionedVector & tableauRow)
const;
225 int chooseBestDj(
int iBlock,
const CoinIndexedVector & infeasibilities,
226 const double * weights)
const;
233 CoinPartitionedVector & updateForDjs,
234 const CoinIndexedVector & updateForWeights,
235 CoinPartitionedVector & spareColumn1,
236 double * infeasibilities,
237 double referenceIn,
double devex,
239 unsigned int * reference,
240 double * weights,
double scaleFactor)
const;
247 CoinPartitionedVector & updateForDjs,
248 const CoinIndexedVector & updateForWeights,
249 CoinPartitionedVector & spareColumn1,
250 double * infeasibilities,
251 double referenceIn,
double devex,
253 unsigned int * reference,
254 double * weights,
double scaleFactor)
const;
261 CoinPartitionedVector & updateForDjs,
262 const CoinIndexedVector & updateForWeights,
263 CoinPartitionedVector & spareColumn1,
264 CoinIndexedVector & infeasible,
265 double referenceIn,
double devex,
267 unsigned int * reference,
268 double * weights,
double scaleFactor)
const;
271 const CoinPartitionedVector & tableauRow,
272 CoinPartitionedVector & weights)
const;
275 int & bestSequence,
int & numberWanted);
280 CoinIndexedVector & z)
const;
283 CoinIndexedVector & z)
const;
288 inline CoinPackedMatrix *
matrix()
const {
386 int numberRows,
const int * whichRows,
387 int numberColumns,
const int * whichColumns);
388 AbcMatrix (
const CoinPackedMatrix & wholeModel,
389 int numberRows,
const int * whichRows,
390 int numberColumns,
const int * whichColumns);
407 #define NUMBER_ROW_BLOCKS 1 408 #define NUMBER_COLUMN_BLOCKS 1 409 #elif ABC_PARALLEL==1 410 #define NUMBER_ROW_BLOCKS 4 411 #define NUMBER_COLUMN_BLOCKS 4 413 #define NUMBER_ROW_BLOCKS 8 414 #define NUMBER_COLUMN_BLOCKS 8 435 CoinBigIndex countStart_[MAX_COUNT+1];
438 int countFirst_[MAX_COUNT+1];
440 int * countRealColumn_;
442 CoinBigIndex * countStartLarge_;
444 double * countElement_;
473 double acceptablePivot;
480 double * bestPossiblePtr;
481 double * upperThetaPtr;
483 double * freePivotPtr;
485 const unsigned short * count;
487 const CoinBigIndex * rowStart;
488 const double * element;
489 const unsigned short * column;
491 int numberInRowArray;
504 const CoinPackedMatrix * rowCopy,
505 const CoinIndexedVector & x,
506 CoinIndexedVector & spareArray,
507 CoinIndexedVector & z)
const;
552 pthread_t * threadId_;
553 dualColumn0Struct * info_;
574 CoinIndexedVector & output)
const;
577 const double * pi, CoinIndexedVector & dj1,
578 const double * piWeight,
579 double referenceIn,
double devex,
581 unsigned int * reference,
582 double * weights,
double scaleFactor);
const CoinBigIndex * getVectorStarts() const
Starts.
void rebalance() const
rebalance for parallel
int pivotColumnDantzig(const CoinIndexedVector &updates, CoinPartitionedVector &spare) const
Get sequenceIn when Dantzig.
bool isColOrdered() const
Whether the packed matrix is column major ordered or not.
void takeOutOfUseful(int sequence, CoinIndexedVector &spare)
Take out of useful.
int numberRowBlocks() const
Number of actual row blocks.
AbcMatrix()
Default constructor.
void sortUseful(CoinIndexedVector &spare)
Sort into useful.
double dualColumn1(const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
void setCurrentWanted(int value)
CoinBigIndex startElements_
CoinSimplexInt * rowColumns() const
Row columns.
const int * getIndices() const
A vector containing the minor indices of the elements in the packed matrix.
double dualColumn1RowFew(int iBlock, double upperThetaSlack, int &freeSequence, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
AbcMatrix2()
Default constructor.
int primalColumnRowAndDjs(int iBlock, const CoinIndexedVector &updateTableau, const CoinIndexedVector &updateDjs, CoinPartitionedVector &tableauRow) const
gets tableau row and dj row - returns number of slacks in block
void setMinimumGoodReducedCosts(int value)
int numberColumns() const
void setStartFraction(double value)
void transposeTimes(const AbcSimplex *model, const CoinPackedMatrix *rowCopy, const CoinIndexedVector &x, CoinIndexedVector &spareArray, CoinIndexedVector &z) const
Return x * -1 * A in z.
int numberColumnBlocks() const
Number of actual column blocks.
CoinPackedMatrix * getPackedMatrix() const
Return a complete CoinPackedMatrix.
int numberColumnBlocks_
Number of actual column blocks.
void inOutUseful(int sequenceIn, int sequenceOut)
Put in and out for useful.
int blockStart_[NUMBER_ROW_BLOCKS+1]
Start of each block (in stored)
void setSavedBestDj(double value)
double savedBestDj_
Best reduced cost so far.
int * offset_
Column offset for each block (plus one at end)
void unpack(CoinIndexedVector &rowArray, int column) const
Unpacks a column into an CoinIndexedVector.
double * element_
Elements.
void subsetTransposeTimes(const CoinIndexedVector &x, CoinIndexedVector &z) const
Return x *A in z but just for indices Already in z.
void setSavedBestSequence(int value)
AbcMatrix2 & operator=(const AbcMatrix2 &)
int * startColumnBlock() const
Start of each column block.
double dualColumn1Row1(double upperThetaSlack, int &freeSequence, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
CoinBigIndex getNumElements() const
Number of entries in the packed matrix.
int numberBlocks_
Number of blocks.
int * column_
Column indices and reverse lookup (within block)
double startFraction() const
Current start of search space in matrix (as fraction)
void setEndFraction(double value)
void setOriginalWanted(int value)
CoinBigIndex * start_
Starts for odd/long vectors.
int getNumCols() const
Number of columns.
CoinBigIndex * rowStart_
Row starts.
void transposeTimes2(const AbcSimplex *model, const double *pi, CoinIndexedVector &dj1, const double *piWeight, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor)
Updates two arrays for steepest.
void add(CoinIndexedVector &rowArray, int column, double multiplier) const
Adds multiple of a column (or slack) into an CoinIndexedvector You can use quickAdd to add to vector...
int savedBestSequence_
Saved best sequence in pricing.
int getNumRows() const
Number of rows.
void partialPricing(double startFraction, double endFraction, int &bestSequence, int &numberWanted)
Partial pricing.
double * rowElements() const
Row elements.
blockStruct * block_
Blocks (ordinary start at 0 and go to first block)
int numberRows_
Number of rows.
void timesModifyIncludingSlacks(double scalar, const double *x, double *y) const
Return y + A * scalar(+-1) *x in y.
void transposeTimesNonBasic(double scalar, const double *x, double *y) const
Return A * scalar(+-1) *x + y in y.
int minimumGoodReducedCosts_
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
void primalColumnSubset(int iBlock, const CoinIndexedVector &update, const CoinPartitionedVector &tableauRow, CoinPartitionedVector &weights) const
gets subset updates
int currentWanted_
Current number of negative reduced costs which we still need.
const double * getElements() const
A vector containing the elements in the packed matrix.
int primalColumnSparseDouble(int iBlock, CoinPartitionedVector &updateForTableauRow, CoinPartitionedVector &updateForDjs, const CoinIndexedVector &updateForWeights, CoinPartitionedVector &spareColumn1, double *infeasibilities, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor) const
does steepest edge double or triple update If scaleFactor!=0 then use with tableau row to update djs ...
CoinPackedMatrix * reverseOrderedCopy() const
Returns a new matrix in reverse order without gaps.
int * getMutableVectorLengths() const
The lengths of the major-dimension vectors.
#define NUMBER_COLUMN_BLOCKS
const int * getVectorLengths() const
The lengths of the major-dimension vectors.
void transposeTimes(const AbcSimplex *model, const double *pi, CoinIndexedVector &output) const
Return x * -1 * A in z.
AbcMatrix3 & operator=(const AbcMatrix3 &)
#define NUMBER_ROW_BLOCKS
void makeAllUseful(CoinIndexedVector &spare)
Make all useful.
int blockStart(int block) const
Start of each block (in stored)
double savedBestDj() const
Current best reduced cost.
void transposeTimes(const CoinIndexedVector &x, CoinIndexedVector &z) const
Return -x *A in z
AbcSimplex * model_
Model.
void setMinimumObjectsScan(int value)
const int * blockStart() const
Start of each block (in stored)
double * work_
work arrays
int chooseBestDj(int iBlock, const CoinIndexedVector &infeasibilities, const double *weights) const
Chooses best weighted dj.
int numberRowBlocks_
Number of actual row blocks.
CoinPackedMatrix * matrix() const
Returns CoinPackedMatrix (non const)
CoinBigIndex * rowStart() const
Row starts.
void createRowCopy()
Creates row copy.
int originalWanted() const
Initial number of negative reduced costs wanted.
double * getMutableElements() const
Mutable elements.
void timesModifyExcludingSlacks(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
void dualColumn1Part(int iBlock, int &sequenceIn, double &upperTheta, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta On input first,last give what to scan On output...
int minimumObjectsScan() const
Partial pricing tuning parameter - minimum number of "objects" to scan.
bool usefulInfo() const
Returns true if copy has useful information.
int currentWanted() const
Current number of negative reduced costs which we still need.
int primalColumnRow(int iBlock, bool doByRow, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow) const
gets tableau row - returns number of slacks in block
int minimumGoodReducedCosts() const
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
CoinBigIndex * rowEnd() const
Row ends.
void moveLargestToStart()
Move largest in column to beginning (not used as doesn't help factorization)
AbcMatrix & operator=(const AbcMatrix &)
void sortBlocks(const AbcSimplex *model)
Sort blocks.
int numberColumns_
Number of columns.
double dualColumn1Row(int iBlock, double upperThetaSlack, int &freeSequence, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
int numberRows() const
Number of rows.
int minimumObjectsScan_
Partial pricing tuning parameter - minimum number of "objects" to scan.
void scale(int numberRowsAlreadyScaled)
Scales and creates row copy.
int primalColumnDouble(int iBlock, CoinPartitionedVector &updateForTableauRow, CoinPartitionedVector &updateForDjs, const CoinIndexedVector &updateForWeights, CoinPartitionedVector &spareColumn1, double *infeasibilities, double referenceIn, double devex, unsigned int *reference, double *weights, double scaleFactor) const
does steepest edge double or triple update If scaleFactor!=0 then use with tableau row to update djs ...
double endFraction() const
Current end of search space in matrix (as fraction)
void setModel(AbcSimplex *model)
Sets model.
double startFraction_
Special row copy.
CoinBigIndex * getMutableVectorStarts() const
int numberBlocks_
Number of blocks.
CoinBigIndex * rowStart_
Start of each row (per block) - last lot are useless first all row starts for block 0...
double endFraction_
Current end of search space in matrix (as fraction)
void swapOne(const AbcSimplex *model, const AbcMatrix *matrix, int iColumn)
Swap one variable.
int savedBestSequence() const
Current best sequence.
unsigned short * column_
columns within block
void fillBasis(const int *whichColumn, int &numberColumnBasic, int *row, int *start, int *rowCount, int *columnCount, CoinSimplexDouble *element)
Fills in column part of basis.
void putIntofUseful(int sequence, CoinIndexedVector &spare)
Put into useful.
CoinBigIndex countBasis(const int *whichColumn, int &numberColumnBasic)
Returns number of elements in column part of basis.
void transposeTimesAll(const double *x, double *y) const
Return y - A * x in y.
double dualColumn1Row2(double upperThetaSlack, int &freeSequence, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
void timesIncludingSlacks(double scalar, const double *x, double *y) const
Return A * scalar(+-1) *x in y.
void copy(const AbcMatrix *from)
Copy contents - resizing if necessary - otherwise re-use memory.
double * element_
Values by row.
AbcMatrix3()
Default constructor.
int startColumnBlock_[NUMBER_COLUMN_BLOCKS+1]
Start of each column block.
unsigned short * count_
Counts of elements in each part of row.
int originalWanted_
Initial number of negative reduced costs wanted.
CoinPackedMatrix * matrix_
Data.
void transposeTimesBasic(double scalar, const double *x, double *y) const
Return y + A * scalar(+-1) *x in y.
int * getMutableIndices() const
A vector containing the minor indices of the elements in the packed matrix.