virtual BcpsObject * clone() const
Clone an object.
void setOriginalUpperBound(double value)
double originalLower_
Original lower bound.
double originalUpperBound() const
BlisPseudocost & pseudocost()
Access pseudocost.
double originalUpper_
Original upper bound.
double originalLowerBound() const
double breakEven_
Breakeven i.e.
double breakEven() const
Breakeven e.g 0.7 -> >= 0.7 go up first.
virtual BcpsBranchObject * notPreferredNewFeasible(BcpsModel *m) const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
virtual int columnIndex() const
Column number if single column object, otherwise.
BlisObjectInt & operator=(const BlisObjectInt &rhs)
Assignment operator.
BlisObjectInt()
Default Constructor.
virtual ~BlisObjectInt()
Destructor.
BlisObjectInt(int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5)
Useful constructor - passed integer index and model index.
virtual BcpsBranchObject * createBranchObject(BcpsModel *m, int direction) const
Creates a branching object.
BlisPseudocost pseudocost_
Pseudo cost.
void setOriginalLowerBound(double value)
BlisObjectInt(const BlisObjectInt &)
Copy constructor.
void setBreakEven(double value)
Set breakeven e.g 0.7 -> >= 0.7 go up first.
virtual void resetBounds(BcpsModel *m)
Reset original upper and lower bound values from the solver.
virtual double infeasibility(BcpsModel *m, int &preferredWay) const
Infeasibility.
virtual BcpsBranchObject * preferredNewFeasible(BcpsModel *m) const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
int columnIndex_
Column index in the lp model.
virtual void feasibleRegion(BcpsModel *m)
Set bounds to contain the current solution.