Bonmin 1.8.9
|
Bonmin class for passing info between components of branch-and-cuts. More...
#include <BonBabInfos.hpp>
Public Member Functions | |
BabInfo (int type) | |
Default constructor. | |
BabInfo (const OsiBabSolver &other) | |
Constructor from OsiBabSolver. | |
BabInfo (const BabInfo &other) | |
Copy constructor. | |
virtual | ~BabInfo () |
Destructor. | |
virtual OsiAuxInfo * | clone () const |
Virtual copy constructor. | |
void | setBabPtr (Bab *babPtr) |
Set pointer to the branch-and-bound algorithm (to access CbcModel). | |
Bab * | babPtr () |
Pointer to the branch-and-bound algorithm (to access CbcModel). | |
bool | hasSolution () const |
![]() | |
AuxInfo (int type) | |
Default constructor. | |
AuxInfo (const OsiBabSolver &other) | |
Constructor from OsiBabSolver. | |
AuxInfo (const AuxInfo &other) | |
Copy constructor. | |
virtual | ~AuxInfo () |
Destructor. | |
void | setFeasibleNode () |
Declare the node to be feasible. | |
void | setInfeasibleNode () |
Declare the node to be infeasible. | |
bool | infeasibleNode () |
Say if current node is found feasible by cut generators. | |
const double * | nlpSolution () |
Get solution found by nlp solver (or NULL if none found). | |
double | nlpObjValue () |
Get objective value of nlp solution found, or +infinity if none exists. | |
void | setNlpSolution (const double *sol, int numcols, double objValue) |
Pass a solution found by an nlp solver. | |
void | setHasNlpSolution (bool b) |
Say if has an nlp solution. | |
const std::vector< double > & | bestSolution2 () const |
get the best solution computed with alternative objective function. | |
double | bestObj2 () const |
return objective value of the best solution computed with alternative objective function. | |
void | setBestObj2 (double o) |
Set an alternate objective value. | |
void | setBestSolution2 (int n, double *d) |
![]() | |
OsiBabSolver (int solverType=0) | |
OsiBabSolver (const OsiBabSolver &rhs) | |
virtual | ~OsiBabSolver () |
OsiBabSolver & | operator= (const OsiBabSolver &rhs) |
void | setSolver (const OsiSolverInterface *solver) |
void | setSolver (const OsiSolverInterface &solver) |
int | solution (double &objectiveValue, double *newSolution, int numberColumns) |
void | setSolution (const double *solution, int numberColumns, double objectiveValue) |
bool | hasSolution (double &solutionValue, double *solution) |
void | setSolverType (int value) |
int | solverType () const |
bool | solutionAddsCuts () const |
bool | alwaysTryCutsAtRootNode () const |
bool | solverAccurate () const |
bool | reducedCostsAccurate () const |
double | mipBound () const |
bool | mipFeasible () const |
void | setMipBound (double value) |
double | bestObjectiveValue () const |
bool | tryCuts () const |
bool | warmStart () const |
int | extraCharacteristics () const |
void | setExtraCharacteristics (int value) |
const double * | beforeLower () const |
void | setBeforeLower (const double *array) |
const double * | beforeUpper () const |
void | setBeforeUpper (const double *array) |
void | setExtraPointer (void *extraInfo) |
void * | getExtraPointer () const |
![]() | |
OsiAuxInfo (void *appData=NULL) | |
OsiAuxInfo (const OsiAuxInfo &rhs) | |
virtual | ~OsiAuxInfo () |
OsiAuxInfo & | operator= (const OsiAuxInfo &rhs) |
void * | getApplicationData () const |
Protected Attributes | |
Bab * | babPtr_ |
Pointer to branch-and-bound algorithm. | |
![]() | |
bool | infeasibleNode_ |
Say if current node was found infeasible during cut generation. | |
double | objValue_ |
value of the objective function of this nlp solution | |
double * | nlpSolution_ |
nlp solution found by heuristic if any. | |
int | numcols_ |
numcols_ gives the size of nlpSolution_. | |
bool | hasNlpSolution_ |
say if has a solution. | |
Coin::SmartPtr< SimpleReferenced< std::vector< double > > > | bestSolution2_ |
Stores the solution with alternate objective. | |
Coin::SmartPtr< SimpleReferenced< double > > | bestObj2_ |
Alternate solution objective value. | |
![]() | |
double | bestObjectiveValue_ |
double | mipBound_ |
const OsiSolverInterface * | solver_ |
double * | bestSolution_ |
const double * | beforeLower_ |
const double * | beforeUpper_ |
void * | extraInfo_ |
int | solverType_ |
int | sizeSolution_ |
int | extraCharacteristics_ |
![]() | |
void * | appData_ |
Bonmin class for passing info between components of branch-and-cuts.
Definition at line 19 of file BonBabInfos.hpp.
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.
|
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.
|
inline |
Definition at line 49 of file BonBabInfos.hpp.
|
protected |
Pointer to branch-and-bound algorithm.
Definition at line 53 of file BonBabInfos.hpp.