6 #ifndef ClpDynamicExampleMatrix_H
7 #define ClpDynamicExampleMatrix_H
40 int & bestSequence,
int & numberWanted);
50 virtual void packDown(
const int * in,
int numberToPack);
67 const double * lower,
const double * upper,
71 const unsigned char * status = NULL,
73 int numberIds = 0,
const int *ids = NULL);
77 int numberColumns,
int * starts,
78 const double * lower,
const double * upper,
79 int * startColumn,
int * row,
80 double * element,
double * cost,
82 const unsigned char * status = NULL,
84 int numberIds = 0,
const int *ids = NULL);
138 st_byte =
static_cast<unsigned char>(st_byte & ~7);
139 st_byte =
static_cast<unsigned char>(st_byte | status);
double * columnUpper() const
Optional upper bounds on columns.
virtual ~ClpDynamicExampleMatrix()
Destructor.
virtual void packDown(const int *in, int numberToPack)
If addColumn forces compression then this allows descendant to know what to do.
double * elementGen_
elements
double * element() const
elements
CoinBigIndex * startColumnGen_
Starts of each column.
unsigned char * dynamicStatus() const
Status region for gub variables.
DynamicStatus
enums for status of various sorts
void setFlaggedGen(int i)
Starts of each column.
double * columnLower() const
Optional lower bounds on columns.
int numberSets() const
Number of sets (dynamic rows)
virtual ClpMatrixBase * clone() const
Clone.
double * cost() const
costs
int * rowGen() const
rows
void setDynamicStatusGen(int sequence, DynamicStatus status)
Starts of each column.
double * columnLowerGen() const
Optional lower bounds on columns.
virtual void createVariable(ClpSimplex *model, int &bestSequence)
Creates a variable.
int * idGen_
identifier for each variable up one level (startColumn_, etc).
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
CoinBigIndex * startColumn() const
Starts of each column.
DynamicStatus getDynamicStatusGen(int sequence) const
Starts of each column.
This implements a dynamic matrix when we have a limit on the number of "interesting rows"...
double * columnLowerGen_
Optional lower bounds on columns.
ClpDynamicExampleMatrix()
Default constructor.
double * columnUpperGen() const
Optional upper bounds on columns.
double * costGen() const
costs
bool flaggedGen(int i) const
Whether flagged.
This implements a dynamic matrix when we have a limit on the number of "interesting rows"...
int * fullStartGen_
start of each set
ClpDynamicExampleMatrix & operator=(const ClpDynamicExampleMatrix &)
The copy constructor.
This solves LPs using the simplex method.
int numberColumns() const
size
Abstract base class for Clp Matrices.
double * columnUpperGen_
Optional upper bounds on columns.
int * idGen() const
ids in next level matrix
unsigned char * dynamicStatusGen_
for status and which bound
void unsetFlagged(int i)
Starts of each column.
CoinBigIndex * startColumnGen() const
Starts of each column.
double * elementGen() const
elements
int * fullStartGen() const
full starts