Base class for OA algorithms.
More...
#include <BonOaDecBase.hpp>
Base class for OA algorithms.
Definition at line 27 of file BonOaDecBase.hpp.
◆ OaDecompositionBase() [1/2]
Bonmin::OaDecompositionBase::OaDecompositionBase |
( |
BabSetupBase & | b, |
|
|
bool | leaveSiUnchanged, |
|
|
bool | reassignLpsolver ) |
◆ OaDecompositionBase() [2/2]
◆ ~OaDecompositionBase()
virtual Bonmin::OaDecompositionBase::~OaDecompositionBase |
( |
| ) |
|
|
virtual |
◆ generateCuts()
◆ assignNlpInterface()
◆ assignLpInterface()
◆ reassignLpsolver()
bool Bonmin::OaDecompositionBase::reassignLpsolver |
( |
| ) |
|
|
inline |
◆ setObjects()
void Bonmin::OaDecompositionBase::setObjects |
( |
OsiObject ** | objects, |
|
|
int | nObjects ) |
|
inline |
◆ setLeaveSiUnchanged()
void Bonmin::OaDecompositionBase::setLeaveSiUnchanged |
( |
bool | yesno | ) |
|
|
inline |
Set whether to leave the solverinterface unchanged.
Definition at line 140 of file BonOaDecBase.hpp.
◆ parameter() [1/2]
Parameters & Bonmin::OaDecompositionBase::parameter |
( |
| ) |
|
|
inline |
◆ parameter() [2/2]
const Parameters & Bonmin::OaDecompositionBase::parameter |
( |
| ) |
const |
|
inline |
◆ setLogLevel()
void Bonmin::OaDecompositionBase::setLogLevel |
( |
int | level | ) |
|
|
inline |
◆ setReassignLpSolver()
void Bonmin::OaDecompositionBase::setReassignLpSolver |
( |
bool | v | ) |
|
|
inline |
◆ passInMessageHandler()
◆ setupMipSolver()
void Bonmin::OaDecompositionBase::setupMipSolver |
( |
BabSetupBase & | b, |
|
|
const std::string & | prefix ) |
|
protected |
◆ post_nlp_solve()
bool Bonmin::OaDecompositionBase::post_nlp_solve |
( |
BabInfo * | babInfo, |
|
|
double | cutoff ) const |
|
protected |
Solve the nlp and do output.
- Returns
- true if feasible
◆ performOa()
◆ doLocalSearch()
virtual bool Bonmin::OaDecompositionBase::doLocalSearch |
( |
BabInfo * | babInfo | ) |
const |
|
protectedpure virtual |
◆ nlp_
◆ s_
◆ nSolve_
int Bonmin::OaDecompositionBase::nSolve_ |
|
mutableprotected |
◆ lp_
◆ objects_
OsiObject* * Bonmin::OaDecompositionBase::objects_ |
|
protected |
Some objects the feasiblitiy of which to verify.
Definition at line 246 of file BonOaDecBase.hpp.
◆ nObjects_
int Bonmin::OaDecompositionBase::nObjects_ |
|
protected |
◆ nLocalSearch_
int Bonmin::OaDecompositionBase::nLocalSearch_ |
|
mutableprotected |
◆ handler_
◆ messages_
◆ leaveSiUnchanged_
bool Bonmin::OaDecompositionBase::leaveSiUnchanged_ |
|
protected |
Wether or not we should remove cuts at the end of the procedure.
Definition at line 256 of file BonOaDecBase.hpp.
◆ reassignLpsolver_
bool Bonmin::OaDecompositionBase::reassignLpsolver_ |
|
protected |
Do we need to reassign the lp solver with Cbc.
Definition at line 258 of file BonOaDecBase.hpp.
◆ timeBegin_
double Bonmin::OaDecompositionBase::timeBegin_ |
|
protected |
◆ numSols_
int Bonmin::OaDecompositionBase::numSols_ |
|
mutableprotected |
number of solutions found by OA_decomposition.
Definition at line 262 of file BonOaDecBase.hpp.
◆ parameters_
Parameters Bonmin::OaDecompositionBase::parameters_ |
|
protected |
◆ savedCuts_
OsiCuts Bonmin::OaDecompositionBase::savedCuts_ |
|
mutableprotected |
Saved cuts: in some cases when using OA to check feasible solution algorithm may loop because Cbc removes inactive cuts.
To overcome this we can impose that no OA cut can be discarded by Cbc but this consumes too much memory in some cases. Here we do it another way: cuts generated at current node are saved if algorithm seems to enter a loop we impose the needed cuts to be kept.
Definition at line 270 of file BonOaDecBase.hpp.
◆ currentNodeNumber_
int Bonmin::OaDecompositionBase::currentNodeNumber_ |
|
mutableprotected |
The documentation for this class was generated from the following file:
- /builddir/build/BUILD/Bonmin-releases-1.8.9/Bonmin/src/Algorithms/OaGenerators/BonOaDecBase.hpp