|
| BlisObjectInt () |
| Default Constructor. More...
|
|
| BlisObjectInt (int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5) |
| Useful constructor - passed integer index and model index. More...
|
|
virtual | ~BlisObjectInt () |
| Destructor. More...
|
|
| BlisObjectInt (const BlisObjectInt &) |
| Copy constructor. More...
|
|
virtual BcpsObject * | clone () const |
| Clone an object. More...
|
|
BlisObjectInt & | operator= (const BlisObjectInt &rhs) |
| Assignment operator. More...
|
|
virtual double | infeasibility (BcpsModel *m, int &preferredWay) const |
| Infeasibility. More...
|
|
virtual void | feasibleRegion (BcpsModel *m) |
| Set bounds to contain the current solution. More...
|
|
virtual BcpsBranchObject * | createBranchObject (BcpsModel *m, int direction) const |
| Creates a branching object. More...
|
|
virtual BcpsBranchObject * | preferredNewFeasible (BcpsModel *m) const |
| Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in the good direction. More...
|
|
virtual BcpsBranchObject * | notPreferredNewFeasible (BcpsModel *m) const |
| Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in a bad direction. More...
|
|
virtual void | resetBounds (BcpsModel *m) |
| Reset original upper and lower bound values from the solver. More...
|
|
virtual int | columnIndex () const |
| Column number if single column object, otherwise. More...
|
|
|
double | originalLowerBound () const |
|
void | setOriginalLowerBound (double value) |
|
double | originalUpperBound () const |
|
void | setOriginalUpperBound (double value) |
|
double | breakEven () const |
| Breakeven e.g 0.7 -> >= 0.7 go up first. More...
|
|
void | setBreakEven (double value) |
| Set breakeven e.g 0.7 -> >= 0.7 go up first. More...
|
|
BlisPseudocost & | pseudocost () |
| Access pseudocost. More...
|
|
| BcpsObject () |
|
| BcpsObject (double lbh, double ubh, double lbs, double ubs) |
|
virtual | ~BcpsObject () |
|
| BcpsObject (const BcpsObject &rhs) |
|
BcpsObject & | operator= (const BcpsObject &rhs) |
|
virtual BcpsObject * | clone () const |
|
virtual double | infeasibility (BcpsModel *m, int &preferredWay) const |
|
virtual void | feasibleRegion (BcpsModel *m) |
|
virtual BcpsBranchObject * | createBranchObject (BcpsModel *m, int way) const |
|
virtual BcpsBranchObject * | preferredNewFeasible (BcpsModel *m) const |
|
virtual BcpsBranchObject * | notPreferredNewFeasible (BcpsModel *m) const |
|
virtual void | resetBounds (BcpsModel *m) |
|
virtual bool | boundBranch (BcpsModel *m) const |
|
virtual void | floorCeiling (double &floorValue, double &ceilingValue, double value, double tolerance) const |
|
virtual double | upEstimate () const |
|
virtual double | downEstimate () const |
|
virtual void | printDesc () |
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
|
virtual AlpsKnowledge * | decode (AlpsEncoded &encoded) const |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
|
int | getObjectIndex () const |
|
BcpsObjRep_t | getRepType () const |
|
BcpsIntegral_t | getIntType () const |
|
BcpsValidRegion | getValidRegion () const |
|
int | getStatus () const |
|
double | getLbHard () const |
|
double | getUbHard () const |
|
double | getLbSoft () const |
|
double | getUbSoft () const |
|
int | getNumInactive () const |
|
double | getEffectiveness () const |
|
void | setObjectIndex (int ind) |
|
void | setRepType (BcpsObjRep_t rt) |
|
void | setIntType (BcpsIntegral_t it) |
|
void | setValidRegion (BcpsValidRegion val) |
|
void | setStatus (int st) |
|
void | setLbHard (double lb) |
|
void | setUbHard (double ub) |
|
void | setLbSoft (double lb) |
|
void | setUbSoft (double ub) |
|
void | setNumInactive (int num) |
|
void | setEffectiveness (double eff) |
|
virtual void | hashing (BcpsModel *model=NULL) |
|
double | hashValue () const |
|
int | getObjectIndex () const |
|
BcpsObjRep_t | getRepType () const |
|
BcpsIntegral_t | getIntType () const |
|
BcpsValidRegion | getValidRegion () const |
|
int | getStatus () const |
|
double | getLbHard () const |
|
double | getUbHard () const |
|
double | getLbSoft () const |
|
double | getUbSoft () const |
|
int | getNumInactive () const |
|
double | getEffectiveness () const |
|
void | setObjectIndex (int ind) |
|
void | setRepType (BcpsObjRep_t rt) |
|
void | setIntType (BcpsIntegral_t it) |
|
void | setValidRegion (BcpsValidRegion val) |
|
void | setStatus (int st) |
|
void | setLbHard (double lb) |
|
void | setUbHard (double ub) |
|
void | setLbSoft (double lb) |
|
void | setUbSoft (double ub) |
|
void | setNumInactive (int num) |
|
void | setEffectiveness (double eff) |
|
virtual void | hashing (BcpsModel *model=NULL) |
|
double | hashValue () const |
|
| AlpsKnowledge () |
|
virtual | ~AlpsKnowledge () |
|
KnowledgeType | getType () |
|
void | setType (KnowledgeType t) |
|
virtual AlpsEncoded * | encode () const |
|
virtual AlpsReturnStatus | encode (AlpsEncoded *encoded) |
|
virtual AlpsKnowledge * | decode (AlpsEncoded &encoded) const |
|
AlpsEncoded * | getEncoded () const |
|
void | setEncoded (AlpsEncoded *e) |
|
Definition at line 36 of file BlisObjectInt.h.
virtual void BlisObjectInt::feasibleRegion |
( |
BcpsModel * |
m | ) |
|
|
virtual |
Set bounds to contain the current solution.
More precisely, for the variable associated with this object, take the value given in the current solution, force it within the current bounds if required, then set the bounds to fix the variable at the integer nearest the solution value.
Reimplemented from BcpsObject.
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in the good direction.
The preferred branching object will force the variable to be +/-1 from its current value, depending on the reduced cost and objective sense. If movement in the direction which improves the objective is impossible due to bounds on the variable, the branching object will move in the other direction. If no movement is possible, the method returns NULL.
Only the bounds on this variable are considered when determining if the new point is feasible.
Reimplemented from BcpsObject.