|
Bonmin
1.7
|
Bonmin class for passing info between components of branch-and-cuts. More...
#include <BonAuxInfos.hpp>
Public Member Functions | |
| AuxInfo (int type) | |
| Default constructor. | |
| AuxInfo (const OsiBabSolver &other) | |
| Constructor from OsiBabSolver. | |
| AuxInfo (const AuxInfo &other) | |
| Copy constructor. | |
| virtual | ~AuxInfo () |
| Destructor. | |
| virtual OsiAuxInfo * | clone () const |
| Virtual copy constructor. | |
| 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) |
Protected Attributes | |
| 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. | |
Bonmin class for passing info between components of branch-and-cuts.
Definition at line 23 of file BonAuxInfos.hpp.
| Bonmin::AuxInfo::AuxInfo | ( | int | type | ) |
Default constructor.
| Bonmin::AuxInfo::AuxInfo | ( | const OsiBabSolver & | other | ) |
Constructor from OsiBabSolver.
| Bonmin::AuxInfo::AuxInfo | ( | const AuxInfo & | other | ) |
Copy constructor.
| virtual Bonmin::AuxInfo::~AuxInfo | ( | ) | [virtual] |
Destructor.
| virtual OsiAuxInfo* Bonmin::AuxInfo::clone | ( | ) | const [virtual] |
Virtual copy constructor.
Reimplemented in Bonmin::BabInfo.
| void Bonmin::AuxInfo::setFeasibleNode | ( | ) | [inline] |
Declare the node to be feasible.
Definition at line 41 of file BonAuxInfos.hpp.
References infeasibleNode_.
| void Bonmin::AuxInfo::setInfeasibleNode | ( | ) | [inline] |
Declare the node to be infeasible.
Definition at line 45 of file BonAuxInfos.hpp.
References infeasibleNode_.
| bool Bonmin::AuxInfo::infeasibleNode | ( | ) | [inline] |
Say if current node is found feasible by cut generators.
Definition at line 49 of file BonAuxInfos.hpp.
References infeasibleNode_.
| const double* Bonmin::AuxInfo::nlpSolution | ( | ) | [inline] |
Get solution found by nlp solver (or NULL if none found).
Definition at line 53 of file BonAuxInfos.hpp.
References hasNlpSolution_, and nlpSolution_.
| double Bonmin::AuxInfo::nlpObjValue | ( | ) |
Get objective value of nlp solution found, or +infinity if none exists.
| void Bonmin::AuxInfo::setNlpSolution | ( | const double * | sol, |
| int | numcols, | ||
| double | objValue | ||
| ) |
Pass a solution found by an nlp solver.
| void Bonmin::AuxInfo::setHasNlpSolution | ( | bool | b | ) | [inline] |
Say if has an nlp solution.
Definition at line 68 of file BonAuxInfos.hpp.
References hasNlpSolution_.
| const std::vector<double>& Bonmin::AuxInfo::bestSolution2 | ( | ) | const [inline] |
get the best solution computed with alternative objective function.
Definition at line 71 of file BonAuxInfos.hpp.
References bestSolution2_.
| double Bonmin::AuxInfo::bestObj2 | ( | ) | const [inline] |
return objective value of the best solution computed with alternative objective function.
Definition at line 77 of file BonAuxInfos.hpp.
References bestObj2_.
| void Bonmin::AuxInfo::setBestObj2 | ( | double | o | ) | [inline] |
Set an alternate objective value.
Definition at line 82 of file BonAuxInfos.hpp.
| void Bonmin::AuxInfo::setBestSolution2 | ( | int | n, |
| double * | d | ||
| ) | [inline] |
Definition at line 86 of file BonAuxInfos.hpp.
References bestSolution2_.
bool Bonmin::AuxInfo::infeasibleNode_ [protected] |
Say if current node was found infeasible during cut generation.
Definition at line 93 of file BonAuxInfos.hpp.
Referenced by infeasibleNode(), setFeasibleNode(), and setInfeasibleNode().
double Bonmin::AuxInfo::objValue_ [protected] |
value of the objective function of this nlp solution
Definition at line 95 of file BonAuxInfos.hpp.
double* Bonmin::AuxInfo::nlpSolution_ [protected] |
nlp solution found by heuristic if any.
Definition at line 97 of file BonAuxInfos.hpp.
Referenced by nlpSolution().
int Bonmin::AuxInfo::numcols_ [protected] |
numcols_ gives the size of nlpSolution_.
Definition at line 99 of file BonAuxInfos.hpp.
bool Bonmin::AuxInfo::hasNlpSolution_ [protected] |
say if has a solution.
Definition at line 101 of file BonAuxInfos.hpp.
Referenced by nlpSolution(), and setHasNlpSolution().
Coin::SmartPtr< SimpleReferenced<std::vector<double> > > Bonmin::AuxInfo::bestSolution2_ [protected] |
Stores the solution with alternate objective.
Definition at line 103 of file BonAuxInfos.hpp.
Referenced by bestSolution2(), and setBestSolution2().
Coin::SmartPtr< SimpleReferenced<double> > Bonmin::AuxInfo::bestObj2_ [protected] |
Alternate solution objective value.
Definition at line 105 of file BonAuxInfos.hpp.
Referenced by bestObj2().
1.7.5.1