6 #ifndef ClpDynamicMatrix_H
7 #define ClpDynamicMatrix_H
33 int &bestSequence,
int &numberWanted);
49 virtual void times(
double scalar,
50 const double *x,
double *y)
const;
64 double *other,
int mode);
102 double cost,
double lower,
double upper,
int iSet,
139 int numberColumns,
const int *starts,
140 const double *lower,
const double *upper,
144 const unsigned char *status = NULL,
171 unsigned char &st_byte =
status_[sequence];
172 st_byte =
static_cast< unsigned char >(st_byte & ~7);
173 st_byte =
static_cast< unsigned char >(st_byte | status);
219 st_byte =
static_cast< unsigned char >(st_byte & ~7);
220 st_byte =
static_cast< unsigned char >(st_byte | status);
252 inline int *
id()
const
double * lowerSet() const
Lower bounds on sets.
void setFlaggedSlack(int i)
Status of row slacks.
int noCheck_
If pricing will declare victory (i.e.
double * columnUpper() const
Optional upper bounds on columns.
unsigned char * gubRowStatus() const
Status region for gub slacks.
int * backToPivotRow_
Backward pointer to pivot row !!!
int numberGubColumns_
size
ClpDynamicMatrix()
Default constructor.
void unsetFlaggedSlack(int i)
Status of row slacks.
double * element() const
elements
int * id_
ids of active columns (just index here)
unsigned char * dynamicStatus() const
Status region for gub variables.
DynamicStatus
enums for status of various sorts
virtual int refresh(ClpSimplex *model)
Purely for column generation and similar ideas.
int whichSet(int sequence) const
Returns which set a variable is in.
CoinBigIndex numberElements_
size of working matrix (max)
virtual ClpMatrixBase * clone() const
Clone.
double columnUpper(int sequence) const
Gets upper bound (to simplify coding)
virtual void createVariable(ClpSimplex *model, int &bestSequence)
Creates a variable.
double * columnLower_
Optional lower bounds on columns.
double sumDualInfeasibilities_
Sum of dual infeasibilities.
int * keyVariable() const
Status of row slacks.
double * columnLower() const
Optional lower bounds on columns.
int * toIndex_
Backward pointer to extra row.
int * startSet_
Start of each set.
int numberSets() const
Number of sets (dynamic rows)
double * upperSet() const
Upper bounds on sets.
void initialProblem()
Populates initial matrix from dynamic status.
void setStatus(int sequence, ClpSimplex::Status status)
Status of row slacks.
double * element_
elements
int numberGubEntries() const
Number of possible gub variables.
virtual double reducedCost(ClpSimplex *model, int sequence) const
Returns reduced cost of a variable.
double * cost() const
costs
int numberStaticRows() const
number of rows in original model
Sparse Matrix Base Class.
CoinBigIndex * startColumn_
Starts of each column.
int firstAvailable() const
first free
int lastDynamic_
number of columns in dynamic model
double savedBestGubDual_
Saved best dual on gub row in pricing.
double keyValue(int iSet) const
Gets key value when none in small.
ClpSimplex * model_
Pointer back to model.
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=...
double objectiveOffset() const
Saved value of objective offset.
void writeMps(const char *name)
Writes out model (without names)
CoinBigIndex * startColumn() const
Starts of each column.
int savedBestSet_
Saved best set in pricing.
int * keyVariable_
Key variable of set (only accurate if none in small problem)
int maximumGubColumns_
current maximum number of columns (then compress)
int numberDualInfeasibilities_
Number of dual infeasibilities.
DynamicStatus getDynamicStatus(int sequence) const
Status of row slacks.
virtual double * rhsOffset(ClpSimplex *model, bool forceRefresh=false, bool check=false)
Returns effective RHS offset if it is being used.
Status
enums for status of various sorts.
double sumOfRelaxedDualInfeasibilities_
Sum of Dual infeasibilities using tolerance based on error in duals.
double sumOfRelaxedPrimalInfeasibilities_
Sum of Primal infeasibilities using tolerance based on error in primals.
virtual void packDown(const int *, int)
If addColumn forces compression then this allows descendant to know what to do.
int * id() const
ids of active columns (just index here)
int firstAvailable_
first free
ClpSimplex::Status getStatus(int sequence) const
Status of row slacks.
virtual ~ClpDynamicMatrix()
Destructor.
void setDynamicStatus(int sequence, DynamicStatus status)
Status of row slacks.
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
unsigned char * status_
Status of slack on set.
double * upperSet_
Upper bounds on sets.
int numberActiveSets_
Number of active sets.
CoinBigIndex maximumElements_
current maximum number of elemnts (then compress)
This implements a dynamic matrix when we have a limit on the number of "interesting rows"...
int numberStaticRows_
number of rows in original model
This solves LPs using the simplex method.
double * columnUpper_
Optional upper bounds on columns.
const double COIN_DBL_MAX
Abstract base class for Clp Matrices.
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
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 ...
bool flagged(int i) const
Whether flagged.
double infeasibilityWeight_
Infeasibility weight when last full pass done.
int firstDynamic_
first dynamic
virtual int updatePivot(ClpSimplex *model, double oldInValue, double oldOutValue)
update information for a pivot (and effective rhs)
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
double sumPrimalInfeasibilities_
Sum of primal infeasibilities.
double objectiveOffset_
Saved value of objective offset.
double columnLower(int sequence) const
Gets lower bound (to simplify coding)
bool flaggedSlack(int i) const
Whether flagged slack.
int * fromIndex_
Sum of dual infeasibilities.
void unsetFlagged(int i)
Status of row slacks.
int numberSets_
Number of sets (dynamic rows)
int * startSets() const
Sets.
int addColumn(CoinBigIndex numberEntries, const int *row, const double *element, double cost, double lower, double upper, int iSet, DynamicStatus status)
Adds in a column to gub structure (called from descendant) and returns sequence.
int numberPrimalInfeasibilities_
Number of primal infeasibilities.
int firstAvailableBefore_
first free when iteration started
int numberGubColumns() const
size
void setFlagged(int i)
Status of row slacks.
CoinBigIndex numberElements() const
size of working matrix (max)
int firstDynamic() const
first dynamic
ClpDynamicMatrix & operator=(const ClpDynamicMatrix &)
The copy constructor.
void switchOffCheck()
Switches off dj checking each factorization (for BIG models)
void gubCrash()
Does gub crash.
int lastDynamic() const
number of columns in dynamic model
unsigned char * dynamicStatus_
for status and which bound
double * lowerSet_
Lower bounds on sets.
void modifyOffset(int sequence, double amount)
Modifies rhs offset.