48 virtual int fathom(
bool allFixed);
55 double *
nonlinearSLP(
int numberPasses,
double deltaTolerance);
110 void addBoundModifier(
bool upperBoundAffected,
bool useUpperBound,
int whichVariable,
int whichVariableAffected,
112 double multiplier = 1.0);
330 int numberAffected,
const int *positionL,
331 const int *positionU,
const double *multiplier);
352 void addBoundModifier(
bool upperBoundAffected,
bool useUpperBound,
int whichVariable,
353 double multiplier = 1.0);
425 virtual int solution(
double &objectiveValue,
426 double *newSolution);
461 const double *
weights,
int setNumber);
470 const double *
weights,
int setNumber);
503 virtual void resetSequenceEtc(
int numberColumns,
const int *originalColumns);
582 const char *functionString);
622 int yColumn,
double meshSize);
655 virtual void resetSequenceEtc(
int numberColumns,
const int *originalColumns);
746 double xMesh,
double yMesh,
747 int numberExistingObjects = 0,
const OsiObject **objects = NULL);
756 double xMesh,
double yMesh,
757 int numberExistingObjects = 0,
const OsiObject **objects = NULL);
790 virtual void resetSequenceEtc(
int numberColumns,
const int *originalColumns);
955 double computeLambdas(
const double xB[3],
const double yB[3],
const double xybar[4],
double lambda[4])
const;
1040 double separator,
int chosen);
1438 int numberPasses,
double deltaTolerance,
void getPseudoShadow(const OsiBranchingInformation *info)
Sets infeasibility and other when pseudo shadow prices.
void setXOtherSatisfied(double value)
double xySatisfied() const
XY satisfied if two version differ by less than this.
ClpSimplex * quadraticModel() const
Copy of quadratic model if one.
virtual bool boundBranch() const
Return true if branch should only bound variables.
virtual void initialSolve()
Solve initial LP relaxation.
void newBounds(OsiSolverInterface *solver, int way, short xOrY, double separator) const
Does work of branching.
void addBiLinearObjects(OsiSolverLink *solver)
Add all bi-linear objects.
double infeasibility() const
ClpSimplex * quadraticModel_
Copy of quadratic model if one.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
boundElementAction * affected_
Actions.
virtual int fathom(bool allFixed)
Problem specific Returns -1 if node fathomed and no solution 0 if did nothing 1 if node fathomed and ...
virtual OsiObject * clone() const
Clone.
virtual void print(const OsiSolverInterface *=NULL) const
int boundType_
Simple quadratic bound marker.
int updateCoefficients(ClpSimplex *solver, CoinPackedMatrix *matrix)
Update coefficients - returns number updated if in updating mode.
virtual ~OsiOldLinkBranchingObject()
OsiSolverLink & operator=(const OsiSolverLink &rhs)
Assignment operator.
double linearizedBAB(CglStored *cut)
Solve linearized quadratic objective branch and bound.
void setBestObjectiveValue(double value)
Set objective value of best solution found internally.
OsiOldLinkBranchingObject & operator=(const OsiOldLinkBranchingObject &rhs)
int biLinearPriority_
Priority for bilinear.
~OsiLinkedBound()
Destructor.
int objectiveVariable() const
Objective transfer variable if one.
int numberPoints() const
Number of points.
void setNumberPoints(int value)
void setNumberObjectsToUse(int value)
Set number of objects to use.
int * whichNonLinear_
Indices in a list/row.
OsiLinkedBound & operator=(const OsiLinkedBound &rhs)
Assignment operator.
Define data for one link.
int firstLambda() const
First lambda (of 4)
int branchingStrategy() const
branching strategy etc bottom 2 bits 0 branch on either, 1 branch on x, 2 branch on y next bit 4 set ...
Define a single variable class which is involved with OsiBiLinear objects.
double * heuristicSolution(int numberPasses, double deltaTolerance, int mode)
Solves nonlinear problem from CoinModel using SLP - and then tries to get heuristic solution Returns ...
int xColumn() const
X column.
int type_
Type of variable - 0 continuous, 1 integer.
double xSatisfied() const
X satisfied if less than this away from mesh.
ClpSimplex * quadraticModel_
Copy of quadratic model if one.
void setBiLinearPriorities(int value, double meshSize=1.0)
Set all biLinear priorities on x-x variables.
double ySatisfied_
y satisfied if less than this away from mesh
virtual OsiBranchingObject * clone() const
Clone.
heuristic - just picks up any good solution
int * extraRow_
Row number.
OsiOldLinkBranchingObject()
int yRow_
y row (-1 if x*x)
int specialOptions3_
0 bit (1) - don't do mini B&B 1 bit (2) - quadratic only in objective
virtual ~OsiLinkBranchingObject()
virtual int solution(double &objectiveValue, double *newSolution)
returns 0 if no solution, 1 if valid solution.
double * multiplier_
Multiplier for coefficient on row.
double meshSize_
data Current increment for y points
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
int variable() const
Get variable.
virtual double improvement(const OsiSolverInterface *solver) const
Possible improvement.
virtual ~OsiSolverLinearizedQuadratic()
Destructor.
double defaultMeshSize() const
Default meshSize.
int * convex_
Indicator whether is convex, concave or neither -1 concave, 0 neither, +1 convex.
int doAOCuts(CglTemporary *cutGen, const double *solution, const double *solution2)
Do OA cuts.
void setYMeshSize(double value)
int numberMembers() const
ClpSimplex * approximateSolution(CoinModel &coinModel, int numberPasses, double deltaTolerance, int mode=0)
Return an approximate solution to a CoinModel.
int objectiveVariable_
Objective transfer variable if one.
virtual ~OsiBiLinearBranchingObject()
void setSpecialOptions2(int value)
Set special options.
const double * bestSolution() const
Best solution found internally.
OsiSolverLinearizedQuadratic & operator=(const OsiSolverLinearizedQuadratic &rhs)
Assignment operator.
void setBranchingStrategyOnVariables(int strategyValue, int priorityValue=-1, int mode=7)
Set options and priority on all or some biLinear variables 1 - on I-I 2 - on I-x 4 - on x-x or combin...
const double * bestSolution() const
Best solution found internally.
virtual bool boundBranch() const
Return true if branch should only bound variables.
This class chooses a variable to branch on.
void setDefaultMeshSize(double value)
void updateBounds(ClpSimplex *solver)
Update other bounds.
const CoinModel * coinModel() const
Return CoinModel.
void gutsOfCopy(const OsiSolverLink &rhs)
Do real work of copy.
int numberLinks() const
Number of links for each member.
virtual void resetModel(CbcModel *model)
Resets stuff if model changes.
Branching object for Linked ordered sets.
double bestObjectiveValue_
Objective value of best solution found internally.
virtual OsiBranchingObject * clone() const
Clone.
This is for codes where solver needs to know about CbcModel Seems to provide only one value-added fea...
double yMeshSize() const
Y meshSize.
double bestObjectiveValue() const
Objective value of best solution found internally.
OsiChooseStrongSubset & operator=(const OsiChooseStrongSubset &rhs)
Assignment operator.
std::string function_
Function.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
double * bestSolution_
Best solution found internally.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
double xyBranchValue_
value of x or y to branch about
int objectiveRow_
Objective transfer row if one.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
int numberAffected_
Number of variables/elements affected.
virtual ~CglTemporary()
Destructor.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current value.
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
virtual void initialSolve()
Solve initial LP relaxation.
double xSatisfied_
x satisfied if less than this away from mesh
double coefficient() const
Coefficient.
double xyCoefficient(const double *solution) const
Returns true value of single xyRow coefficient.
void setBranchingStrategy(int value)
double infeasibility() const
CoinPackedMatrix * matrix_
Clean copy of matrix Marked coefficients will be multiplied by L or U.
double xOtherSatisfied_
X other satisfied if less than this away from mesh.
This is to allow the user to replace initialSolve and resolve.
virtual bool boundBranch() const
Return true if branch should only bound variables.
OsiSolverInterface * model_
Pointer back to model.
double bestObjectiveValue() const
Objective value of best solution found internally.
void setIntegerPriority(int value)
Set integer priority.
double defaultMeshSize_
Default mesh.
int numberPoints_
Number of points.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
OsiUsesBiLinear & operator=(const OsiUsesBiLinear &rhs)
Assignment operator.
OsiOldLink & operator=(const OsiOldLink &rhs)
double defaultBound() const
Default maximumbound.
int yColumn() const
Y column.
void setDefaultBound(double value)
virtual OsiBranchingObject * clone() const
Clone.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
double yOtherSatisfied_
Y other satisfied if less than this away from mesh.
double defaultBound_
Default maximum bound.
OsiLink & operator=(const OsiLink &rhs)
const double * weights() const
virtual OsiObject * clone() const
Clone.
virtual OsiChooseVariable * clone() const
Clone.
double newGrid(OsiSolverInterface *solver, int type) const
change grid if type 0 then use solution and make finer if 1 then back to original returns mesh size
void setFixedPriority(int priorityValue)
Two tier integer problem where when set of variables with priority less than this are fixed the probl...
This is to allow the user to replace initialSolve and resolve This version changes coefficients.
virtual CglCutGenerator * clone() const
Clone.
List of bounds which depend on other bounds.
void setMeshSizes(double value)
Set all mesh sizes on x-x variables.
void setSpecialOptions3(int value)
Set special options.
Define Continuous BiLinear objects for an == bound.
void setXYSatisfied(double value)
int updateCoefficients(const double *lower, const double *upper, double *objective, CoinPackedMatrix *matrix, CoinWarmStartBasis *basis) const
Updates coefficients - returns number updated.
virtual OsiObject * clone() const
Clone.
void addExtraRow(int row, double multiplier)
Adds in data for extra row with variable coefficients.
CoinModel coinModel_
Model in CoinModel format.
OsiBiLinear & operator=(const OsiBiLinear &rhs)
double xySatisfied_
xy satisfied if less than this away from true
ClpSimplex * quadraticModel() const
Copy of quadratic model if one.
OsiLinkedBound * info_
Information.
short chosen_
Which chosen -1 none, 0 x, 1 y.
int numberExtraRows_
Number of extra rows (coefficients to be modified)
void setCoefficient(double value)
Set coefficient.
int numberBiLinear_
data Number of bilinear objects (maybe could be more general)
virtual int setupList(OsiBranchingInformation *info, bool initialize)
Sets up strong list and clears all if initialize is true.
Define Special Linked Ordered Sets.
int numberNonLinearRows_
Number of rows with nonLinearities.
virtual void generateCuts(const OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo info=CglTreeInfo())
Generate Mixed Integer Stored cuts for the model of the solver interface, si.
int specialOptions3() const
Get special options.
virtual ~OsiChooseStrongSubset()
Destructor.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
OsiSimpleFixedInteger()
Default Constructor.
int branchingStrategy_
branching strategy etc bottom 2 bits 0 branch on either, 1 branch on x, 2 branch on y next bit 4 set ...
OsiSimpleFixedInteger & operator=(const OsiSimpleFixedInteger &rhs)
Assignment operator.
int biLinearPriority() const
Get biLinear priority.
Branching object for Linked ordered sets.
virtual OsiObject * clone() const
Clone.
int numberVariables_
Number of variables in tightening phase.
void getCoefficients(const OsiSolverInterface *solver, double xB[2], double yB[2], double xybar[4]) const
Get LU coefficients from matrix.
int maximumAffected_
Maximum number of variables/elements affected.
OsiBiLinearBranchingObject & operator=(const OsiBiLinearBranchingObject &rhs)
virtual ~OsiBiLinearEquality()
OsiUsesBiLinear()
Default Constructor.
OsiObject ** objects_
Objects.
int * rowNonLinear_
Row number for a list.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
const OsiObject * originalObject() const
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
virtual CbcHeuristic * clone() const
Clone.
virtual double feasibleRegion(OsiSolverInterface *solver) const
int numberLinks() const
Number of links for each member.
void sayConvex(bool convex)
Say convex (should work it out) - if convex false then strictly concave.
Stored Temporary Cut Generator Class - destroyed after first use.
int numberObjectsToUse_
Number of objects to be used (and set in solver)
void setMeshSizes(const OsiSolverInterface *solver, double x, double y)
Set sizes and other stuff.
OsiOneLink & operator=(const OsiOneLink &rhs)
CglTemporary()
Default constructor.
virtual void resolve()
Resolve an LP relaxation after problem modification.
int yRow_
Row which defines y.
virtual void setModel(CbcModel *model)
update model
virtual int solution(double &objectiveValue, double *newSolution)=0
returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets sol...
virtual int chooseVariable(OsiSolverInterface *solver, OsiBranchingInformation *info, bool fixVariables)
Choose a variable Returns - -1 Node is infeasible 0 Normal termination - we have a candidate 1 All lo...
virtual ~OsiSolverLink()
Destructor.
double getMovement(const OsiBranchingInformation *info)
Gets sum of movements to correct value.
int * startNonLinear_
Starts of lists.
virtual int tightenBounds(int lightweight=0)
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
int specialOptions2_
0 bit (1) - call fathom (may do mini B&B) 1 bit (2) - quadratic only in objective (add OA cuts) 2 bit...
virtual ~OsiSimpleFixedInteger()
Destructor.
void addBoundModifier(bool upperBoundAffected, bool useUpperBound, int whichVariable, double multiplier=1.0)
Add a bound modifier.
virtual bool canDealWithOdd() const
Returns true if can deal with "odd" problems e.g. sos type 2.
virtual ~OsiUsesBiLinear()
Destructor.
OsiChooseStrongSubset()
Default Constructor.
int specialOptions2() const
Get special options.
virtual double checkInfeasibility(const OsiBranchingInformation *info) const
int boundType() const
Simple quadratic bound marker.
CoinPackedMatrix * originalRowCopy() const
Row copy of matrix Just genuine columns and rows Linear part.
double * bestSolution_
Best solution found internally.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
CoinPackedMatrix * quadraticRow(int rowNumber, double *linear) const
Gets correct form for a quadratic row - user to delete.
double yOtherSatisfied() const
Y other satisfied if less than this away from mesh.
CoinPackedMatrix * originalRowCopy_
Row copy of matrix Just genuine columns and rows.
void setYOtherSatisfied(double value)
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
double computeLambdas(const double xB[3], const double yB[3], const double xybar[4], double lambda[4]) const
Compute lambdas (third entry in each .B is current value) (nonzero if bad)
OsiBiLinearBranchingObject()
OsiLinkBranchingObject & operator=(const OsiLinkBranchingObject &rhs)
virtual OsiObject * clone() const
Clone.
void setXSatisfied(double value)
void addBoundModifier(bool upperBoundAffected, bool useUpperBound, int whichVariable, int whichVariableAffected, double multiplier=1.0)
Add a bound modifier.
double bestObjectiveValue_
Objective value of best solution found internally.
int convexity_
Convexity row.
int yColumn_
Column which defines y.
void setBiLinearPriority(int value)
Set biLinear priority.
int xColumn_
Column which defines x.
int * fixVariables_
list of fixed variables
void setBoundType(int value)
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
OsiSolverLink()
Default Constructor.
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
double infeasibility() const
short chosen_
data 1 means branch on x, 2 branch on y
void addTighterConstraints()
Add reformulated bilinear constraints.
CglTemporary & operator=(const CglTemporary &rhs)
Assignment operator.
void load(CoinModel &modelObject, bool tightenBounds=false, int logLevel=1)
Simple Branch and bound class.
virtual bool boundBranch() const
Return true if branch should only bound variables.
void analyzeObjects()
Analyze constraints to see which are convex (quadratic)
virtual OsiObject * clone() const
Clone.
double * nonlinearSLP(int numberPasses, double deltaTolerance)
Solves nonlinear problem from CoinModel using SLP - may be used as crash for other algorithms when nu...
double xOtherSatisfied() const
X other satisfied if less than this away from mesh.
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
CoinPackedMatrix * cleanMatrix() const
Clean copy of matrix So we can add rows.
Define a single integer class - but one where you keep branching until fixed even if satisfied.
void setYSatisfied(double value)
int integerPriority_
Priority for integers.
double ySatisfied() const
Y satisfied if less than this away from mesh.
int numberFix_
Number of variables which when fixed help.
int integerPriority() const
Get integer priority.
int numberObjectsToUse() const
Number of objects to use.
int numberLinks_
Number of links.
OsiBiLinearEquality & operator=(const OsiBiLinearEquality &rhs)
OsiLinkedBound()
Default Constructor.
Branching object for BiLinear objects.
int firstLambda_
First lambda (of 4)
void setXMeshSize(double value)
double xMeshSize() const
X meshSize.
void setBestSolution(const double *solution, int numberColumns)
Set best solution found internally.
OsiSolverLinearizedQuadratic()
Default Constructor.