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