Bonmin::OaDecompositionBase::SubMipSolver Class Reference

Small class to perform the solution of sub-mips. More...

#include <BonOaDecBase.hpp>

Collaboration diagram for Bonmin::OaDecompositionBase::SubMipSolver:

Collaboration graph
[legend]
List of all members.

Public Member Functions

 SubMipSolver (OsiSolverInterface *lp=NULL, const CbcStrategy *strategy=NULL)
 Constructor.
 ~SubMipSolver ()
void setLpSolver (OsiSolverInterface *lp)
 Assign lp solver.
void setStrategy (CbcStrategy *strategy)
 Assign a strategy.
const double * getLastSolution ()
 get the solution found in last local search (return NULL if no solution).
double getLowerBound ()
void performLocalSearch (double cutoff, int loglevel, double maxTime, int maxNodes)
 update cutoff and perform a new local search.
double lowBound ()
 Returns lower bound.
bool optimal ()
 returns optimality status.
int nodeCount ()
 Returns number of nodes in last solve.
int iterationCount ()
 Returns number of simplex iterations in last solve.
void registerOptions (Ipopt::SmartPtr< Ipopt::RegisteredOptions > roptions)
 Register options for that Oa based cut generation method.

Private Attributes

OsiSolverInterfacelp_
 lp (potentially mip solver).
OsiClpSolverInterfaceclp_
 If lp solver is clp (then have to use Cbc).
OsiCpxSolverInterfacecpx_
 If lp solver is cpx this points to it.
CbcModelcbc_
 If cbc is used pointer to CbcModel.
double lowBound_
 lower bound obtained
bool optimal_
 Is optimality proven?
double * integerSolution_
 Has an integer solution? then it is here.
CbcStrategystrategy_
 Strategy for solving sub mips with cbc.
int nodeCount_
 number of nodes in last mip solved.
int iterationCount_
 number of simplex iteration in last mip solved.

Detailed Description

Small class to perform the solution of sub-mips.

Definition at line 35 of file BonOaDecBase.hpp.


Constructor & Destructor Documentation

Bonmin::OaDecompositionBase::SubMipSolver::SubMipSolver ( OsiSolverInterface lp = NULL,
const CbcStrategy strategy = NULL 
)

Constructor.

Bonmin::OaDecompositionBase::SubMipSolver::~SubMipSolver (  ) 


Member Function Documentation

void Bonmin::OaDecompositionBase::SubMipSolver::setLpSolver ( OsiSolverInterface lp  ) 

Assign lp solver.

void Bonmin::OaDecompositionBase::SubMipSolver::setStrategy ( CbcStrategy strategy  )  [inline]

Assign a strategy.

Definition at line 48 of file BonOaDecBase.hpp.

References CbcStrategy::clone(), and strategy_.

const double* Bonmin::OaDecompositionBase::SubMipSolver::getLastSolution (  )  [inline]

get the solution found in last local search (return NULL if no solution).

Definition at line 54 of file BonOaDecBase.hpp.

References integerSolution_.

double Bonmin::OaDecompositionBase::SubMipSolver::getLowerBound (  )  [inline]

Definition at line 59 of file BonOaDecBase.hpp.

References lowBound_.

void Bonmin::OaDecompositionBase::SubMipSolver::performLocalSearch ( double  cutoff,
int  loglevel,
double  maxTime,
int  maxNodes 
)

update cutoff and perform a new local search.

double Bonmin::OaDecompositionBase::SubMipSolver::lowBound (  )  [inline]

Returns lower bound.

Definition at line 70 of file BonOaDecBase.hpp.

References lowBound_.

bool Bonmin::OaDecompositionBase::SubMipSolver::optimal (  )  [inline]

returns optimality status.

Definition at line 76 of file BonOaDecBase.hpp.

References optimal_.

int Bonmin::OaDecompositionBase::SubMipSolver::nodeCount (  )  [inline]

Returns number of nodes in last solve.

Definition at line 82 of file BonOaDecBase.hpp.

References nodeCount_.

int Bonmin::OaDecompositionBase::SubMipSolver::iterationCount (  )  [inline]

Returns number of simplex iterations in last solve.

Definition at line 88 of file BonOaDecBase.hpp.

References iterationCount_.

void Bonmin::OaDecompositionBase::SubMipSolver::registerOptions ( Ipopt::SmartPtr< Ipopt::RegisteredOptions roptions  )  [inline]

Register options for that Oa based cut generation method.

Definition at line 95 of file BonOaDecBase.hpp.


Member Data Documentation

OsiSolverInterface* Bonmin::OaDecompositionBase::SubMipSolver::lp_ [private]

lp (potentially mip solver).

Definition at line 99 of file BonOaDecBase.hpp.

OsiClpSolverInterface* Bonmin::OaDecompositionBase::SubMipSolver::clp_ [private]

If lp solver is clp (then have to use Cbc).

Definition at line 101 of file BonOaDecBase.hpp.

OsiCpxSolverInterface* Bonmin::OaDecompositionBase::SubMipSolver::cpx_ [private]

If lp solver is cpx this points to it.

Definition at line 103 of file BonOaDecBase.hpp.

CbcModel* Bonmin::OaDecompositionBase::SubMipSolver::cbc_ [private]

If cbc is used pointer to CbcModel.

Definition at line 105 of file BonOaDecBase.hpp.

double Bonmin::OaDecompositionBase::SubMipSolver::lowBound_ [private]

lower bound obtained

Definition at line 107 of file BonOaDecBase.hpp.

Referenced by getLowerBound(), and lowBound().

bool Bonmin::OaDecompositionBase::SubMipSolver::optimal_ [private]

Is optimality proven?

Definition at line 109 of file BonOaDecBase.hpp.

Referenced by optimal().

double* Bonmin::OaDecompositionBase::SubMipSolver::integerSolution_ [private]

Has an integer solution? then it is here.

Definition at line 111 of file BonOaDecBase.hpp.

Referenced by getLastSolution().

CbcStrategy* Bonmin::OaDecompositionBase::SubMipSolver::strategy_ [private]

Strategy for solving sub mips with cbc.

Definition at line 113 of file BonOaDecBase.hpp.

Referenced by setStrategy().

int Bonmin::OaDecompositionBase::SubMipSolver::nodeCount_ [private]

number of nodes in last mip solved.

Definition at line 115 of file BonOaDecBase.hpp.

Referenced by nodeCount().

int Bonmin::OaDecompositionBase::SubMipSolver::iterationCount_ [private]

number of simplex iteration in last mip solved.

Definition at line 117 of file BonOaDecBase.hpp.

Referenced by iterationCount().


The documentation for this class was generated from the following file:
Generated on Sat Jun 21 03:19:24 2008 for Bonmin by  doxygen 1.4.7