11 #ifndef ClpNetworkBasis_H
12 #define ClpNetworkBasis_H
18 #ifndef COIN_FAST_CODE
19 #define COIN_FAST_CODE
37 const int * permuteBack,
const CoinBigIndex * startColumn,
38 const int * numberInColumn,
60 int rowIsBasic[],
int columnIsBasic[]);
88 double array[] )
const;
96 double array[] )
const;
110 #ifndef COIN_FAST_CODE
const ClpSimplex * model_
model
ClpNetworkBasis()
Default constructor.
int numberRows_
Number of Rows in factorization.
int numberColumns_
Number of Columns in factorization.
int * stack2_
Second stack.
int * descendant_
Descendant.
This deals with Factorization and Updates for network structures.
ClpNetworkBasis & operator=(const ClpNetworkBasis &other)
= copy
~ClpNetworkBasis()
Destructor.
int updateColumnTranspose(CoinIndexedVector *regionSparse, double array[]) const
Updates one column transpose (BTRAN) For large problems you should ALWAYS know where the nonzeros are...
double CoinFactorizationDouble
int * permuteBack_
Permute back array.
This solves LPs using the simplex method.
Abstract base class for Clp Matrices.
char * mark_
To mark rows.
double updateColumn(CoinIndexedVector *regionSparse, CoinIndexedVector *regionSparse2, int pivotRow)
Updates one column (FTRAN) from region, Returns pivot value if "pivotRow" >=0.
double * sign_
Sign of pivot.
int factorize(const ClpMatrixBase *matrix, int rowIsBasic[], int columnIsBasic[])
When part of LP - given by basic variables.
int * permute_
Permute into array.
int replaceColumn(CoinIndexedVector *column, int pivotRow)
Replaces one Column to basis, returns 0=OK, 1=Probably OK, 2=singular!!
int * parent_
Parent for each column.
int * leftSibling_
Left sibling.
int * rightSibling_
Right sibling.