Go to the documentation of this file.
10 #ifndef BonFpForMinlp_H
11 #define BonFpForMinlp_H
25 passBound_(copy.passBound_)
Parameters parameters_
Parameters.
virtual CglCutGenerator * clone() const
(C) Copyright International Business Machines Corporation 2007
A class to have all elements necessary to setup a branch-and-bound.
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
MinlpFeasPump(BabSetupBase &b)
Constructor with basic setup.
void setStrategy(const CbcStrategy &strategy)
~MinlpFeasPump()
Destructor.
Bonmin class for passing info between components of branch-and-cuts.
virtual double performOa(OsiCuts &cs, solverManip &lpManip, BabInfo *babInfo, double &cutoff, const CglTreeInfo &info) const
virtual method which performs the OA algorithm by modifying lp and nlp.
void set_fp_objective(OsiSolverInterface &si, const double *colsol) const
Put objective of MIP according to FP scheme.
void setStrategy(const CbcStrategy &strategy)
Strategy to apply when using Cbc as MILP sub-solver.
Base class for OA algorithms.
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register OA options.
Small class to manipulatee various things in an OsiSolverInterface and restore them.
virtual bool doLocalSearch(BabInfo *babInfo) const
virutal method to decide if local search is performed
MinlpFeasPump(const MinlpFeasPump ©)
Copy constructor.