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();
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;
178 CoinPartitionedVector & tableauRow,
179 CoinPartitionedVector & candidateList)
const;
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;
218 CoinPartitionedVector & tableauRow)
const;
221 const CoinIndexedVector & updateDjs,
222 CoinPartitionedVector & tableauRow)
const;
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;
289 inline CoinPackedMatrix *
matrix()
const {
386 int numberRows,
const int * whichRows,
387 int numberColumns,
const int * whichColumns);
389 int numberRows,
const int * whichRows,
390 int numberColumns,
const int * whichColumns);
407#define NUMBER_ROW_BLOCKS 1
408#define NUMBER_COLUMN_BLOCKS 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
436 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);
#define NUMBER_COLUMN_BLOCKS
#define NUMBER_ROW_BLOCKS
double * work_
work arrays
int numberRows_
Number of rows.
int * offset_
Column offset for each block (plus one at end)
unsigned short * column_
columns within block
void transposeTimes(const AbcSimplex *model, const CoinPackedMatrix *rowCopy, const CoinIndexedVector &x, CoinIndexedVector &spareArray, CoinIndexedVector &z) const
Return x * -1 * A in z.
AbcMatrix2 & operator=(const AbcMatrix2 &)
AbcMatrix2()
Default constructor.
AbcMatrix2(AbcSimplex *model, const CoinPackedMatrix *rowCopy)
Constructor from copy.
unsigned short * count_
Counts of elements in each part of row.
int numberBlocks_
Number of blocks.
bool usefulInfo() const
Returns true if copy has useful information.
AbcMatrix2(const AbcMatrix2 &)
The copy constructor.
CoinBigIndex * rowStart_
Row starts.
int numberColumns_
Number of columns.
int numberBlocks_
Number of blocks.
void swapOne(const AbcSimplex *model, const AbcMatrix *matrix, int iColumn)
Swap one variable.
AbcMatrix3 & operator=(const AbcMatrix3 &)
blockStruct * block_
Blocks (ordinary start at 0 and go to first block)
int * column_
Column indices and reverse lookup (within block)
AbcMatrix3(const AbcMatrix3 &)
The copy constructor.
CoinBigIndex * start_
Starts for odd/long vectors.
void sortBlocks(const AbcSimplex *model)
Sort blocks.
AbcMatrix3()
Default constructor.
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.
double * element_
Elements.
void transposeTimes(const AbcSimplex *model, const double *pi, CoinIndexedVector &output) const
Return x * -1 * A in z.
AbcMatrix3(AbcSimplex *model, const CoinPackedMatrix *columnCopy)
Constructor from copy.
double * getMutableElements() const
Mutable elements.
int getNumRows() const
Number of rows.
CoinBigIndex * rowStart_
Start of each row (per block) - last lot are useless first all row starts for block 0,...
AbcMatrix(const CoinPackedMatrix &)
The copy constructor from an CoinPackedMatrix.
int savedBestSequence() const
Current best sequence.
double savedBestDj_
Best reduced cost so far.
AbcMatrix(const AbcMatrix &)
The copy constructor.
void timesModifyExcludingSlacks(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
int * startColumnBlock() const
Start of each column block.
AbcSimplex * model_
Model.
void subsetTransposeTimes(const CoinIndexedVector &x, CoinIndexedVector &z) const
Return x *A in z but just for indices Already in z.
int primalColumnRow(int iBlock, bool doByRow, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow) const
gets tableau row - returns number of slacks in block
void rebalance() const
rebalance for parallel
void setSavedBestDj(double value)
int savedBestSequence_
Saved best sequence in pricing.
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 numberRowBlocks() const
Number of actual row blocks.
void moveLargestToStart()
Move largest in column to beginning (not used as doesn't help factorization)
CoinBigIndex * rowEnd() const
Row ends.
int getNumCols() const
Number of columns.
int numberRowBlocks_
Number of actual row blocks.
void takeOutOfUseful(int sequence, CoinIndexedVector &spare)
Take out of useful.
void transposeTimesNonBasic(double scalar, const double *x, double *y) const
Return A * scalar(+-1) *x + y in y.
void createRowCopy()
Creates row copy.
double savedBestDj() const
Current best reduced cost.
AbcMatrix & operator=(const AbcMatrix &)
double startFraction_
Special row copy.
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.
CoinPackedMatrix * matrix() const
Returns CoinPackedMatrix (non const)
double startFraction() const
Current start of search space in matrix (as fraction)
int numberColumnBlocks() const
Number of actual column blocks.
void copy(const AbcMatrix *from)
Copy contents - resizing if necessary - otherwise re-use memory.
double dualColumn1(const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
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...
void setEndFraction(double value)
CoinPackedMatrix * getPackedMatrix() const
Return a complete CoinPackedMatrix.
void setStartFraction(double value)
CoinSimplexInt * rowColumns() const
Row columns.
double endFraction_
Current end of search space in matrix (as fraction)
void partialPricing(double startFraction, double endFraction, int &bestSequence, int &numberWanted)
Partial pricing.
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
CoinPackedMatrix * matrix_
Data.
CoinPackedMatrix * reverseOrderedCopy() const
Returns a new matrix in reverse order without gaps.
int minimumGoodReducedCosts_
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
int minimumObjectsScan() const
Partial pricing tuning parameter - minimum number of "objects" to scan.
int blockStart(int block) const
Start of each block (in stored)
void unpack(CoinIndexedVector &rowArray, int column) const
Unpacks a column into an CoinIndexedVector.
void setCurrentWanted(int value)
int chooseBestDj(int iBlock, const CoinIndexedVector &infeasibilities, const double *weights) const
Chooses best weighted dj.
AbcMatrix()
Default constructor.
const int * getIndices() const
A vector containing the minor indices of the elements in the packed matrix.
CoinBigIndex * rowStart() const
Row starts.
int minimumGoodReducedCosts() const
Partial pricing tuning parameter - minimum number of negative reduced costs to get.
CoinBigIndex getNumElements() const
Number of entries in the packed matrix.
CoinBigIndex countBasis(const int *whichColumn, int &numberColumnBasic)
Returns number of elements in column part of basis.
int primalColumnDouble(CoinPartitionedVector &updateForTableauRow, CoinPartitionedVector &updateForDjs, const CoinIndexedVector &updateForWeights, CoinPartitionedVector &spareColumn1, CoinIndexedVector &infeasible, 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 ...
void setMinimumGoodReducedCosts(int value)
double * element_
Values by row.
void setSavedBestSequence(int value)
void transposeTimes(const CoinIndexedVector &x, CoinIndexedVector &z) const
Return -x *A in z
void transposeTimesAll(const double *x, double *y) const
Return y - A * x in y.
void scale(int numberRowsAlreadyScaled)
Scales and creates row copy.
double endFraction() const
Current end of search space in matrix (as fraction)
void primalColumnSubset(int iBlock, const CoinIndexedVector &update, const CoinPartitionedVector &tableauRow, CoinPartitionedVector &weights) const
gets subset updates
int blockStart_[NUMBER_ROW_BLOCKS+1]
Start of each block (in stored)
int * getMutableVectorLengths() const
The lengths of the major-dimension vectors.
int startColumnBlock_[NUMBER_COLUMN_BLOCKS+1]
Start of each column block.
int pivotColumnDantzig(int iBlock, bool doByRow, const CoinIndexedVector &updates, CoinPartitionedVector &spare, double &bestValue) const
Get sequenceIn when Dantzig (One block)
int numberColumnBlocks_
Number of actual column blocks.
const int * getVectorLengths() const
The lengths of the major-dimension vectors.
bool isColOrdered() const
Whether the packed matrix is column major ordered or not.
double * rowElements() const
Row elements.
AbcMatrix(const CoinPackedMatrix &wholeModel, int numberRows, const int *whichRows, int numberColumns, const int *whichColumns)
int pivotColumnDantzig(const CoinIndexedVector &updates, CoinPartitionedVector &spare) const
Get sequenceIn when Dantzig.
void setOriginalWanted(int value)
void transposeTimesBasic(double scalar, const double *x, double *y) const
Return y + A * scalar(+-1) *x in y.
void sortUseful(CoinIndexedVector &spare)
Sort into useful.
void timesIncludingSlacks(double scalar, const double *x, double *y) const
Return A * scalar(+-1) *x in y.
void setMinimumObjectsScan(int value)
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 ...
void fillBasis(const int *whichColumn, int &numberColumnBasic, int *row, int *start, int *rowCount, int *columnCount, long double *element)
Fills in column part of basis.
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 primalColumnRowAndDjs(int iBlock, const CoinIndexedVector &updateTableau, const CoinIndexedVector &updateDjs, CoinPartitionedVector &tableauRow) const
gets tableau row and dj row - returns number of slacks in block
int minimumObjectsScan_
Partial pricing tuning parameter - minimum number of "objects" to scan.
void timesModifyIncludingSlacks(double scalar, const double *x, double *y) const
Return y + A * scalar(+-1) *x in y.
void setModel(AbcSimplex *model)
Sets model.
double dualColumn1Row1(double upperThetaSlack, int &freeSequence, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
double dualColumn1Row2(double upperThetaSlack, int &freeSequence, const CoinIndexedVector &update, CoinPartitionedVector &tableauRow, CoinPartitionedVector &candidateList) const
gets sorted tableau row and a possible value of theta
int * getMutableIndices() const
A vector containing the minor indices of the elements in the packed matrix.
void putIntofUseful(int sequence, CoinIndexedVector &spare)
Put into useful.
void inOutUseful(int sequenceIn, int sequenceOut)
Put in and out for useful.
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 ...
int transposeTimesNonBasic(double scalar, const CoinIndexedVector &x, CoinIndexedVector &z) const
Return x * scalar * A/code> in z.
const int * blockStart() const
Start of each block (in stored)
void fillBasis(const int *whichColumn, int &numberColumnBasic, int *row, int *start, int *rowCount, int *columnCount, CoinSimplexDouble *element)
Fills in column part of basis.
const CoinBigIndex * getVectorStarts() const
Starts.
int originalWanted() const
Initial number of negative reduced costs wanted.
int originalWanted_
Initial number of negative reduced costs wanted.
CoinBigIndex * getMutableVectorStarts() const
int currentWanted() const
Current number of negative reduced costs which we still need.
void makeAllUseful(CoinIndexedVector &spare)
Make all useful.
AbcMatrix(const AbcMatrix &wholeModel, int numberRows, const int *whichRows, int numberColumns, const int *whichColumns)
Subset constructor (without gaps).
int numberColumns() const
int numberRows() const
Number of rows.
CoinBigIndex startElements_