#include <BonminCbcNlpStrategy.hpp>
Inheritance diagram for BonminCbcNlpStrategy:
Public Member Functions | |
BonminCbcNlpStrategy (int maxFailures, int maxInfeasibles, int pretendFailIsInfeasible) | |
BonminCbcNlpStrategy (const BonminCbcNlpStrategy &) | |
virtual | ~BonminCbcNlpStrategy () |
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 () |
Protected Attributes | |
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. | |
Private Member Functions | |
BonminCbcNlpStrategy & | operator= (const BonminCbcNlpStrategy &rhs) |
Illegal Assignment operator. |
Definition at line 20 of file BonminCbcNlpStrategy.hpp.
BonminCbcNlpStrategy::BonminCbcNlpStrategy | ( | int | maxFailures, | |
int | maxInfeasibles, | |||
int | pretendFailIsInfeasible | |||
) |
BonminCbcNlpStrategy::BonminCbcNlpStrategy | ( | const BonminCbcNlpStrategy & | ) |
virtual BonminCbcNlpStrategy::~BonminCbcNlpStrategy | ( | ) | [virtual] |
virtual CbcStrategy* BonminCbcNlpStrategy::clone | ( | ) | const [virtual] |
virtual CbcNodeInfo* BonminCbcNlpStrategy::fullNodeInfo | ( | CbcModel * | model, | |
int | numberRowsAtContinuous | |||
) | const [virtual] |
Return a new Full node information pointer (descendant of CbcFullNodeInfo).
Reimplemented from CbcStrategy.
virtual CbcNodeInfo* BonminCbcNlpStrategy::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).
Reimplemented from CbcStrategy.
virtual int BonminCbcNlpStrategy::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
Reimplemented from CbcStrategy.
void BonminCbcNlpStrategy::setMaxFailure | ( | int | value | ) | [inline] |
set maximum number of consecutive failures in a branch before giving up
Definition at line 53 of file BonminCbcNlpStrategy.hpp.
References maxFailure_.
void BonminCbcNlpStrategy::setMaxInfeasible | ( | int | value | ) | [inline] |
maximum number of consecutive infeasible nodes before giving up
Definition at line 58 of file BonminCbcNlpStrategy.hpp.
References maxInfeasible_.
virtual void BonminCbcNlpStrategy::setupCutGenerators | ( | CbcModel & | model | ) | [virtual] |
virtual void BonminCbcNlpStrategy::setupHeuristics | ( | CbcModel & | model | ) | [virtual] |
virtual void BonminCbcNlpStrategy::setupPrinting | ( | CbcModel & | model, | |
int | modelLogLevel | |||
) | [virtual] |
virtual void BonminCbcNlpStrategy::setupOther | ( | CbcModel & | model | ) | [virtual] |
bool BonminCbcNlpStrategy::hasFailed | ( | ) | [inline] |
BonminCbcNlpStrategy& BonminCbcNlpStrategy::operator= | ( | const BonminCbcNlpStrategy & | rhs | ) | [private] |
Illegal Assignment operator.
bool BonminCbcNlpStrategy::hasFailed_ [protected] |
int BonminCbcNlpStrategy::maxFailure_ [protected] |
maximum number of consecutive failures in a branch before giving up
Definition at line 81 of file BonminCbcNlpStrategy.hpp.
Referenced by setMaxFailure().
int BonminCbcNlpStrategy::maxInfeasible_ [protected] |
maximum number of consecutive infeasible nodes before giving up
Definition at line 83 of file BonminCbcNlpStrategy.hpp.
Referenced by setMaxInfeasible().
int BonminCbcNlpStrategy::pretendFailIsInfeasible_ [protected] |
If yes when a problem is not solved (failed to be solved) will pretend that it is infeasible.
Definition at line 86 of file BonminCbcNlpStrategy.hpp.