Bonmin class for passing info between components of branch-and-cuts. More...
#include <BonBabInfos.hpp>
Public Member Functions | |
| BabInfo (int type) | |
| Default constructor. More... | |
| BabInfo (const OsiBabSolver &other) | |
| Constructor from OsiBabSolver. More... | |
| BabInfo (const BabInfo &other) | |
| Copy constructor. More... | |
| virtual | ~BabInfo () |
| Destructor. More... | |
| virtual OsiAuxInfo * | clone () const |
| Virtual copy constructor. More... | |
| void | setBabPtr (Bab *babPtr) |
| Set pointer to the branch-and-bound algorithm (to access CbcModel). More... | |
| Bab * | babPtr () |
| Pointer to the branch-and-bound algorithm (to access CbcModel). More... | |
| bool | hasSolution () const |
 Public Member Functions inherited from Bonmin::AuxInfo | |
| AuxInfo (int type) | |
| Default constructor. More... | |
| AuxInfo (const OsiBabSolver &other) | |
| Constructor from OsiBabSolver. More... | |
| AuxInfo (const AuxInfo &other) | |
| Copy constructor. More... | |
| virtual | ~AuxInfo () |
| Destructor. More... | |
| void | setFeasibleNode () |
| Declare the node to be feasible. More... | |
| void | setInfeasibleNode () |
| Declare the node to be infeasible. More... | |
| bool | infeasibleNode () |
| Say if current node is found feasible by cut generators. More... | |
| const double * | nlpSolution () |
| Get solution found by nlp solver (or NULL if none found). More... | |
| double | nlpObjValue () |
| Get objective value of nlp solution found, or +infinity if none exists. More... | |
| void | setNlpSolution (const double *sol, int numcols, double objValue) |
| Pass a solution found by an nlp solver. More... | |
| void | setHasNlpSolution (bool b) |
| Say if has an nlp solution. More... | |
| const std::vector< double > & | bestSolution2 () const |
| get the best solution computed with alternative objective function. More... | |
| double | bestObj2 () const |
| return objective value of the best solution computed with alternative objective function. More... | |
| void | setBestObj2 (double o) |
| Set an alternate objective value. More... | |
| void | setBestSolution2 (int n, double *d) |
Protected Attributes | |
| Bab * | babPtr_ |
| Pointer to branch-and-bound algorithm. More... | |
| Protected Attributes inherited from Bonmin::AuxInfo | |
| bool | infeasibleNode_ |
| Say if current node was found infeasible during cut generation. More... | |
| double | objValue_ |
| value of the objective function of this nlp solution More... | |
| double * | nlpSolution_ |
| nlp solution found by heuristic if any. More... | |
| int | numcols_ |
| numcols_ gives the size of nlpSolution_. More... | |
| bool | hasNlpSolution_ |
| say if has a solution. More... | |
| Coin::SmartPtr < SimpleReferenced < std::vector< double > > > | bestSolution2_ |
| Stores the solution with alternate objective. More... | |
| Coin::SmartPtr < SimpleReferenced< double > > | bestObj2_ |
| Alternate solution objective value. More... | |
Detailed Description
Bonmin class for passing info between components of branch-and-cuts.
Definition at line 19 of file BonBabInfos.hpp.
Constructor & Destructor Documentation
| Bonmin::BabInfo::BabInfo | ( | int | type | ) |
Default constructor.
| Bonmin::BabInfo::BabInfo | ( | const OsiBabSolver & | other | ) |
Constructor from OsiBabSolver.
| Bonmin::BabInfo::BabInfo | ( | const BabInfo & | other | ) |
Copy constructor.
|
virtual |
Destructor.
Member Function Documentation
|
virtual |
Virtual copy constructor.
Reimplemented from Bonmin::AuxInfo.
|
inline |
Set pointer to the branch-and-bound algorithm (to access CbcModel).
Definition at line 38 of file BonBabInfos.hpp.
|
inline |
Pointer to the branch-and-bound algorithm (to access CbcModel).
Definition at line 44 of file BonBabInfos.hpp.
References babPtr_.
Referenced by setBabPtr().
|
inline |
Definition at line 49 of file BonBabInfos.hpp.
Member Data Documentation
|
protected |
Pointer to branch-and-bound algorithm.
Definition at line 53 of file BonBabInfos.hpp.
Referenced by babPtr(), and setBabPtr().
The documentation for this class was generated from the following file:
