#include <BlisObjectInt.h>
|
| BlisObjectInt () |
|
| BlisObjectInt (int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5) |
| Useful constructor - passed integer index and model index.
|
|
virtual | ~BlisObjectInt () |
| Destructor.
|
|
| BlisObjectInt (const BlisObjectInt &) |
| Copy constructor.
|
|
virtual BcpsObject * | clone () const |
| Clone an object.
|
|
BlisObjectInt & | operator= (const BlisObjectInt &rhs) |
| Assignment operator.
|
|
virtual double | infeasibility (BcpsModel *m, int &preferredWay) const |
| Infeasibility.
|
|
virtual void | feasibleRegion (BcpsModel *m) |
| Set bounds to contain the current solution.
|
|
virtual BcpsBranchObject * | createBranchObject (BcpsModel *m, int direction) const |
| Creates a branching object.
|
|
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.
|
|
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.
|
|
virtual void | resetBounds (BcpsModel *m) |
| Reset original upper and lower bound values from the solver.
|
|
virtual int | columnIndex () const |
| Column number if single column object, otherwise.
|
|
|
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.
|
|
void | setBreakEven (double value) |
| Set breakeven e.g 0.7 -> >= 0.7 go up first.
|
|
BlisPseudocost & | pseudocost () |
| Access pseudocost.
|
|
Definition at line 37 of file BlisObjectInt.h.
◆ BlisObjectInt() [1/3]
BlisObjectInt::BlisObjectInt |
( |
| ) |
|
|
inline |
◆ BlisObjectInt() [2/3]
BlisObjectInt::BlisObjectInt |
( |
int | objectIndex, |
|
|
int | iColumn, |
|
|
double | lb, |
|
|
double | ub, |
|
|
double | breakEven = 0.5 ) |
Useful constructor - passed integer index and model index.
◆ ~BlisObjectInt()
virtual BlisObjectInt::~BlisObjectInt |
( |
| ) |
|
|
inlinevirtual |
◆ BlisObjectInt() [3/3]
◆ clone()
virtual BcpsObject * BlisObjectInt::clone |
( |
| ) |
const |
|
inlinevirtual |
◆ operator=()
◆ infeasibility()
virtual double BlisObjectInt::infeasibility |
( |
BcpsModel * | m, |
|
|
int & | preferredWay ) const |
|
virtual |
Infeasibility.
Range is [0.0, 0.5].
- Parameters
-
PreferredWay | the direction close to an integer. |
◆ feasibleRegion()
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.
◆ createBranchObject()
virtual BcpsBranchObject * BlisObjectInt::createBranchObject |
( |
BcpsModel * | m, |
|
|
int | direction ) const |
|
virtual |
Creates a branching object.
◆ preferredNewFeasible()
virtual BcpsBranchObject * BlisObjectInt::preferredNewFeasible |
( |
BcpsModel * | m | ) |
const |
|
virtual |
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.
◆ notPreferredNewFeasible()
virtual BcpsBranchObject * BlisObjectInt::notPreferredNewFeasible |
( |
BcpsModel * | m | ) |
const |
|
virtual |
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in a bad direction.
As for preferredNewFeasible(), but the preferred branching object will force movement in a direction that degrades the objective.
◆ resetBounds()
virtual void BlisObjectInt::resetBounds |
( |
BcpsModel * | m | ) |
|
|
virtual |
Reset original upper and lower bound values from the solver.
Handy for updating bounds held in this object after bounds held in the solver have been tightened.
◆ columnIndex()
virtual int BlisObjectInt::columnIndex |
( |
| ) |
const |
|
inlinevirtual |
Column number if single column object, otherwise.
Definition at line 129 of file BlisObjectInt.h.
◆ originalLowerBound()
double BlisObjectInt::originalLowerBound |
( |
| ) |
const |
|
inline |
◆ setOriginalLowerBound()
void BlisObjectInt::setOriginalLowerBound |
( |
double | value | ) |
|
|
inline |
◆ originalUpperBound()
double BlisObjectInt::originalUpperBound |
( |
| ) |
const |
|
inline |
◆ setOriginalUpperBound()
void BlisObjectInt::setOriginalUpperBound |
( |
double | value | ) |
|
|
inline |
◆ breakEven()
double BlisObjectInt::breakEven |
( |
| ) |
const |
|
inline |
◆ setBreakEven()
void BlisObjectInt::setBreakEven |
( |
double | value | ) |
|
|
inline |
Set breakeven e.g 0.7 -> >= 0.7 go up first.
Definition at line 143 of file BlisObjectInt.h.
◆ pseudocost()
◆ columnIndex_
int BlisObjectInt::columnIndex_ |
|
protected |
◆ originalLower_
double BlisObjectInt::originalLower_ |
|
protected |
◆ originalUpper_
double BlisObjectInt::originalUpper_ |
|
protected |
◆ breakEven_
double BlisObjectInt::breakEven_ |
|
protected |
Breakeven i.e.
>= this preferred is up.
Definition at line 51 of file BlisObjectInt.h.
◆ pseudocost_
The documentation for this class was generated from the following file: