virtual double infeasibility(BcpsModel *m, int &preferredWay) const
Infeasibility.
BlisPseudocost pseudocost_
Pseudo cost.
A class for describing the objects that comprise a BCPS subproblem.
virtual void resetBounds(BcpsModel *m)
Reset original upper and lower bound values from the solver.
void setOriginalLowerBound(double value)
BlisPseudocost & pseudocost()
Access pseudocost.
virtual int columnIndex() const
Column number if single column object, otherwise.
BcpsBranchObject contains the member data required when choosing branching entities and excuting actu...
double originalUpperBound() const
virtual ~BlisObjectInt()
Destructor.
virtual BcpsObject * clone() const
Clone an object.
virtual BcpsBranchObject * createBranchObject(BcpsModel *m, int direction) const
Creates a branching object.
virtual void feasibleRegion(BcpsModel *m)
Set bounds to contain the current solution.
double breakEven_
Breakeven i.e.
double originalLowerBound() const
void setOriginalUpperBound(double value)
double breakEven() const
Breakeven e.g 0.7 -> >= 0.7 go up first.
BlisObjectInt()
Default Constructor.
double originalLower_
Original lower bound.
virtual BcpsBranchObject * preferredNewFeasible(BcpsModel *m) const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
virtual BcpsBranchObject * notPreferredNewFeasible(BcpsModel *m) const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
double originalUpper_
Original upper bound.
BlisObjectInt & operator=(const BlisObjectInt &rhs)
Assignment operator.
void setBreakEven(double value)
Set breakeven e.g 0.7 -> >= 0.7 go up first.
int columnIndex_
Column index in the lp model.