11 #ifndef AbcSimplexPrimal_H
12 #define AbcSimplexPrimal_H
114 int primal(
int ifValuesPass = 0,
int startFinishOptions = 0);
173 double &objectiveChange,
179 double theta,
bool valuesPass);
183 const double *originalCost,
184 const double extraCost[4],
185 double &objectiveChange,
double * ray() const
For advanced users - no need to delete - sign not changed.
int checkUnbounded(CoinIndexedVector *ray, CoinIndexedVector *spare, double changeCost)
Checks if tentative optimal actually means unbounded in primal Returns -3 if not, 2 if is unbounded...
bool unPerturb()
Take off effect of perturbation and say whether to try dual.
double theta() const
Theta (pivot change)
int lexSolve()
Sort of lexicographic resolve.
bool alwaysOptimal() const
void primalColumn(CoinPartitionedVector *updateArray, CoinPartitionedVector *spareRow2, CoinPartitionedVector *spareColumn1)
Chooses primal pivot column updateArray has cost updates (also use pivotRow_ from last iteration) Wou...
int unflag()
Unflag all variables and return number unflagged.
double updateMinorCandidate(const CoinIndexedVector &updateBy, CoinIndexedVector &candidate, int sequenceIn)
Update minor candidate vector - new reduced cost returned later try and get change in reduced cost (t...
void createUpdateDuals(CoinIndexedVector &rowArray, const double *originalCost, const double extraCost[4], double &objectiveChange, int valuesPass)
After rowArray will have cost changes for use next iteration.
void primalRow(CoinIndexedVector *rowArray, CoinIndexedVector *rhsArray, CoinIndexedVector *spareArray, int valuesPass)
Row array has pivot column This chooses pivot row.
void statusOfProblemInPrimal(int type)
Refactorizes if necessary Checks if finished.
int sequenceIn() const
Return sequence In or Out.
void primalRay(CoinIndexedVector *rowArray)
Create primal ray.
void updatePartialUpdate(CoinIndexedVector &partialUpdate)
Update partial Ftran by R update.
bool exactOutgoing() const
void perturb(int type)
Perturbs problem (method depends on perturbation())
CoinIndexedVector * columnArray(int index) const
Useful column length arrays (0,1,2,3,4,5)
int primal(int ifValuesPass=0, int startFinishOptions=0)
Primal algorithm.
int nextSuperBasic(int superBasicType, CoinIndexedVector *columnArray)
Get next superbasic -1 if none, Normal type is 1 If type is 3 then initializes sorted list if 2 uses ...
int doFTUpdate(CoinIndexedVector *vector[4])
Do FT update as separate function for minor iterations (nonzero return code on problems) ...
int updatePrimalsInPrimal(CoinIndexedVector *rowArray, double theta, double &objectiveChange, int valuesPass)
The primals are updated by the given array.
void clearAll()
Clears all bits and clears rowArray[1] etc.
int whileIterating(int valuesOption)
This has the flow between re-factorizations.
CoinIndexedVector * rowArray(int index) const
Useful row length arrays (0,1,2,3,4,5)
int pivotResult(int ifValuesPass=0)
Do last half of an iteration.
int pivotResult4(int ifValuesPass=0)
This solves LPs using the primal simplex method.