Bonmin 1.8.9
Loading...
Searching...
No Matches
Bonmin::BabInfo Class Reference

Bonmin class for passing info between components of branch-and-cuts. More...

#include <BonBabInfos.hpp>

+ Inheritance diagram for Bonmin::BabInfo:
+ Collaboration diagram for Bonmin::BabInfo:

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 OsiAuxInfoclone () const
 Virtual copy constructor.
 
void setBabPtr (Bab *babPtr)
 Set pointer to the branch-and-bound algorithm (to access CbcModel).
 
BabbabPtr ()
 Pointer to the branch-and-bound algorithm (to access CbcModel).
 
bool hasSolution () const
 
- Public Member Functions inherited from Bonmin::AuxInfo
 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)
 
- Public Member Functions inherited from OsiBabSolver
 OsiBabSolver (int solverType=0)
 
 OsiBabSolver (const OsiBabSolver &rhs)
 
virtual ~OsiBabSolver ()
 
OsiBabSolveroperator= (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
 
- Public Member Functions inherited from OsiAuxInfo
 OsiAuxInfo (void *appData=NULL)
 
 OsiAuxInfo (const OsiAuxInfo &rhs)
 
virtual ~OsiAuxInfo ()
 
OsiAuxInfooperator= (const OsiAuxInfo &rhs)
 
void * getApplicationData () const
 

Protected Attributes

BabbabPtr_
 Pointer to branch-and-bound algorithm.
 
- Protected Attributes inherited from Bonmin::AuxInfo
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.
 
- Protected Attributes inherited from OsiBabSolver
double bestObjectiveValue_
 
double mipBound_
 
const OsiSolverInterfacesolver_
 
double * bestSolution_
 
const double * beforeLower_
 
const double * beforeUpper_
 
void * extraInfo_
 
int solverType_
 
int sizeSolution_
 
int extraCharacteristics_
 
- Protected Attributes inherited from OsiAuxInfo
void * appData_
 

Detailed Description

Bonmin class for passing info between components of branch-and-cuts.

Definition at line 19 of file BonBabInfos.hpp.

Constructor & Destructor Documentation

◆ BabInfo() [1/3]

Bonmin::BabInfo::BabInfo ( int type)

Default constructor.

◆ BabInfo() [2/3]

Bonmin::BabInfo::BabInfo ( const OsiBabSolver & other)

Constructor from OsiBabSolver.

◆ BabInfo() [3/3]

Bonmin::BabInfo::BabInfo ( const BabInfo & other)

Copy constructor.

◆ ~BabInfo()

virtual Bonmin::BabInfo::~BabInfo ( )
virtual

Destructor.

Member Function Documentation

◆ clone()

virtual OsiAuxInfo * Bonmin::BabInfo::clone ( ) const
virtual

Virtual copy constructor.

Reimplemented from Bonmin::AuxInfo.

◆ setBabPtr()

void Bonmin::BabInfo::setBabPtr ( Bab * babPtr)
inline

Set pointer to the branch-and-bound algorithm (to access CbcModel).

Definition at line 38 of file BonBabInfos.hpp.

◆ babPtr()

Bab * Bonmin::BabInfo::babPtr ( )
inline

Pointer to the branch-and-bound algorithm (to access CbcModel).

Definition at line 44 of file BonBabInfos.hpp.

◆ hasSolution()

bool Bonmin::BabInfo::hasSolution ( ) const
inline

Definition at line 49 of file BonBabInfos.hpp.

Member Data Documentation

◆ babPtr_

Bab* Bonmin::BabInfo::babPtr_
protected

Pointer to branch-and-bound algorithm.

Definition at line 53 of file BonBabInfos.hpp.


The documentation for this class was generated from the following file: