4 #ifndef ClpCholeskyUfl_H
5 #define ClpCholeskyUfl_H
10 #ifndef CLP_USE_CHOLMOD
44 #ifdef CLP_USE_CHOLMOD
54 virtual void solve (
double * region) ;
76 #ifdef CLP_USE_CHOLMOD
virtual void solve(CoinWorkDouble *region)
Uses factorization to solve.
char * rowsDropped() const
rowsDropped - which rows are gone
virtual int order(ClpInterior *model)
Orders rows and saves pointer to matrix.and model.
Base class for Clp Cholesky factorization Will do better factorization.
longDouble * diagonal() const
Return diagonal.
virtual int factorize(const CoinWorkDouble *diagonal, int *rowsDropped)
Factorize - filling in rowsDropped and returning number dropped.
This solves LPs using interior point methods.
Abstract base class for Clp Matrices.
ClpCholeskyUfl & operator=(const ClpCholeskyUfl &)
Constructor which has dense columns activated.
virtual int symbolic()
Does Symbolic factorization given permutation.
Ufl class for Clp Cholesky factorization.
virtual ~ClpCholeskyUfl()
Destructor.
ClpCholeskyUfl(int denseThreshold=-1)
Constructor which has dense columns activated.
virtual ClpCholeskyBase * clone() const
Clone.