6#ifndef ClpGubDynamicMatrix_H
7#define ClpGubDynamicMatrix_H
9#include "CoinPragma.hpp"
26 int &bestSequence,
int &numberWanted);
56 virtual void times(
double scalar,
57 const double *x,
double *y)
const;
83 int numberColumns,
const int *starts,
88 const unsigned char *status = NULL);
118 st_byte =
static_cast< unsigned char >(st_byte & ~7);
119 st_byte =
static_cast< unsigned char >(st_byte | status);
156 inline int *
id()
const
This implements Gub rows plus a ClpPackedMatrix.
virtual int checkFeasible(ClpSimplex *model, double &sum) const
Just for debug Returns sum and number of primal infeasibilities.
double objectiveOffset() const
Saved value of objective offset.
unsigned char * dynamicStatus() const
Status region for gub variables.
virtual void useEffectiveRhs(ClpSimplex *model, bool cheapest=true)
Sets up an effective RHS and does gub crash if needed.
int * fullStart_
full starts
double * lowerSet() const
Optional true lower bounds on sets.
double objectiveOffset_
Saved value of objective offset.
unsigned char * gubRowStatus() const
Status region for gub slacks.
ClpGubDynamicMatrix()
Default constructor.
bool flagged(int i) const
Whether flagged.
double * element_
elements
int firstAvailable_
first free
unsigned char * dynamicStatus_
for status and which bound
CoinBigIndex numberElements_
size of working matrix (max)
virtual void partialPricing(ClpSimplex *model, double start, double end, int &bestSequence, int &numberWanted)
Partial pricing.
int firstDynamic_
first dynamic
double * lowerColumn_
Optional lower bounds on columns.
CoinBigIndex * startColumn_
Starts of each column.
double * upperSet() const
Optional true upper bounds on sets.
CoinBigIndex * startColumn() const
Starts of each column.
double * upperSet_
Optional true upper bounds on sets.
double * cost() const
costs
int lastDynamic_
number of columns in dynamic model
virtual double * rhsOffset(ClpSimplex *model, bool forceRefresh=false, bool check=false)
Returns effective RHS offset if it is being used.
virtual ClpMatrixBase * clone() const
Clone.
ClpGubDynamicMatrix(const ClpGubDynamicMatrix &)
The copy constructor.
void insertNonBasic(int sequence, int iSet)
Add a new variable to a set.
ClpGubDynamicMatrix & operator=(const ClpGubDynamicMatrix &)
void cleanData(ClpSimplex *model)
Cleans data after setWarmStart.
void setDynamicStatus(int sequence, DynamicStatus status)
void setFirstAvailable(int value)
set first free
int lastDynamic() const
number of columns in dynamic model
int whichSet(int sequence) const
Returns which set a variable is in.
DynamicStatus
enums for status of various sorts
int * id() const
ids of active columns (just index here)
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...
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
int firstDynamic() const
first dynamic
int firstAvailable() const
first free
int * id_
ids of active columns (just index here)
DynamicStatus getDynamicStatus(int sequence) const
int numberGubColumns_
size
ClpGubDynamicMatrix(ClpSimplex *model, int numberSets, int numberColumns, const int *starts, const double *lower, const double *upper, const CoinBigIndex *startColumn, const int *row, const double *element, const double *cost, const double *lowerColumn=NULL, const double *upperColumn=NULL, const unsigned char *status=NULL)
This is the real constructor.
virtual int updatePivot(ClpSimplex *model, double oldInValue, double oldOutValue)
update information for a pivot (and effective rhs)
int savedFirstAvailable_
saved first free
double * upperColumn_
Optional upper bounds on columns.
CoinBigIndex numberElements() const
size of working matrix (max)
virtual ~ClpGubDynamicMatrix()
Destructor.
double * element() const
elements
int numberGubColumns() const
size
double * lowerColumn() const
Optional lower bounds on columns.
int * fullStart() const
full starts
double * upperColumn() const
Optional upper bounds on columns.
double * lowerSet_
Optional true lower bounds on sets.
This implements Gub rows plus a ClpPackedMatrix.
int * start() const
Starts.
double * upper() const
Upper bounds on sets.
unsigned char * status_
Status of slacks.
double * lower() const
Lower bounds on sets.
int numberSets() const
Number of sets (gub rows)
Abstract base class for Clp Matrices.
virtual void times(double scalar, const double *x, double *y) const
Return y + A * scalar *x in y.
This solves LPs using the simplex method.