Bonmin  1.7
Classes | Public Member Functions | Protected Member Functions
Bonmin::OaDecompositionBase Class Reference

Base class for OA algorithms. More...

#include <BonOaDecBase.hpp>

Inheritance diagram for Bonmin::OaDecompositionBase:
Bonmin::EcpCuts Bonmin::MinlpFeasPump Bonmin::OACutGenerator2 Bonmin::OaFeasibilityChecker

List of all members.

Classes

struct  Parameters
 Parameters for algorithm. More...
class  solverManip
 Small class to manipulatee various things in an OsiSolverInterface and restore them. More...

Public Member Functions

 OaDecompositionBase (BabSetupBase &b, bool leaveSiUnchanged, bool reassignLpsolver)
 New usefull constructor.
 OaDecompositionBase (const OaDecompositionBase &copy)
 Copy constructor.
virtual ~OaDecompositionBase ()
 Destructor.
virtual void generateCuts (const OsiSolverInterface &si, OsiCuts &cs, const CglTreeInfo info=CglTreeInfo())
 Standard cut generation methods.
void assignNlpInterface (OsiTMINLPInterface *nlp)
 Assign an OsiTMINLPInterface.
void assignLpInterface (OsiSolverInterface *si)
 Assign an OsiTMINLPInterface.
bool reassignLpsolver ()
void setObjects (OsiObject **objects, int nObjects)
 Set objects.
void setLeaveSiUnchanged (bool yesno)
 Set whether to leave the solverinterface unchanged.
Parametersparameter ()
const Parametersparameter () const
void setLogLevel (int level)
void setReassignLpSolver (bool v)
void passInMessageHandler (CoinMessageHandler *handler)

Protected Member Functions

void setupMipSolver (BabSetupBase &b, const std::string &prefix)
virtual double performOa (OsiCuts &cs, solverManip &lpManip, BabInfo *babInfo, double &, const CglTreeInfo &info) const =0
 virtual method which performs the OA algorithm by modifying lp and nlp.
virtual bool doLocalSearch (BabInfo *babInfo) const =0
 virutal method to decide if local search is performed
Protected helper functions
bool post_nlp_solve (BabInfo *babInfo, double cutoff) const
 Solve the nlp and do output.

Protected Attributes

Protected members
OsiTMINLPInterfacenlp_
 Pointer to nlp interface.
BabSetupBases_
 Pointer to setup.
int nSolve_
 Number of nlp solved done.
OsiSolverInterface * lp_
 A linear solver.
OsiObject ** objects_
 Some objects the feasiblitiy of which to verify.
int nObjects_
 Number of objects.*/.
int nLocalSearch_
 number of local searches performed
CoinMessageHandler * handler_
 messages handler.
CoinMessages messages_
 Messages for OA.
bool leaveSiUnchanged_
 Wether or not we should remove cuts at the end of the procedure.
bool reassignLpsolver_
 Do we need to reassign the lp solver with Cbc.
double timeBegin_
 time of construction
int numSols_
 number of solutions found by OA_decomposition.
Parameters parameters_
 Parameters.
OsiCuts savedCuts_
 Saved cuts: in some cases when using OA to check feasible solution algorithm may loop because Cbc removes inactive cuts.
int currentNodeNumber_
 Store the current node number.

Detailed Description

Base class for OA algorithms.

Definition at line 27 of file BonOaDecBase.hpp.


Constructor & Destructor Documentation

Bonmin::OaDecompositionBase::OaDecompositionBase ( BabSetupBase b,
bool  leaveSiUnchanged,
bool  reassignLpsolver 
)

New usefull constructor.

Bonmin::OaDecompositionBase::OaDecompositionBase ( const OaDecompositionBase copy)

Copy constructor.

virtual Bonmin::OaDecompositionBase::~OaDecompositionBase ( ) [virtual]

Destructor.


Member Function Documentation

virtual void Bonmin::OaDecompositionBase::generateCuts ( const OsiSolverInterface &  si,
OsiCuts &  cs,
const CglTreeInfo  info = CglTreeInfo() 
) [virtual]

Standard cut generation methods.

void Bonmin::OaDecompositionBase::assignNlpInterface ( OsiTMINLPInterface nlp) [inline]

Assign an OsiTMINLPInterface.

Definition at line 118 of file BonOaDecBase.hpp.

References nlp_.

void Bonmin::OaDecompositionBase::assignLpInterface ( OsiSolverInterface *  si) [inline]

Assign an OsiTMINLPInterface.

Definition at line 124 of file BonOaDecBase.hpp.

References lp_.

bool Bonmin::OaDecompositionBase::reassignLpsolver ( ) [inline]

Definition at line 129 of file BonOaDecBase.hpp.

References reassignLpsolver_.

void Bonmin::OaDecompositionBase::setObjects ( OsiObject **  objects,
int  nObjects 
) [inline]

Set objects.

Definition at line 134 of file BonOaDecBase.hpp.

References nObjects_, and objects_.

void Bonmin::OaDecompositionBase::setLeaveSiUnchanged ( bool  yesno) [inline]

Set whether to leave the solverinterface unchanged.

Definition at line 140 of file BonOaDecBase.hpp.

References leaveSiUnchanged_.

Parameters& Bonmin::OaDecompositionBase::parameter ( ) [inline]

Definition at line 200 of file BonOaDecBase.hpp.

References parameters_.

const Parameters& Bonmin::OaDecompositionBase::parameter ( ) const [inline]

Definition at line 205 of file BonOaDecBase.hpp.

References parameters_.

void Bonmin::OaDecompositionBase::setLogLevel ( int  level) [inline]

Definition at line 210 of file BonOaDecBase.hpp.

References handler_.

void Bonmin::OaDecompositionBase::setReassignLpSolver ( bool  v) [inline]

Definition at line 215 of file BonOaDecBase.hpp.

References reassignLpsolver_.

void Bonmin::OaDecompositionBase::passInMessageHandler ( CoinMessageHandler *  handler)
void Bonmin::OaDecompositionBase::setupMipSolver ( BabSetupBase b,
const std::string &  prefix 
) [protected]
bool Bonmin::OaDecompositionBase::post_nlp_solve ( BabInfo babInfo,
double  cutoff 
) const [protected]

Solve the nlp and do output.

Returns:
true if feasible
virtual double Bonmin::OaDecompositionBase::performOa ( OsiCuts &  cs,
solverManip lpManip,
BabInfo babInfo,
double &  ,
const CglTreeInfo &  info 
) const [protected, pure virtual]

virtual method which performs the OA algorithm by modifying lp and nlp.

Implemented in Bonmin::EcpCuts, Bonmin::OACutGenerator2, Bonmin::MinlpFeasPump, and Bonmin::OaFeasibilityChecker.

virtual bool Bonmin::OaDecompositionBase::doLocalSearch ( BabInfo babInfo) const [protected, pure virtual]

virutal method to decide if local search is performed

Implemented in Bonmin::EcpCuts, Bonmin::OACutGenerator2, Bonmin::OaFeasibilityChecker, and Bonmin::MinlpFeasPump.


Member Data Documentation

Pointer to nlp interface.

Definition at line 238 of file BonOaDecBase.hpp.

Referenced by assignNlpInterface().

Pointer to setup.

Definition at line 240 of file BonOaDecBase.hpp.

int Bonmin::OaDecompositionBase::nSolve_ [mutable, protected]

Number of nlp solved done.

Definition at line 242 of file BonOaDecBase.hpp.

OsiSolverInterface* Bonmin::OaDecompositionBase::lp_ [mutable, protected]

A linear solver.

Definition at line 244 of file BonOaDecBase.hpp.

Referenced by assignLpInterface().

OsiObject* * Bonmin::OaDecompositionBase::objects_ [protected]

Some objects the feasiblitiy of which to verify.

Definition at line 246 of file BonOaDecBase.hpp.

Referenced by setObjects().

Number of objects.*/.

Definition at line 248 of file BonOaDecBase.hpp.

Referenced by setObjects().

number of local searches performed

Definition at line 250 of file BonOaDecBase.hpp.

CoinMessageHandler* Bonmin::OaDecompositionBase::handler_ [protected]

messages handler.

Definition at line 252 of file BonOaDecBase.hpp.

Referenced by setLogLevel().

CoinMessages Bonmin::OaDecompositionBase::messages_ [protected]

Messages for OA.

Definition at line 254 of file BonOaDecBase.hpp.

Wether or not we should remove cuts at the end of the procedure.

Definition at line 256 of file BonOaDecBase.hpp.

Referenced by setLeaveSiUnchanged().

Do we need to reassign the lp solver with Cbc.

Definition at line 258 of file BonOaDecBase.hpp.

Referenced by reassignLpsolver(), and setReassignLpSolver().

time of construction

Definition at line 260 of file BonOaDecBase.hpp.

int Bonmin::OaDecompositionBase::numSols_ [mutable, protected]

number of solutions found by OA_decomposition.

Definition at line 262 of file BonOaDecBase.hpp.

OsiCuts Bonmin::OaDecompositionBase::savedCuts_ [mutable, protected]

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.

Store the current node number.

Definition at line 272 of file BonOaDecBase.hpp.


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