|
Cbc 2.10.13
|
Lotsize class. More...
#include <CbcBranchLotsize.hpp>
Public Member Functions | |
| CbcLotsize () | |
| CbcLotsize (CbcModel *model, int iColumn, int numberPoints, const double *points, bool range=false) | |
| CbcLotsize (const CbcLotsize &) | |
| virtual CbcObject * | clone () const |
| Clone. | |
| CbcLotsize & | operator= (const CbcLotsize &rhs) |
| ~CbcLotsize () | |
| virtual double | infeasibility (const OsiBranchingInformation *info, int &preferredWay) const |
| Infeasibility - large is 0.5. | |
| virtual void | feasibleRegion () |
| Set bounds to contain the current solution. | |
| virtual CbcBranchingObject * | createCbcBranch (OsiSolverInterface *solver, const OsiBranchingInformation *info, int way) |
| Creates a branching object. | |
| virtual CbcBranchingObject * | preferredNewFeasible () 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 CbcBranchingObject * | notPreferredNewFeasible () 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 (const OsiSolverInterface *solver) |
| Reset original upper and lower bound values from the solver. | |
| bool | findRange (double value) const |
| Finds range of interest so value is feasible in range range_ or infeasible between hi[range_] and lo[range_+1]. | |
| virtual void | floorCeiling (double &floorLotsize, double &ceilingLotsize, double value, double tolerance) const |
| Returns floor and ceiling. | |
| int | modelSequence () const |
| Model column number. | |
| void | setModelSequence (int value) |
| Set model column number. | |
| virtual int | columnNumber () const |
| Column number if single column object -1 otherwise, so returns >= 0 Used by heuristics. | |
| double | originalLowerBound () const |
| Original variable bounds. | |
| double | originalUpperBound () const |
| int | rangeType () const |
| Type - 1 points, 2 ranges. | |
| int | numberRanges () const |
| Number of points. | |
| double * | bound () const |
| Ranges. | |
| virtual bool | canDoHeuristics () const |
| Return true if object can take part in normal heuristics. | |
Protected Attributes | |
| int | columnNumber_ |
| data | |
| int | rangeType_ |
| Type - 1 points, 2 ranges. | |
| int | numberRanges_ |
| Number of points. | |
| double | largestGap_ |
| double * | bound_ |
| Ranges. | |
| int | range_ |
| Current range. | |
Private Member Functions | |
| void | printLotsize (double value, bool condition, int type) const |
| Just for debug (CBC_PRINT defined in CbcBranchLotsize.cpp). | |
Lotsize class.
Definition at line 12 of file CbcBranchLotsize.hpp.
| CbcLotsize::CbcLotsize | ( | ) |
| CbcLotsize::CbcLotsize | ( | CbcModel * | model, |
| int | iColumn, | ||
| int | numberPoints, | ||
| const double * | points, | ||
| bool | range = false ) |
| CbcLotsize::CbcLotsize | ( | const CbcLotsize & | ) |
| CbcLotsize::~CbcLotsize | ( | ) |
|
virtual |
Clone.
| CbcLotsize & CbcLotsize::operator= | ( | const CbcLotsize & | rhs | ) |
|
virtual |
Infeasibility - large is 0.5.
|
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.
|
virtual |
Creates a branching object.
|
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.
|
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.
|
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.
| bool CbcLotsize::findRange | ( | double | value | ) | const |
Finds range of interest so value is feasible in range range_ or infeasible between hi[range_] and lo[range_+1].
Returns true if feasible.
|
virtual |
Returns floor and ceiling.
|
inline |
Model column number.
Definition at line 95 of file CbcBranchLotsize.hpp.
|
inline |
Set model column number.
Definition at line 100 of file CbcBranchLotsize.hpp.
|
virtual |
Column number if single column object -1 otherwise, so returns >= 0 Used by heuristics.
|
inline |
Original variable bounds.
Definition at line 111 of file CbcBranchLotsize.hpp.
|
inline |
Definition at line 115 of file CbcBranchLotsize.hpp.
|
inline |
Type - 1 points, 2 ranges.
Definition at line 120 of file CbcBranchLotsize.hpp.
|
inline |
Number of points.
Definition at line 125 of file CbcBranchLotsize.hpp.
|
inline |
Ranges.
Definition at line 130 of file CbcBranchLotsize.hpp.
|
inlinevirtual |
Return true if object can take part in normal heuristics.
Definition at line 136 of file CbcBranchLotsize.hpp.
|
private |
Just for debug (CBC_PRINT defined in CbcBranchLotsize.cpp).
|
protected |
|
protected |
Type - 1 points, 2 ranges.
Definition at line 151 of file CbcBranchLotsize.hpp.
|
protected |
Number of points.
Definition at line 153 of file CbcBranchLotsize.hpp.
|
protected |
Definition at line 155 of file CbcBranchLotsize.hpp.
|
protected |
Ranges.
Definition at line 157 of file CbcBranchLotsize.hpp.
|
mutableprotected |
Current range.
Definition at line 159 of file CbcBranchLotsize.hpp.