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