6 #ifndef ClpCholeskyUfl_H
7 #define ClpCholeskyUfl_H
49 virtual void solve (
double * region) ;
virtual int symbolic()
Does Symbolic factorization given permutation using CHOLMOD (if available).
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.
This solves LPs using interior point methods.
virtual void solve(double *region)
Uses factorization to solve.
struct cholmod_factor_struct cholmod_factor
struct cholmod_common_struct cholmod_common
Abstract base class for Clp Matrices.
ClpCholeskyUfl & operator=(const ClpCholeskyUfl &)
Ufl class for Clp Cholesky factorization.
virtual ~ClpCholeskyUfl()
Destructor.
ClpCholeskyUfl(int denseThreshold=-1)
Constructor which has dense columns activated.
virtual ClpCholeskyBase * clone() const
Clone.
virtual int factorize(const double *diagonal, int *rowsDropped)
Factorize - filling in rowsDropped and returning number dropped using CHOLMOD (if available)...