31 int & numberColumnBasic);
34 const int * whichColumn,
35 int & numberColumnBasic,
36 int * row,
int *
start,
37 int * rowCount,
int * columnCount,
53 int column,
double multiplier)
const ;
56 int column,
double multiplier)
const;
59 int & bestSequence,
int & numberWanted);
114 double * other,
int mode);
180 int numberRows,
const int * whichRows,
181 int numberColumns,
const int * whichColumns);
183 int numberRows,
const int * whichRows,
184 int numberColumns,
const int * whichColumns);
192 const int * start,
const int * end,
194 const unsigned char * status = NULL);
202 int numberRows,
const int * whichRows,
203 int numberColumns,
const int * whichColumns)
const ;
214 unsigned char & st_byte =
status_[sequence];
215 st_byte =
static_cast<unsigned char>(st_byte & ~7);
216 st_byte =
static_cast<unsigned char>(st_byte | status);
220 status_[sequence] =
static_cast<unsigned char>(
status_[sequence] | 64);
223 status_[sequence] =
static_cast<unsigned char>(
status_[sequence] & ~64);
226 return ((
status_[sequence] & 64) != 0);
230 unsigned char iStat =
status_[sequence];
231 iStat =
static_cast<unsigned char>(iStat & ~24);
232 status_[sequence] =
static_cast<unsigned char>(iStat | 16);
236 unsigned char iStat =
status_[sequence];
237 iStat =
static_cast<unsigned char>(iStat & ~24);
238 status_[sequence] =
static_cast<unsigned char>(iStat | 8);
242 unsigned char iStat =
status_[sequence];
243 iStat =
static_cast<unsigned char>(iStat & ~24);
246 inline double weight(
int sequence)
const {
247 int iStat =
status_[sequence] & 31;
249 return static_cast<double> (iStat - 1);
256 inline int *
end()
const {
bool flagged(int sequence) const
Status.
virtual CoinBigIndex countBasis(const int *whichColumn, int &numberColumnBasic)
Returns number of elements in column part of basis.
double sumOfRelaxedPrimalInfeasibilities_
Sum of Primal infeasibilities using tolerance based on error in primals.
int numberDualInfeasibilities_
Number of dual infeasibilities.
int gubSlackIn_
Gub slack in (set number or -1)
ClpSimplex * model_
Pointer back to model.
void redoSet(ClpSimplex *model, int newKey, int oldKey, int iSet)
redoes next_ for a set.
This implements Gub rows plus a ClpPackedMatrix.
double sumDualInfeasibilities_
Sum of dual infeasibilities.
ClpSimplex::Status getStatus(int sequence) const
Status.
virtual double * rhsOffset(ClpSimplex *model, bool forceRefresh=false, bool check=false)
Returns effective RHS offset if it is being used.
int noCheck_
If pricing will declare victory (i.e.
double * lower_
Lower bounds on sets.
ClpGubMatrix()
Default constructor.
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...
int * fromIndex_
Sum of dual infeasibilities.
void setAbove(int sequence)
To say key is above ub.
double sumPrimalInfeasibilities_
Sum of primal infeasibilities.
unsigned char * saveStatus_
Saved status of slacks.
virtual void primalExpanded(ClpSimplex *model, int mode)
mode=0 - Set up before "update" and "times" for primal solution using extended rows mode=1 - Cleanup ...
int * backward_
Backward pointer to set number.
int lastGub_
last gub variable (same as end_[numberSets_-1] at present)
Sparse Matrix Base Class.
int possiblePivotKey_
Pivot row of possible next key.
CoinPackedMatrix * matrix() const
Returns CoinPackedMatrix (non const)
int * start() const
Starts.
double * upper() const
Upper bounds on sets.
virtual void dualExpanded(ClpSimplex *model, CoinIndexedVector *array, double *other, int mode)
mode=0 - Set up before "updateTranspose" and "transposeTimes" for duals using extended updates array ...
void setFlagged(int sequence)
To flag a variable.
virtual void transposeTimesByRow(const ClpSimplex *model, double scalar, const CoinIndexedVector *x, CoinIndexedVector *y, CoinIndexedVector *z) const
Return x * scalar * A + y in z.
void setFeasible(int sequence)
To say key is feasible.
int saveNumber_
Number in vector without gub extension.
void switchOffCheck()
Switches off dj checking each factorization (for BIG models)
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...
int numberSets() const
Number of sets (gub rows)
virtual void correctSequence(const ClpSimplex *model, int &sequenceIn, int &sequenceOut)
Correct sequence in and out to give true value.
virtual void useEffectiveRhs(ClpSimplex *model, bool cheapest=true)
Sets up an effective RHS and does gub crash if needed.
void clearFlagged(int sequence)
Status.
double CoinFactorizationDouble
int * keyVariable_
Key variable of set.
Status
enums for status of various sorts.
virtual void unpack(const ClpSimplex *model, CoinIndexedVector *rowArray, int column) const
Unpacks a column into an CoinIndexedvector.
virtual ClpMatrixBase * reverseOrderedCopy() const
Returns a new matrix in reverse order without gaps (GUB wants NULL)
virtual ClpMatrixBase * clone() const
Clone.
void setBelow(int sequence)
To say key is below lb.
virtual void transposeTimes(double scalar, const double *x, double *y) const
Return y + x * scalar * A in y.
virtual int generalExpanded(ClpSimplex *model, int mode, int &number)
mode=0 - Create list of non-key basics in pivotVariable_ using number as numberBasic in and out mode=...
int * backward() const
Backward pointer to set number.
double * changeCost_
Change in costs for keys.
double * upper_
Upper bounds on sets.
int numberSets_
Number of sets (gub rows)
int firstGub_
First gub variables (same as start_[0] at present)
virtual int updatePivot(ClpSimplex *model, double oldInValue, double oldOutValue)
update information for a pivot (and effective rhs)
This solves LPs using the simplex method.
virtual void transposeTimes(const ClpSimplex *model, double scalar, const CoinIndexedVector *x, CoinIndexedVector *y, CoinIndexedVector *z) const
Return x * scalar * A + y in z.
void setStatus(int sequence, ClpSimplex::Status status)
Status.
unsigned char * status_
Status of slacks.
int * backToPivotRow_
Backward pointer to pivot row !!!
Abstract base class for Clp Matrices.
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
int * next_
Next basic variable in set - starts at key and end with -(set+1).
virtual ~ClpGubMatrix()
Destructor.
int * toIndex_
Backward pointer to index in CoinIndexedVector.
virtual int hiddenRows() const
Returns number of hidden rows e.g. gub.
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 * keyVariable() const
Key variable of set.
virtual int synchronize(ClpSimplex *model, int mode)
This is local to Gub to allow synchronization: mode=0 when status of basis is good mode=1 when variab...
double weight(int sequence) const
Status.
virtual ClpMatrixBase * subsetClone(int numberRows, const int *whichRows, int numberColumns, const int *whichColumns) const
Subset clone (without gaps).
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...
ClpGubMatrix & operator=(const ClpGubMatrix &)
The copy constructor.
double infeasibilityWeight_
Infeasibility weight when last full pass done.
double * lower() const
Lower bounds on sets.
int gubType_
type of gub - 0 not contiguous, 1 contiguous add 8 bit to say no ubs on individual variables ...
int * savedKeyVariable_
Saved key variables.
int numberPrimalInfeasibilities_
Number of primal infeasibilities.
double sumOfRelaxedDualInfeasibilities_
Sum of Dual infeasibilities using tolerance based on error in duals.
virtual void subsetTransposeTimes(const ClpSimplex *model, const CoinIndexedVector *x, const CoinIndexedVector *y, CoinIndexedVector *z) const
Return <code>x *A</code> in <code>z</code> but just for indices in y.