11#ifndef BonOaFeasibilityChecker_HPP
12#define BonOaFeasibilityChecker_HPP
Bonmin class for passing info between components of branch-and-cuts.
A class to have all elements necessary to setup a branch-and-bound.
Small class to manipulatee various things in an OsiSolverInterface and restore them.
Base class for OA algorithms.
Class to perform OA in its classical form.
OaFeasibilityChecker(BabSetupBase &b)
New usefull constructor.
unsigned int maximum_oa_cuts_
maximum number of OA cuts.
CutsTypes type_
Type of cuts.
~OaFeasibilityChecker()
Destructor.
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.
OaFeasibilityChecker(const OaFeasibilityChecker ©)
Copy constructor.
CutsPolicies
See documentation for feas_check_discard_policy option.
CutsTypes
See documentation for feas_check_cut_types option.
virtual bool doLocalSearch(BabInfo *babInfo) const
virutal method to decide if local search is performed
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register OA options.
virtual CglCutGenerator * clone() const
unsigned int cut_count_
Count the total number of cuts generated.
CutsPolicies pol_
Policy for keeping cuts.
(C) Copyright International Business Machines Corporation 2007