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);
469 int numberLinks,
int typeSOS,
const int *which,
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);
755 int yColumn,
int xyRow,
double coefficient,
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 setXSatisfied(double value)
virtual ~CglTemporary()
Destructor.
This class chooses a variable to branch on.
Branching object for Special ordered sets.
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 ...
OsiChooseStrongSubset()
Default Constructor.
CoinModel coinModel_
Model in CoinModel format.
double * bestSolution_
Best solution found internally.
int numberPoints_
Number of points.
int firstLambda() const
First lambda (of 4)
double meshSize_
data Current increment for y points
virtual void resolve()
Resolve an LP relaxation after problem modification.
double defaultBound_
Default maximum bound.
This is a simple minded model which is stored in a format which makes it easier to construct and modi...
void addBiLinearObjects(OsiSolverLink *solver)
Add all bi-linear objects.
OsiBiLinearBranchingObject()
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
int * fixVariables_
list of fixed variables
int numberMembers() const
Number of members.
virtual OsiObject * clone() const
Clone.
int integerPriority_
Priority for integers.
virtual OsiBranchingObject * clone() const
Clone.
int * startNonLinear_
Starts of lists.
void setXYSatisfied(double value)
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
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...
int specialOptions2() const
Get special options.
int type_
Type of variable - 0 continuous, 1 integer.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
OsiLink & operator=(const OsiLink &rhs)
int xyRow() const
XY row.
Define a single integer class.
ClpSimplex * quadraticModel_
Copy of quadratic model if one.
void gutsOfCopy(const OsiSolverLink &rhs)
Do real work of copy.
virtual bool boundBranch() const
Return true if branch should only bound variables.
virtual int tightenBounds(int lightweight=0)
Tighten bounds - lightweight or very lightweight 0 - normal, 1 lightweight but just integers...
boundElementAction * affected_
Actions.
double bestObjectiveValue() const
Objective value of best solution found internally.
void setDefaultBound(double value)
Add a bound modifier.
CoinPackedMatrix * cleanMatrix() const
Clean copy of matrix So we can add rows.
int updateCoefficients(ClpSimplex *solver, CoinPackedMatrix *matrix)
Update coefficients - returns number updated if in updating mode.
virtual bool boundBranch() const
Return true if branch should only bound variables.
OsiBiLinearBranchingObject & operator=(const OsiBiLinearBranchingObject &rhs)
Define a class to add a bit of complexity to OsiObject This assumes 2 way branching.
int boundType() const
Simple quadratic bound marker.
Branching object for Linked ordered sets.
This is to allow the user to replace initialSolve and resolve.
Define Continuous BiLinear objects for an == bound.
double yOtherSatisfied() const
Y other satisfied if less than this away from mesh.
double xySatisfied() const
XY satisfied if two version differ by less than this.
OsiLinkBranchingObject & operator=(const OsiLinkBranchingObject &rhs)
Define Special Ordered Sets of type 1 and 2.
void setNumberPoints(int value)
virtual ~OsiBiLinearBranchingObject()
CoinPackedMatrix * quadraticRow(int rowNumber, double *linear) const
Gets correct form for a quadratic row - user to delete.
int numberLinks() const
Number of links for each member.
virtual void resetModel(CbcModel *model)
Resets stuff if model changes.
void load(CoinModel &modelObject, bool tightenBounds=false, int logLevel=1)
Default Constructor.
virtual OsiChooseVariable * clone() const
Clone.
heuristic - just picks up any good solution
OsiUsesBiLinear & operator=(const OsiUsesBiLinear &rhs)
Assignment operator.
virtual OsiObject * clone() const
Clone.
CoinPackedMatrix * matrix_
Clean copy of matrix Marked coefficients will be multiplied by L or U.
OsiLinkedBound & operator=(const OsiLinkedBound &rhs)
Assignment operator.
virtual bool boundBranch() const
Return true if branch should only bound variables.
int xColumn() const
X column.
int numberAffected_
Number of variables/elements affected.
List of bounds which depend on other bounds.
int * rowNonLinear_
Row number for a list.
double * nonlinearSLP(int numberPasses, double deltaTolerance)
Solves nonlinear problem from CoinModel using SLP - may be used as crash for other algorithms when nu...
int numberPoints() const
Number of points.
virtual double feasibleRegion(OsiSolverInterface *solver) const
For the variable(s) referenced by the object, look at the current solution and set bounds to match th...
OsiSolverLinearizedQuadratic()
Default Constructor.
double xMeshSize() const
X meshSize.
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...
Sparse Matrix Base Class.
double infeasibility() const
Return infeasibility.
OsiChooseStrongSubset & operator=(const OsiChooseStrongSubset &rhs)
Assignment operator.
void setBoundType(int value)
This is for codes where solver needs to know about CbcModel Seems to provide only one value-added fea...
void setBiLinearPriority(int value)
Set biLinear priority.
void setMeshSizes(const OsiSolverInterface *solver, double x, double y)
Set sizes and other stuff.
int numberBiLinear_
data Number of bilinear objects (maybe could be more general)
short chosen_
Which chosen -1 none, 0 x, 1 y.
int boundType_
Simple quadratic bound marker.
Collections of row cuts and column cuts.
Branching object for Linked ordered sets.
void addExtraRow(int row, double multiplier)
Adds in data for extra row with variable coefficients.
double xSatisfied() const
X satisfied if less than this away from mesh.
void setSpecialOptions2(int value)
Set special options.
int numberFix_
Number of variables which when fixed help.
void setCoefficient(double value)
Set coefficient.
const OsiObject * originalObject() const
Return pointer back to object which created.
int objectiveRow_
Objective transfer row if one.
int biLinearPriority() const
Get biLinear priority.
Define a single variable class which is involved with OsiBiLinear objects.
void newBounds(OsiSolverInterface *solver, int way, short xOrY, double separator) const
Does work of branching.
double xyBranchValue_
value of x or y to branch about
void setMeshSizes(double value)
Set all mesh sizes on x-x variables.
double xSatisfied_
x satisfied if less than this away from mesh
OsiSimpleFixedInteger & operator=(const OsiSimpleFixedInteger &rhs)
Assignment operator.
double bestObjectiveValue_
Objective value of best solution found internally.
ClpSimplex * quadraticModel() const
Copy of quadratic model if one.
void setXOtherSatisfied(double value)
virtual ~OsiBiLinearEquality()
virtual void initialSolve()
Solve initial LP relaxation.
virtual int solution(double &objectiveValue, double *newSolution)
returns 0 if no solution, 1 if valid solution.
CglTemporary & operator=(const CglTemporary &rhs)
Assignment operator.
Define data for one link.
virtual void initialSolve()
Solve initial LP relaxation.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
virtual ~OsiChooseStrongSubset()
Destructor.
double xOtherSatisfied_
X other satisfied if less than this away from mesh.
virtual ~OsiSolverLinearizedQuadratic()
Destructor.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
double defaultMeshSize() const
Default meshSize.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
void gutsOfDestructor()
The real work of a copy constructor (used by copy and assignment)
OsiOneLink & operator=(const OsiOneLink &rhs)
int way() const
Way returns -1 on down +1 on up.
int numberLinks_
Number of links.
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
virtual double branch()
Execute the actions required to branch, as specified by the current state of the branching object...
void setSpecialOptions3(int value)
Set special options.
int * convex_
Indicator whether is convex, concave or neither -1 concave, 0 neither, +1 convex. ...
OsiOldLinkBranchingObject & operator=(const OsiOldLinkBranchingObject &rhs)
virtual int setupList(OsiBranchingInformation *info, bool initialize)
Sets up strong list and clears all if initialize is true.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
Define a single integer class - but one where you keep branching until fixed even if satisfied...
Stored Temporary Cut Generator Class - destroyed after first use.
double bestObjectiveValue_
Objective value of best solution found internally.
std::string function_
Function.
void addBoundModifier(bool upperBoundAffected, bool useUpperBound, int whichVariable, int whichVariableAffected, double multiplier=1.0)
Add a bound modifier.
double yOtherSatisfied_
Y other satisfied if less than this away from mesh.
void sayConvex(bool convex)
Say convex (should work it out) - if convex false then strictly concave.
OsiSimpleFixedInteger()
Default Constructor.
virtual ~OsiSolverLink()
Destructor.
int firstLambda_
First lambda (of 4)
virtual double improvement(const OsiSolverInterface *solver) const
Possible improvement.
CoinPackedMatrix * originalRowCopy_
Row copy of matrix Just genuine columns and rows.
This class chooses a variable to branch on.
double bestObjectiveValue() const
Objective value of best solution found internally.
double * bestSolution_
Best solution found internally.
virtual OsiBranchingObject * clone() const
Clone.
void setBestSolution(const double *solution, int numberColumns)
Set best solution found internally.
double xOtherSatisfied() const
X other satisfied if less than this away from mesh.
int xColumn_
Column which defines x.
void setYMeshSize(double value)
OsiBiLinear & operator=(const OsiBiLinear &rhs)
virtual ~OsiSimpleFixedInteger()
Destructor.
const double * bestSolution() const
Best solution found internally.
int yColumn_
Column which defines y.
const CoinModel * coinModel() const
Return CoinModel.
OsiBiLinearEquality & operator=(const OsiBiLinearEquality &rhs)
int numberObjectsToUse() const
Number of objects to use.
int specialOptions3_
0 bit (1) - don't do mini B&B 1 bit (2) - quadratic only in objective
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current value.
int objectiveVariable() const
Objective transfer variable if one.
virtual CbcHeuristic * clone() const
Clone.
OsiSolverLinearizedQuadratic & operator=(const OsiSolverLinearizedQuadratic &rhs)
Assignment operator.
const double * weights() const
Array of weights.
This just adds two-wayness to a branching object.
Abstract Base Class for describing an interface to a solver.
This solves LPs using the simplex method.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
void getPseudoShadow(const OsiBranchingInformation *info)
Sets infeasibility and other when pseudo shadow prices.
ClpSimplex * quadraticModel() const
Copy of quadratic model if one.
double xyCoefficient(const double *solution) const
Returns true value of single xyRow coefficient.
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
Cut Generator Base Class.
virtual CglCutGenerator * clone() const
Clone.
int yRow_
y row (-1 if x*x)
void getCoefficients(const OsiSolverInterface *solver, double xB[2], double yB[2], double xybar[4]) const
Get LU coefficients from matrix.
double defaultBound() const
Default maximumbound.
virtual ~OsiUsesBiLinear()
Destructor.
int whichWay() const
Return current preferred way to branch.
int integerPriority() const
Get integer priority.
void setYSatisfied(double value)
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 ...
virtual OsiObject * clone() const
Clone.
double ySatisfied_
y satisfied if less than this away from mesh
int doAOCuts(CglTemporary *cutGen, const double *solution, const double *solution2)
Do OA cuts.
void setBiLinearPriorities(int value, double meshSize=1.0)
Set all biLinear priorities on x-x variables.
Define Special Linked Ordered Sets.
int yRow_
Row which defines y.
double coefficient() const
Coefficient.
void setBestObjectiveValue(double value)
Set objective value of best solution found internally.
virtual ~OsiOldLinkBranchingObject()
double linearizedBAB(CglStored *cut)
Solve linearized quadratic objective branch and bound.
virtual OsiObject * clone() const
Clone.
void setYOtherSatisfied(double value)
OsiSolverLink()
Default Constructor.
virtual OsiBranchingObject * clone() const
Clone.
double xySatisfied_
xy satisfied if less than this away from true
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
void setXMeshSize(double value)
void setDefaultMeshSize(double value)
Add a bound modifier.
double ySatisfied() const
Y satisfied if less than this away from mesh.
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 int fathom(bool allFixed)
Problem specific Returns -1 if node fathomed and no solution 0 if did nothing 1 if node fathomed and ...
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.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
double getMovement(const OsiBranchingInformation *info)
Gets sum of movements to correct value.
int biLinearPriority_
Priority for bilinear.
int convexity_
Convexity row.
int * extraRow_
Row number.
int specialOptions3() const
Get special options.
void updateBounds(ClpSimplex *solver)
Update other bounds.
void setIntegerPriority(int value)
Set integer priority.
const double * bestSolution() const
Best solution found internally.
virtual OsiObject * clone() const
Clone.
virtual OsiObject * clone() const
Clone.
void setBranchingStrategy(int value)
int numberLinks() const
Number of links for each member.
int numberNonLinearRows_
Number of rows with nonLinearities.
int * whichNonLinear_
Indices in a list/row.
OsiOldLinkBranchingObject()
Stored Cut Generator Class.
virtual ~OsiLinkBranchingObject()
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
double * heuristicSolution(int numberPasses, double deltaTolerance, int mode)
Solves nonlinear problem from CoinModel using SLP - and then tries to get heuristic solution Returns ...
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
CbcHeuristicDynamic3 & operator=(const CbcHeuristicDynamic3 &rhs)
Illegal Assignment operator.
int specialOptions2_
0 bit (1) - call fathom (may do mini B&B) 1 bit (2) - quadratic only in objective (add OA cuts) 2 bit...
This class chooses a variable to branch on.
double yMeshSize() const
Y meshSize.
virtual bool canDealWithOdd() const
Returns true if can deal with "odd" problems e.g. sos type 2.
void setNumberObjectsToUse(int value)
Set number of objects to use.
int variable() const
Get variable.
int yColumn() const
Y column.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
Information about where the cut generator is invoked from.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
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)
double defaultMeshSize_
Default mesh.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
Abstract base class for `objects'.
void analyzeObjects()
Analyze constraints to see which are convex (quadratic)
int updateCoefficients(const double *lower, const double *upper, double *objective, CoinPackedMatrix *matrix, CoinWarmStartBasis *basis) const
Updates coefficients - returns number updated.
OsiOldLink & operator=(const OsiOldLink &rhs)
OsiUsesBiLinear()
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 ...
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
OsiLinkedBound * info_
Information.
OsiSolverLink & operator=(const OsiSolverLink &rhs)
Assignment operator.
This is to allow the user to replace initialSolve and resolve This version changes coefficients...
virtual double checkInfeasibility(const OsiBranchingInformation *info) const
OsiObject ** objects_
Objects.
int numberVariables_
Number of variables in tightening phase.
int maximumAffected_
Maximum number of variables/elements affected.
Branching object for BiLinear objects.
ClpSimplex * approximateSolution(CoinModel &coinModel, int numberPasses, double deltaTolerance, int mode=0)
Return an approximate solution to a CoinModel.
OsiSolverInterface * model_
Pointer back to model.
int numberExtraRows_
Number of extra rows (coefficients to be modified)
void addTighterConstraints()
Add reformulated bilinear constraints.
int numberObjectsToUse_
Number of objects to be used (and set in solver)
The default COIN simplex (basis-oriented) warm start class.
ClpSimplex * quadraticModel_
Copy of quadratic model if one.
int objectiveVariable_
Objective transfer variable if one.
virtual void setModel(CbcModel *model)
update model
double * multiplier_
Multiplier for coefficient on row.
Simple Branch and bound class.
virtual void print(const OsiSolverInterface *=NULL) const
Print something about branch - only if log level high.
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
~OsiLinkedBound()
Destructor.
virtual bool boundBranch() const
Return true if branch should only bound variables.
CoinPackedMatrix * originalRowCopy() const
Row copy of matrix Just genuine columns and rows Linear part.
Abstract branching object base class.
void addBoundModifier(bool upperBoundAffected, bool useUpperBound, int whichVariable, double multiplier=1.0)
Add a bound modifier.
void setFixedPriority(int priorityValue)
Two tier integer problem where when set of variables with priority less than this are fixed the probl...
CglTemporary()
Default constructor.
OsiLinkedBound()
Default Constructor.
short chosen_
data 1 means branch on x, 2 branch on y