10 #ifndef BonFpForMinlp_H
11 #define BonFpForMinlp_H
35 virtual CglCutGenerator *
clone()
const
44 virtual double performOa(OsiCuts & cs, solverManip &lpManip,
45 BabInfo * babInfo,
double &cutoff,
const CglTreeInfo &
info)
const;
void setStrategy(const CbcStrategy &strategy)
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint fint fint fint * info
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register OA options.
int passBound_
Wether or not to pass bound to master algorithm.
void setStrategy(const CbcStrategy &strategy)
Strategy to apply when using Cbc as MILP sub-solver.
virtual CglCutGenerator * clone() const
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc...
~MinlpFeasPump()
Destructor.
A class to have all elements necessary to setup a branch-and-bound.
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.
Parameters parameters_
Parameters.
MinlpFeasPump(BabSetupBase &b)
Constructor with basic setup.
void set_fp_objective(OsiSolverInterface &si, const double *colsol) const
Put objective of MIP according to FP scheme.
Base class for OA algorithms.
MinlpFeasPump(const MinlpFeasPump ©)
Copy constructor.
virtual bool doLocalSearch(BabInfo *babInfo) const
virutal method to decide if local search is performed
Bonmin class for passing info between components of branch-and-cuts.