11#ifndef AbcSimplexDual_H
12#define AbcSimplexDual_H
153 double *newLower,
double *newUpper,
154 double **outputSolution,
155 int *outputStatus,
int *outputIterations,
156 bool stopOnFirstInfeasible =
true,
157 bool alwaysFinish =
false,
158 int startFinishOptions = 0);
183 int whileIteratingThread();
186 int whileIteratingCilk();
201 void createDualPricingVectorThread();
202 int getTableauColumnFlipAndStartReplaceThread();
203 void getTableauColumnPart1Thread();
207 void createDualPricingVectorCilk();
208 int getTableauColumnFlipAndStartReplaceCilk();
209 void getTableauColumnPart1Cilk();
340void *abc_parallelManager(
void *simplex);
This solves LPs using the dual simplex method.
int dual()
Dual algorithm.
void perturb(double factor)
Perturbs problem.
int whatNext()
Fast iterations.
void getTableauColumnPart1Serial()
void updatePrimalSolution()
void replaceColumnPart3()
int bounceTolerances(int type)
Does something about fake tolerances.
int fastDual(bool alwaysFinish=false)
int getTableauColumnFlipAndStartReplaceSerial()
void checkReplacePart1a()
int whileIteratingSerial()
This has the flow between re-factorizations Broken out for clarity and will be used by strong branchi...
bool checkCutoff(bool computeObjective)
see if cutoff reached
void statusOfProblemInDual(int type)
Refactorizes if necessary Checks if finished.
void dualColumn2()
Chooses incoming Puts flipped ones in list If necessary will modify costs.
void dualColumn2Most(dualColumnResult &result)
double dualColumn1A()
Array has tableau row (row section) Just does slack part Returns guess at upper theta (infinite if no...
int resetFakeBounds(int type)
int nextSuperBasic()
Get next free , -1 if none.
double dualColumn1B()
Do all given tableau row.
void createDualPricingVectorSerial()
Create dual pricing vector.
void checkReplacePart1b()
AbcSimplexFactorization * setupForStrongBranching(char *arrays, int numberRows, int numberColumns, bool solveLp=false)
This does first part of StrongBranching.
void dualPivotRow()
Chooses dual pivot row Would be faster with separate region to scan and will have this (with square o...
void cleanupAfterStrongBranching(AbcSimplexFactorization *factorization)
This cleans up after strong branching.
int whileIteratingParallel(int numberIterations)
void dualColumn2First(dualColumnResult &result)
void startupSolve()
Startup part of dual.
void getTableauColumnPart2()
void originalBound(int iSequence)
Restores bound to original bound.
void checkPossibleCleanup(CoinIndexedVector *array)
This sees what is best thing to do in branch and bound cleanup If sequenceIn_ < 0 then can't do anyth...
bool changeBound(int iSequence)
As changeBounds but just changes new bounds for a single variable.
int strongBranching(int numberVariables, const int *variables, double *newLower, double *newUpper, double **outputSolution, int *outputStatus, int *outputIterations, bool stopOnFirstInfeasible=true, bool alwaysFinish=false, int startFinishOptions=0)
For strong branching.
int makeNonFreeVariablesDualFeasible(bool changeCosts=false)
Make non free variables dual feasible by moving to a bound.
void dualColumn1(bool doAll=false)
Array has tableau row (row section) Puts candidates for rows in list Returns guess at upper theta (in...
int checkUnbounded(CoinIndexedVector &ray, double changeCost)
Checks if tentative optimal actually means unbounded in dual Returns -3 if not, 2 if is unbounded.
int changeBounds(int initialize, double &changeCost)
Checks if any fake bounds active - if so returns number and modifies updatedDualBound_ and everything...
void finishSolve()
Ending part of dual.
int pivotResultPart1()
Pivot in a variable and choose an outgoing one.
void perturbB(double factor, int type)
Perturbs problem B.
int flipBounds()
The duals are updated by the given arrays.
int numberAtFakeBound()
Checks number of variables at fake bounds.
void flipBack(int number)
Undo a flip.
void dualColumn2(dualColumnResult &result)
Chooses part of incoming Puts flipped ones in list If necessary will modify costs.
void updateDualsInDual()
The duals are updated.
This just implements AbcFactorization when an AbcMatrix object is passed.
void computeObjective()
Computes nonbasic cost and total cost.
AbcSimplexFactorization * factorization() const
factorization
double * ray() const
For advanced users - no need to delete - sign not changed.
int numberColumns() const
int numberRows() const
Number of rows.
int numberIterations() const
Number of iterations.
double increaseInObjective