#include <BonCbcNlpStrategy.hpp>
|
| CbcNlpStrategy (int maxFailures, int maxInfeasibles, int pretendFailIsInfeasible) |
|
| CbcNlpStrategy (const CbcNlpStrategy &) |
|
virtual | ~CbcNlpStrategy () |
|
virtual CbcStrategy * | clone () const |
| Clone.
|
|
virtual CbcNodeInfo * | fullNodeInfo (CbcModel *model, int numberRowsAtContinuous) const |
| Return a new Full node information pointer (descendant of CbcFullNodeInfo)
|
|
virtual CbcNodeInfo * | partialNodeInfo (CbcModel *model, CbcNodeInfo *parent, CbcNode *owner, int numberChangedBounds, const int *variables, const double *boundChanges, const CoinWarmStartDiff *basisDiff) const |
| Return a new Partial node information pointer (descendant of CbcPartialNodeInfo)
|
|
virtual int | status (CbcModel *model, CbcNodeInfo *parent, int whereFrom) |
| After a CbcModel::resolve this can return a status -1 no effect 0 treat as optimal 1 as 0 but do not do any more resolves (i.e.
|
|
void | setMaxFailure (int value) |
| set maximum number of consecutive failures in a branch before giving up
|
|
void | setMaxInfeasible (int value) |
| maximum number of consecutive infeasible nodes before giving up
|
|
virtual void | setupCutGenerators (CbcModel &model) |
| Setup cut generators.
|
|
virtual void | setupHeuristics (CbcModel &model) |
| Setup heuristics.
|
|
virtual void | setupPrinting (CbcModel &model, int modelLogLevel) |
| Do printing stuff.
|
|
virtual void | setupOther (CbcModel &model) |
| Other stuff e.g. strong branching and preprocessing.
|
|
bool | hasFailed () |
|
|
bool | hasFailed_ |
| did we fail?
|
|
int | maxFailure_ |
| maximum number of consecutive failures in a branch before giving up
|
|
int | maxInfeasible_ |
| maximum number of consecutive infeasible nodes before giving up
|
|
int | pretendFailIsInfeasible_ |
| If yes when a problem is not solved (failed to be solved) will pretend that it is infeasible.
|
|
Definition at line 23 of file BonCbcNlpStrategy.hpp.
◆ CbcNlpStrategy() [1/2]
Bonmin::CbcNlpStrategy::CbcNlpStrategy |
( |
int | maxFailures, |
|
|
int | maxInfeasibles, |
|
|
int | pretendFailIsInfeasible ) |
◆ CbcNlpStrategy() [2/2]
◆ ~CbcNlpStrategy()
virtual Bonmin::CbcNlpStrategy::~CbcNlpStrategy |
( |
| ) |
|
|
virtual |
◆ clone()
virtual CbcStrategy * Bonmin::CbcNlpStrategy::clone |
( |
| ) |
const |
|
virtual |
◆ fullNodeInfo()
virtual CbcNodeInfo * Bonmin::CbcNlpStrategy::fullNodeInfo |
( |
CbcModel * | model, |
|
|
int | numberRowsAtContinuous ) const |
|
virtual |
Return a new Full node information pointer (descendant of CbcFullNodeInfo)
◆ partialNodeInfo()
virtual CbcNodeInfo * Bonmin::CbcNlpStrategy::partialNodeInfo |
( |
CbcModel * | model, |
|
|
CbcNodeInfo * | parent, |
|
|
CbcNode * | owner, |
|
|
int | numberChangedBounds, |
|
|
const int * | variables, |
|
|
const double * | boundChanges, |
|
|
const CoinWarmStartDiff * | basisDiff ) const |
|
virtual |
Return a new Partial node information pointer (descendant of CbcPartialNodeInfo)
◆ status()
virtual int Bonmin::CbcNlpStrategy::status |
( |
CbcModel * | model, |
|
|
CbcNodeInfo * | parent, |
|
|
int | whereFrom ) |
|
virtual |
After a CbcModel::resolve this can return a status -1 no effect 0 treat as optimal 1 as 0 but do not do any more resolves (i.e.
no more cuts) 2 treat as infeasible
◆ setMaxFailure()
void Bonmin::CbcNlpStrategy::setMaxFailure |
( |
int | value | ) |
|
|
inline |
set maximum number of consecutive failures in a branch before giving up
Definition at line 56 of file BonCbcNlpStrategy.hpp.
◆ setMaxInfeasible()
void Bonmin::CbcNlpStrategy::setMaxInfeasible |
( |
int | value | ) |
|
|
inline |
maximum number of consecutive infeasible nodes before giving up
Definition at line 61 of file BonCbcNlpStrategy.hpp.
◆ setupCutGenerators()
virtual void Bonmin::CbcNlpStrategy::setupCutGenerators |
( |
CbcModel & | model | ) |
|
|
virtual |
◆ setupHeuristics()
virtual void Bonmin::CbcNlpStrategy::setupHeuristics |
( |
CbcModel & | model | ) |
|
|
virtual |
◆ setupPrinting()
virtual void Bonmin::CbcNlpStrategy::setupPrinting |
( |
CbcModel & | model, |
|
|
int | modelLogLevel ) |
|
virtual |
◆ setupOther()
virtual void Bonmin::CbcNlpStrategy::setupOther |
( |
CbcModel & | model | ) |
|
|
virtual |
Other stuff e.g. strong branching and preprocessing.
◆ hasFailed()
bool Bonmin::CbcNlpStrategy::hasFailed |
( |
| ) |
|
|
inline |
◆ hasFailed_
bool Bonmin::CbcNlpStrategy::hasFailed_ |
|
protected |
◆ maxFailure_
int Bonmin::CbcNlpStrategy::maxFailure_ |
|
protected |
maximum number of consecutive failures in a branch before giving up
Definition at line 84 of file BonCbcNlpStrategy.hpp.
◆ maxInfeasible_
int Bonmin::CbcNlpStrategy::maxInfeasible_ |
|
protected |
maximum number of consecutive infeasible nodes before giving up
Definition at line 86 of file BonCbcNlpStrategy.hpp.
◆ pretendFailIsInfeasible_
int Bonmin::CbcNlpStrategy::pretendFailIsInfeasible_ |
|
protected |
If yes when a problem is not solved (failed to be solved) will pretend that it is infeasible.
Definition at line 89 of file BonCbcNlpStrategy.hpp.
The documentation for this class was generated from the following file: