6 #ifndef CbcBranchLotsize_H
7 #define CbcBranchLotsize_H
22 int numberPoints,
const double *points,
bool range =
false);
91 virtual void floorCeiling(
double &floorLotsize,
double &ceilingLotsize,
double value,
92 double tolerance)
const;
195 double lowerValue,
double upperValue);
Abstract branching object base class Now just difference with OsiBranchingObject.
CbcModel * model() const
Return model.
virtual double branch()=0
Execute the actions required to branch, as specified by the current state of the branching object,...
int variable() const
Index identifying the associated CbcObject within its class.
int way() const
Get the state of the branching object.
virtual void print() const
Print something about branch - only if log level high.
Lotsize branching object.
virtual void print()
Print something about branch - only if log level high.
CbcLotsizeBranchingObject()
Default constructor.
double up_[2]
Lower [0] and upper [1] bounds for the up arm (way_ = 1)
virtual CbcBranchingObject * clone() const
Clone.
CbcLotsizeBranchingObject(const CbcLotsizeBranchingObject &)
Copy constructor.
CbcLotsizeBranchingObject & operator=(const CbcLotsizeBranchingObject &rhs)
Assignment operator.
CbcLotsizeBranchingObject(CbcModel *model, int variable, int way, double lowerValue, double upperValue)
Create a degenerate branch object.
double down_[2]
Lower [0] and upper [1] bounds for the down arm (way_ = -1)
CbcLotsizeBranchingObject(CbcModel *model, int variable, int way, double value, const CbcLotsize *lotsize)
Create a lotsize floor/ceiling branch object.
virtual ~CbcLotsizeBranchingObject()
Destructor.
virtual double branch()
Sets the bounds for the variable according to the current arm of the branch and advances the object s...
virtual CbcBranchObjType type() const
Return the type (an integer identifier) of this.
virtual CbcRangeCompare compareBranchingObject(const CbcBranchingObject *brObj, const bool replaceIfOverlap=false)
Compare the this with brObj.
CbcLotsize(CbcModel *model, int iColumn, int numberPoints, const double *points, bool range=false)
void printLotsize(double value, bool condition, int type) const
Just for debug (CBC_PRINT defined in CbcBranchLotsize.cpp)
virtual CbcBranchingObject * preferredNewFeasible() const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
virtual CbcBranchingObject * createCbcBranch(OsiSolverInterface *solver, const OsiBranchingInformation *info, int way)
Creates a branching object.
double originalLowerBound() const
Original variable bounds.
virtual double infeasibility(const OsiBranchingInformation *info, int &preferredWay) const
Infeasibility - large is 0.5.
virtual CbcBranchingObject * notPreferredNewFeasible() const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
int rangeType_
Type - 1 points, 2 ranges.
CbcLotsize(const CbcLotsize &)
int numberRanges() const
Number of points.
double * bound() const
Ranges.
double originalUpperBound() const
virtual int columnNumber() const
Column number if single column object -1 otherwise, so returns >= 0 Used by heuristics.
virtual CbcObject * clone() const
Clone.
int rangeType() const
Type - 1 points, 2 ranges.
virtual void floorCeiling(double &floorLotsize, double &ceilingLotsize, double value, double tolerance) const
Returns floor and ceiling.
void setModelSequence(int value)
Set model column number.
bool findRange(double value) const
Finds range of interest so value is feasible in range range_ or infeasible between hi[range_] and lo[...
int numberRanges_
Number of points.
virtual bool canDoHeuristics() const
Return true if object can take part in normal heuristics.
virtual void resetBounds(const OsiSolverInterface *solver)
Reset original upper and lower bound values from the solver.
int modelSequence() const
Model column number.
virtual void feasibleRegion()
Set bounds to contain the current solution.
CbcLotsize & operator=(const CbcLotsize &rhs)
Simple Branch and bound class.
CbcModel * model() const
Return model.
virtual void feasibleRegion()=0
For the variable(s) referenced by the object, look at the current solution and set bounds to match th...
int preferredWay() const
If -1 down always chosen first, +1 up always, 0 normal.