11 #ifndef ClpSimplexNonlinear_H
12 #define ClpSimplexNonlinear_H
14 class ClpNonlinearInfo;
45 int primalSLP(
int numberPasses,
double deltaTolerance);
52 int numberPasses,
double deltaTolerance);
60 CoinIndexedVector * spare1, CoinIndexedVector * spare2,
62 double & normFlagged,
double & normUnflagged,
63 int & numberNonBasic);
81 CoinIndexedVector * spare,
83 double & solutionError,
97 double & bestObjectiveWhenFlagged);
void directionVector(CoinIndexedVector *longArray, CoinIndexedVector *spare1, CoinIndexedVector *spare2, int mode, double &normFlagged, double &normUnflagged, int &numberNonBasic)
Creates direction vector.
int primalSLP(int numberPasses, double deltaTolerance)
Primal algorithm for quadratic Using a semi-trust region approach as for pooling problem This is in b...
int primal()
Primal algorithms for reduced gradient At present we have two algorithms:
Constraint Abstract Base Class.
For saving extra information to see if looping.
Quadratic Objective Class.
This solves non-linear LPs using the primal simplex method.
CoinIndexedVector * columnArray(int index) const
Useful column length arrays (0,1,2,3,4,5)
int whileIterating(int &pivotMode)
Main part.
void statusOfProblemInPrimal(int &lastCleaned, int type, ClpSimplexProgress *progress, bool doFactorization, double &bestObjectiveWhenFlagged)
Refactorizes if necessary Checks if finished.
This solves LPs using the primal simplex method.
int pivotColumn(CoinIndexedVector *longArray, CoinIndexedVector *rowArray, CoinIndexedVector *columnArray, CoinIndexedVector *spare, int &pivotMode, double &solutionError, double *array1)
longArray has direction pivotMode - 0 - use all dual infeasible variables 1 - largest dj while >= 10 ...
int pivotNonlinearResult()
Do last half of an iteration.
CoinIndexedVector * rowArray(int index) const
Useful row length arrays (0,1,2,3,4,5)