Go to the documentation of this file.
13 #include "CoinModel.hpp"
14 #include "OsiClpSolverInterface.hpp"
15 #include "OsiChooseVariable.hpp"
18 class CoinPackedMatrix;
48 virtual int fathom(
bool allFixed);
55 double *
nonlinearSLP(
int numberPasses,
double deltaTolerance);
93 void load(CoinModel &modelObject,
bool tightenBounds =
false,
int logLevel = 1);
95 virtual OsiSolverInterface *
clone(
bool copyData =
true)
const;
110 void addBoundModifier(
bool upperBoundAffected,
bool useUpperBound,
int whichVariable,
int whichVariableAffected,
112 double multiplier = 1.0);
169 CoinPackedMatrix *
quadraticRow(
int rowNumber,
double *linear)
const;
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);
377 OsiSolverInterface *
model_;
425 virtual int solution(
double &objectiveValue,
426 double *newSolution);
440 #include "OsiBranchingObject.hpp"
445 class CoinWarmStartBasis;
459 OsiOldLink(
const OsiSolverInterface *solver,
int numberMembers,
461 const double *weights,
int setNumber);
468 OsiOldLink(
const OsiSolverInterface *solver,
int numberMembers,
470 const double *weights,
int setNumber);
476 virtual OsiObject *
clone()
const;
484 using OsiObject::infeasibility;
486 virtual double infeasibility(
const OsiBranchingInformation *info,
int &whichWay)
const;
488 using OsiObject::feasibleRegion;
494 virtual double feasibleRegion(OsiSolverInterface *solver,
const OsiBranchingInformation *info)
const;
500 virtual OsiBranchingObject *
createBranch(OsiSolverInterface *solver,
const OsiBranchingInformation *info,
int way)
const;
503 virtual void resetSequenceEtc(
int numberColumns,
const int *originalColumns);
551 virtual OsiBranchingObject *
clone()
const;
556 using OsiBranchingObject::branch;
558 virtual double branch(OsiSolverInterface *solver);
560 using OsiBranchingObject::print;
563 virtual void print(
const OsiSolverInterface *solver = NULL);
581 OsiOneLink(
const OsiSolverInterface *solver,
int xRow,
int xColumn,
int xyRow,
582 const char *functionString);
621 OsiLink(
const OsiSolverInterface *solver,
int yRow,
622 int yColumn,
double meshSize);
628 virtual OsiObject *
clone()
const;
636 using OsiObject::infeasibility;
638 virtual double infeasibility(
const OsiBranchingInformation *info,
int &whichWay)
const;
640 using OsiObject::feasibleRegion;
646 virtual double feasibleRegion(OsiSolverInterface *solver,
const OsiBranchingInformation *info)
const;
652 virtual OsiBranchingObject *
createBranch(OsiSolverInterface *solver,
const OsiBranchingInformation *info,
int way)
const;
655 virtual void resetSequenceEtc(
int numberColumns,
const int *originalColumns);
710 virtual OsiBranchingObject *
clone()
const;
715 using OsiBranchingObject::branch;
717 virtual double branch(OsiSolverInterface *solver);
719 using OsiBranchingObject::print;
722 virtual void print(
const OsiSolverInterface *solver = NULL);
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);
763 virtual OsiObject *
clone()
const;
771 using OsiObject::infeasibility;
773 virtual double infeasibility(
const OsiBranchingInformation *info,
int &whichWay)
const;
775 using OsiObject::feasibleRegion;
781 virtual double feasibleRegion(OsiSolverInterface *solver,
const OsiBranchingInformation *info)
const;
787 virtual OsiBranchingObject *
createBranch(OsiSolverInterface *solver,
const OsiBranchingInformation *info,
int way)
const;
790 virtual void resetSequenceEtc(
int numberColumns,
const int *originalColumns);
911 void setMeshSizes(
const OsiSolverInterface *solver,
double x,
double y);
946 void newBounds(OsiSolverInterface *solver,
int way,
short xOrY,
double separator)
const;
949 CoinPackedMatrix *matrix, CoinWarmStartBasis *basis)
const;
953 void getCoefficients(
const OsiSolverInterface *solver,
double xB[2],
double yB[2],
double xybar[4])
const;
955 double computeLambdas(
const double xB[3],
const double yB[3],
const double xybar[4],
double lambda[4])
const;
961 double getMovement(
const OsiBranchingInformation *info);
965 void computeLambdas(
const OsiSolverInterface *solver,
double lambda[4])
const;
1040 double separator,
int chosen);
1049 virtual OsiBranchingObject *
clone()
const;
1054 using OsiBranchingObject::branch;
1056 virtual double branch(OsiSolverInterface *solver);
1058 using OsiBranchingObject::print;
1061 virtual void print(
const OsiSolverInterface *solver = NULL);
1096 virtual OsiObject *
clone()
const;
1105 virtual double improvement(
const OsiSolverInterface *solver)
const;
1111 double newGrid(OsiSolverInterface *solver,
int type)
const;
1147 virtual OsiObject *
clone()
const;
1155 using OsiObject::infeasibility;
1157 virtual double infeasibility(
const OsiBranchingInformation *info,
int &whichWay)
const;
1163 virtual OsiBranchingObject *
createBranch(OsiSolverInterface *solver,
const OsiBranchingInformation *info,
int way)
const;
1183 OsiUsesBiLinear(
const OsiSolverInterface *solver,
int iColumn,
int type);
1195 virtual OsiObject *
clone()
const;
1203 using OsiObject::infeasibility;
1205 virtual double infeasibility(
const OsiBranchingInformation *info,
int &whichWay)
const;
1211 virtual OsiBranchingObject *
createBranch(OsiSolverInterface *solver,
const OsiBranchingInformation *info,
int way)
const;
1213 using OsiObject::feasibleRegion;
1219 virtual double feasibleRegion(OsiSolverInterface *solver,
const OsiBranchingInformation *info)
const;
1256 virtual OsiChooseVariable *
clone()
const;
1265 virtual int setupList(OsiBranchingInformation *info,
bool initialize);
1279 virtual int chooseVariable(OsiSolverInterface *solver, OsiBranchingInformation *info,
bool fixVariables);
1300 #include "CglStored.hpp"
1302 class CoinWarmStartBasis;
1317 virtual void generateCuts(
const OsiSolverInterface &si, OsiCuts &cs,
1318 const CglTreeInfo info = CglTreeInfo());
1330 virtual CglCutGenerator *
clone()
const;
1369 virtual OsiSolverInterface *
clone(
bool copyData =
true)
const;
1438 int numberPasses,
double deltaTolerance,
double bestObjectiveValue() const
Objective value of best solution found internally.
virtual void setModel(CbcModel *model)
update model
int objectiveRow_
Objective transfer row if one.
ClpSimplex * approximateSolution(CoinModel &coinModel, int numberPasses, double deltaTolerance, int mode=0)
Return an approximate solution to a CoinModel.
double ySatisfied_
y satisfied if less than this away from mesh
void addBiLinearObjects(OsiSolverLink *solver)
Add all bi-linear objects.
int xColumn() const
X column.
OsiChooseStrongSubset & operator=(const OsiChooseStrongSubset &rhs)
Assignment operator.
int * fixVariables_
list of fixed variables
void setMeshSizes(const OsiSolverInterface *solver, double x, double y)
Set sizes and other stuff.
List of bounds which depend on other bounds.
void setSpecialOptions3(int value)
Set special options.
double * bestSolution_
Best solution found internally.
int variable() const
Get variable.
Define data for one link.
virtual ~OsiBiLinearBranchingObject()
double * multiplier_
Multiplier for coefficient on row.
void setBoundType(int value)
OsiSimpleFixedInteger & operator=(const OsiSimpleFixedInteger &rhs)
Assignment operator.
int maximumAffected_
Maximum number of variables/elements affected.
virtual double improvement(const OsiSolverInterface *solver) const
Possible improvement.
CglTemporary & operator=(const CglTemporary &rhs)
Assignment operator.
OsiBiLinearEquality & operator=(const OsiBiLinearEquality &rhs)
virtual double infeasibility(const OsiBranchingInformation *info, int &whichWay) const
Infeasibility - large is 0.5.
virtual void initialSolve()
Solve initial LP relaxation.
virtual OsiBranchingObject * clone() const
Clone.
int yRow_
y row (-1 if x*x)
OsiSolverLink()
Default Constructor.
double yMeshSize() const
Y meshSize.
int firstLambda_
First lambda (of 4)
short chosen_
data 1 means branch on x, 2 branch on y
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)
Branching object for Linked ordered sets.
double xOtherSatisfied() const
X other satisfied if less than this away from mesh.
int specialOptions3() const
Get special options.
virtual void resetModel(CbcModel *model)
Resets stuff if model changes.
OsiSolverInterface * model_
Pointer back to model.
virtual double infeasibility(const OsiBranchingInformation *info, int &whichWay) const
Infeasibility - large is 0.5.
void getPseudoShadow(const OsiBranchingInformation *info)
Sets infeasibility and other when pseudo shadow prices.
virtual OsiBranchingObject * clone() const
Clone.
double xySatisfied() const
XY satisfied if two version differ by less than this.
void setYMeshSize(double value)
Define a single integer class - but one where you keep branching until fixed even if satisfied.
Define Special Linked Ordered Sets.
void setXMeshSize(double value)
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
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...
void sayConvex(bool convex)
Say convex (should work it out) - if convex false then strictly concave.
void setBranchingStrategy(int value)
virtual ~OsiSimpleFixedInteger()
Destructor.
virtual void resolve()
Resolve an LP relaxation after problem modification.
void newBounds(OsiSolverInterface *solver, int way, short xOrY, double separator) const
Does work of branching.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
void setXOtherSatisfied(double value)
int specialOptions2_
0 bit (1) - call fathom (may do mini B&B) 1 bit (2) - quadratic only in objective (add OA cuts) 2 bit...
void setBiLinearPriority(int value)
Set biLinear priority.
Define Continuous BiLinear objects for an == bound.
int objectiveVariable_
Objective transfer variable if one.
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
virtual ~CglTemporary()
Destructor.
void setDefaultMeshSize(double value)
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
int numberFix_
Number of variables which when fixed help.
double bestObjectiveValue() const
Objective value of best solution found internally.
const double * bestSolution() const
Best solution found internally.
int * startNonLinear_
Starts of lists.
CoinPackedMatrix * originalRowCopy() const
Row copy of matrix Just genuine columns and rows Linear part.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
int numberObjectsToUse() const
Number of objects to use.
int doAOCuts(CglTemporary *cutGen, const double *solution, const double *solution2)
Do OA cuts.
double defaultMeshSize() const
Default meshSize.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current value.
virtual double feasibleRegion(OsiSolverInterface *solver, const OsiBranchingInformation *info) const
Set bounds to fix the variable at the current (integer) value.
ClpSimplex * quadraticModel_
Copy of quadratic model if one.
~OsiLinkedBound()
Destructor.
double xOtherSatisfied_
X other satisfied if less than this away from mesh.
int numberLinks_
Number of links.
int numberLinks() const
Number of links for each member.
OsiOneLink & operator=(const OsiOneLink &rhs)
virtual ~OsiOldLinkBranchingObject()
This class chooses a variable to branch on.
ClpSimplex * quadraticModel() const
Copy of quadratic model if one.
double yOtherSatisfied_
Y other satisfied if less than this away from mesh.
int numberObjectsToUse_
Number of objects to be used (and set in solver)
int * whichNonLinear_
Indices in a list/row.
virtual double infeasibility(const OsiBranchingInformation *info, int &whichWay) const
Infeasibility - large is 0.5.
void addExtraRow(int row, double multiplier)
Adds in data for extra row with variable coefficients.
double bestObjectiveValue_
Objective value of best solution found internally.
virtual OsiObject * clone() const
Clone.
virtual ~OsiSolverLink()
Destructor.
int objectiveVariable() const
Objective transfer variable if one.
int numberNonLinearRows_
Number of rows with nonLinearities.
int xColumn_
Column which defines x.
OsiSimpleFixedInteger()
Default Constructor.
OsiBiLinear & operator=(const OsiBiLinear &rhs)
OsiUsesBiLinear & operator=(const OsiUsesBiLinear &rhs)
Assignment operator.
virtual OsiObject * clone() const
Clone.
void setXYSatisfied(double value)
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
virtual OsiObject * clone() const
Clone.
double xySatisfied_
xy satisfied if less than this away from true
short chosen_
Which chosen -1 none, 0 x, 1 y.
void setBiLinearPriorities(int value, double meshSize=1.0)
Set all biLinear priorities on x-x variables.
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 ...
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
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
Simple Branch and bound class.
virtual double infeasibility(const OsiBranchingInformation *info, int &whichWay) const
Infeasibility - large is 0.5.
virtual ~OsiChooseStrongSubset()
Destructor.
virtual CbcHeuristic * clone() const
Clone.
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
OsiBiLinearBranchingObject()
OsiLinkedBound()
Default Constructor.
const CoinModel * coinModel() const
Return CoinModel.
virtual bool boundBranch() const
Return true if branch should only bound variables.
int * rowNonLinear_
Row number for a list.
int branchingStrategy_
branching strategy etc bottom 2 bits 0 branch on either, 1 branch on x, 2 branch on y next bit 4 set ...
Stored Temporary Cut Generator Class - destroyed after first use.
double linearizedBAB(CglStored *cut)
Solve linearized quadratic objective branch and bound.
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 * convex_
Indicator whether is convex, concave or neither -1 concave, 0 neither, +1 convex.
virtual int fathom(bool allFixed)
Problem specific Returns -1 if node fathomed and no solution 0 if did nothing 1 if node fathomed and ...
ClpSimplex * quadraticModel_
Copy of quadratic model if one.
double defaultBound_
Default maximum bound.
int biLinearPriority_
Priority for bilinear.
void setYOtherSatisfied(double value)
virtual bool boundBranch() const
Return true if branch should only bound variables.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
virtual bool canDealWithOdd() const
Returns true if can deal with "odd" problems e.g. sos type 2.
void getCoefficients(const OsiSolverInterface *solver, double xB[2], double yB[2], double xybar[4]) const
Get LU coefficients from matrix.
void setFixedPriority(int priorityValue)
Two tier integer problem where when set of variables with priority less than this are fixed the probl...
int integerPriority() const
Get integer priority.
void setBestSolution(const double *solution, int numberColumns)
Set best solution found internally.
double getMovement(const OsiBranchingInformation *info)
Gets sum of movements to correct value.
virtual void print(const OsiSolverInterface *solver=NULL)
Print something about branch - only if log level high.
void updateBounds(ClpSimplex *solver)
Update other bounds.
void load(CoinModel &modelObject, bool tightenBounds=false, int logLevel=1)
void setBestObjectiveValue(double value)
Set objective value of best solution found internally.
CoinPackedMatrix * cleanMatrix() const
Clean copy of matrix So we can add rows.
virtual ~OsiUsesBiLinear()
Destructor.
int numberVariables_
Number of variables in tightening phase.
double xyBranchValue_
value of x or y to branch about
virtual void initialSolve()
Solve initial LP relaxation.
int integerPriority_
Priority for integers.
virtual OsiObject * clone() const
Clone.
OsiSolverLinearizedQuadratic()
Default Constructor.
OsiObject ** objects_
Objects.
void addBoundModifier(bool upperBoundAffected, bool useUpperBound, int whichVariable, int whichVariableAffected, double multiplier=1.0)
Add a bound modifier.
This is to allow the user to replace initialSolve and resolve This version changes coefficients.
Branching object for BiLinear objects.
CglTemporary()
Default constructor.
int biLinearPriority() const
Get biLinear priority.
OsiLink & operator=(const OsiLink &rhs)
virtual int solution(double &objectiveValue, double *newSolution)
returns 0 if no solution, 1 if valid solution.
void analyzeObjects()
Analyze constraints to see which are convex (quadratic)
virtual double branch(OsiSolverInterface *solver)
Does next branch and updates state.
int numberPoints() const
Number of points.
int specialOptions2() const
Get special options.
OsiLinkedBound * info_
Information.
void setXSatisfied(double value)
OsiOldLinkBranchingObject & operator=(const OsiOldLinkBranchingObject &rhs)
int numberAffected_
Number of variables/elements affected.
void setIntegerPriority(int value)
Set integer priority.
ClpSimplex * quadraticModel() const
Copy of quadratic model if one.
double coefficient() const
Coefficient.
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...
double xSatisfied_
x satisfied if less than this away from mesh
OsiLinkBranchingObject & operator=(const OsiLinkBranchingObject &rhs)
double ySatisfied() const
Y satisfied if less than this away from mesh.
This is for codes where solver needs to know about CbcModel Seems to provide only one value-added fea...
int type_
Type of variable - 0 continuous, 1 integer.
virtual OsiObject * clone() const
Clone.
int yColumn() const
Y column.
void setNumberPoints(int value)
virtual CglCutGenerator * clone() const
Clone.
OsiLinkedBound & operator=(const OsiLinkedBound &rhs)
Assignment operator.
int updateCoefficients(const double *lower, const double *upper, double *objective, CoinPackedMatrix *matrix, CoinWarmStartBasis *basis) const
Updates coefficients - returns number updated.
double xMeshSize() const
X meshSize.
void setSpecialOptions2(int value)
Set special options.
int numberExtraRows_
Number of extra rows (coefficients to be modified)
OsiUsesBiLinear()
Default Constructor.
double xyCoefficient(const double *solution) const
Returns true value of single xyRow coefficient.
double * bestSolution_
Best solution found internally.
void gutsOfCopy(const OsiSolverLink &rhs)
Do real work of copy.
OsiBiLinearBranchingObject & operator=(const OsiBiLinearBranchingObject &rhs)
boundElementAction * affected_
Actions.
int yColumn_
Column which defines y.
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
double defaultMeshSize_
Default mesh.
virtual OsiObject * clone() const
Clone.
CoinPackedMatrix * originalRowCopy_
Row copy of matrix Just genuine columns and rows.
double defaultBound() const
Default maximumbound.
int updateCoefficients(ClpSimplex *solver, CoinPackedMatrix *matrix)
Update coefficients - returns number updated if in updating mode.
CbcHeuristicDynamic3 & operator=(const CbcHeuristicDynamic3 &rhs)
Illegal Assignment operator.
int numberLinks() const
Number of links for each member.
CoinModel coinModel_
Model in CoinModel format.
int boundType_
Simple quadratic bound marker.
void setCoefficient(double value)
Set coefficient.
virtual OsiBranchingObject * clone() const
Clone.
virtual double branch(OsiSolverInterface *solver)
Does next branch and updates state.
OsiOldLinkBranchingObject()
int yRow_
Row which defines y.
void setYSatisfied(double value)
int firstLambda() const
First lambda (of 4)
virtual double infeasibility(const OsiBranchingInformation *info, int &whichWay) const
Infeasibility - large is 0.5.
virtual ~OsiBiLinearEquality()
virtual double branch(OsiSolverInterface *solver)
Does next branch and updates state.
std::string function_
Function.
double * heuristicSolution(int numberPasses, double deltaTolerance, int mode)
Solves nonlinear problem from CoinModel using SLP - and then tries to get heuristic solution Returns ...
void addTighterConstraints()
Add reformulated bilinear constraints.
Branching object for Linked ordered sets.
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.
double * nonlinearSLP(int numberPasses, double deltaTolerance)
Solves nonlinear problem from CoinModel using SLP - may be used as crash for other algorithms when nu...
Define a single variable class which is involved with OsiBiLinear objects.
const double * bestSolution() const
Best solution found internally.
CoinPackedMatrix * quadraticRow(int rowNumber, double *linear) const
Gets correct form for a quadratic row - user to delete.
void gutsOfDestructor(bool justNullify=false)
Do real work of initialize.
virtual ~OsiSolverLinearizedQuadratic()
Destructor.
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
virtual ~OsiLinkBranchingObject()
int specialOptions3_
0 bit (1) - don't do mini B&B 1 bit (2) - quadratic only in objective
void setNumberObjectsToUse(int value)
Set number of objects to use.
int numberBiLinear_
data Number of bilinear objects (maybe could be more general)
CoinPackedMatrix * matrix_
Clean copy of matrix Marked coefficients will be multiplied by L or U.
int * extraRow_
Row number.
double bestObjectiveValue_
Objective value of best solution found internally.
virtual void resetSequenceEtc(int numberColumns, const int *originalColumns)
Redoes data when sequence numbers change.
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 bool boundBranch() const
Return true if branch should only bound variables.
void setDefaultBound(double value)
virtual OsiBranchingObject * createBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) const
Creates a branching object.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
heuristic - just picks up any good solution
virtual bool boundBranch() const
Return true if branch should only bound variables.
void setMeshSizes(double value)
Set all mesh sizes on x-x variables.
This is to allow the user to replace initialSolve and resolve.
double meshSize_
data Current increment for y points
OsiSolverLinearizedQuadratic & operator=(const OsiSolverLinearizedQuadratic &rhs)
Assignment operator.
double xSatisfied() const
X satisfied if less than this away from mesh.
virtual double checkInfeasibility(const OsiBranchingInformation *info) const
int numberPoints_
Number of points.
OsiOldLink & operator=(const OsiOldLink &rhs)
OsiChooseStrongSubset()
Default Constructor.
int boundType() const
Simple quadratic bound marker.
OsiSolverLink & operator=(const OsiSolverLink &rhs)
Assignment operator.
int convexity_
Convexity row.
virtual int setupList(OsiBranchingInformation *info, bool initialize)
Sets up strong list and clears all if initialize is true.
void addBoundModifier(bool upperBoundAffected, bool useUpperBound, int whichVariable, double multiplier=1.0)
Add a bound modifier.
virtual OsiChooseVariable * clone() const
Clone.
double yOtherSatisfied() const
Y other satisfied if less than this away from mesh.