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

A very simple class to provide a common interface for solving MIPs with Cplex and Cbc. More...

#include <BonSubMipSolver.hpp>

Public Types

enum  MILP_solve_strategy { FindGoodSolution , GetOptimum }
 

Public Member Functions

 SubMipSolver (BabSetupBase &b, const std::string &prefix)
 Constructor.
 
 SubMipSolver (const SubMipSolver &copy)
 Copy Constructor.
 
 ~SubMipSolver ()
 
void setLpSolver (OsiSolverInterface *lp)
 Assign lp solver.
 
void setStrategy (CbcStrategyDefault *strategy)
 Assign a strategy.
 
const double * getLastSolution ()
 get the solution found in last local search (return NULL if no solution).
 
double getLowerBound ()
 
void solve (double cutoff, int loglevel, double maxTime)
 
void find_good_sol (double cutoff, int loglevel, double maxTime)
 update cutoff and perform a local search to a good solution.
 
void optimize (double cutoff, int loglevel, double maxTime)
 update cutoff and optimize MIP.
 
void optimize_with_lazy_constraints (double cutoff, int loglevel, double maxTime, const OsiCuts &cs)
 update cutoff, put OA constraints in cs as lazy constraints and optimize MIP.
 
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.
 
OsiSolverInterfacesolver ()
 

Static Public Member Functions

static void registerOptions (Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
 Register options for that Oa based cut generation method.
 

Detailed Description

A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.

Definition at line 29 of file BonSubMipSolver.hpp.

Member Enumeration Documentation

◆ MILP_solve_strategy

Enumerator
FindGoodSolution 
GetOptimum 

Definition at line 32 of file BonSubMipSolver.hpp.

Constructor & Destructor Documentation

◆ SubMipSolver() [1/2]

Bonmin::SubMipSolver::SubMipSolver ( BabSetupBase & b,
const std::string & prefix )

Constructor.

◆ SubMipSolver() [2/2]

Bonmin::SubMipSolver::SubMipSolver ( const SubMipSolver & copy)

Copy Constructor.

◆ ~SubMipSolver()

Bonmin::SubMipSolver::~SubMipSolver ( )

Member Function Documentation

◆ setLpSolver()

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

Assign lp solver.

◆ setStrategy()

void Bonmin::SubMipSolver::setStrategy ( CbcStrategyDefault * strategy)

Assign a strategy.

◆ getLastSolution()

const double * Bonmin::SubMipSolver::getLastSolution ( )
inline

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

Definition at line 50 of file BonSubMipSolver.hpp.

◆ getLowerBound()

double Bonmin::SubMipSolver::getLowerBound ( )
inline

Definition at line 55 of file BonSubMipSolver.hpp.

◆ solve()

void Bonmin::SubMipSolver::solve ( double cutoff,
int loglevel,
double maxTime )
inline

Definition at line 60 of file BonSubMipSolver.hpp.

◆ find_good_sol()

void Bonmin::SubMipSolver::find_good_sol ( double cutoff,
int loglevel,
double maxTime )

update cutoff and perform a local search to a good solution.

◆ optimize()

void Bonmin::SubMipSolver::optimize ( double cutoff,
int loglevel,
double maxTime )

update cutoff and optimize MIP.

◆ optimize_with_lazy_constraints()

void Bonmin::SubMipSolver::optimize_with_lazy_constraints ( double cutoff,
int loglevel,
double maxTime,
const OsiCuts & cs )

update cutoff, put OA constraints in cs as lazy constraints and optimize MIP.

◆ lowBound()

double Bonmin::SubMipSolver::lowBound ( )
inline

Returns lower bound.

Definition at line 87 of file BonSubMipSolver.hpp.

◆ optimal()

bool Bonmin::SubMipSolver::optimal ( )
inline

returns optimality status.

Definition at line 93 of file BonSubMipSolver.hpp.

◆ nodeCount()

int Bonmin::SubMipSolver::nodeCount ( )
inline

Returns number of nodes in last solve.

Definition at line 99 of file BonSubMipSolver.hpp.

◆ iterationCount()

int Bonmin::SubMipSolver::iterationCount ( )
inline

Returns number of simplex iterations in last solve.

Definition at line 105 of file BonSubMipSolver.hpp.

◆ solver()

OsiSolverInterface * Bonmin::SubMipSolver::solver ( )

◆ registerOptions()

static void Bonmin::SubMipSolver::registerOptions ( Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
static

Register options for that Oa based cut generation method.


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