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