11 #ifndef ClpNetworkBasis_H 12 #define ClpNetworkBasis_H 18 #ifndef COIN_FAST_CODE 19 #define COIN_FAST_CODE 35 const int *permuteBack,
const int *startColumn,
36 const int *numberInColumn,
58 int rowIsBasic[],
int columnIsBasic[]);
86 double array[])
const;
94 double array[])
const;
107 #ifndef COIN_FAST_CODE Abstract base class for Clp Matrices.
This deals with Factorization and Updates for network structures.
int factorize(const ClpMatrixBase *matrix, int rowIsBasic[], int columnIsBasic[])
When part of LP - given by basic variables.
double updateColumn(CoinIndexedVector *regionSparse, CoinIndexedVector *regionSparse2, int pivotRow)
Updates one column (FTRAN) from region, Returns pivot value if "pivotRow" >=0.
double CoinFactorizationDouble
This solves LPs using the simplex method.
int replaceColumn(CoinIndexedVector *column, int pivotRow)
Replaces one Column to basis, returns 0=OK, 1=Probably OK, 2=singular!!
int updateColumnTranspose(CoinIndexedVector *regionSparse, double array[]) const
Updates one column transpose (BTRAN) For large problems you should ALWAYS know where the nonzeros are...
ClpNetworkBasis & operator=(const ClpNetworkBasis &other)
= copy
~ClpNetworkBasis()
Destructor.
ClpNetworkBasis()
Default constructor.