Classes | |
class | CouenneInfo |
Bonmin class for passing info between components of branch-and-cuts. More... | |
class | CouenneInterface |
class | SmartAsl |
class | CouenneSetup |
class | InitHeuristic |
A heuristic that stores the initial solution of the NLP. More... | |
class | NlpSolveHeuristic |
class | BonminAmplSetup |
class | BabSetupBase |
A class to have all elements necessary to setup a branch-and-bound. More... | |
class | BonminSetup |
class | HotInfo |
class | BonChooseVariable |
This class chooses a variable to branch on. More... | |
class | CurvBranchingSolver |
Implementation of BonChooseVariable for curvature-based braching. More... | |
class | LpBranchingSolver |
Implementation of BonChooseVariable for curvature-based braching. More... | |
class | PseudoCosts |
class | QpBranchingSolver |
This class chooses a variable to branch on. More... | |
class | CbcOaStrategy |
A class to pass on a CbcStrategy to OA sub-milp solver. More... | |
class | DummyHeuristic |
class | EcpCuts |
class | MinlpFeasPump |
class | OACutGenerator2 |
Class to perform OA in its classical form. More... | |
class | OaDecompositionBase |
Base class for OA algorithms. More... | |
class | OaFeasibilityChecker |
Class to perform OA in its classical form. More... | |
class | OaMessages |
Output messages for Outer approximation cutting planes. More... | |
class | OaNlpOptim |
Generate cuts for the nlp corresponding to continuous relaxation at a node. More... | |
class | BabInfo |
Bonmin class for passing info between components of branch-and-cuts. More... | |
class | Bab |
class | CbcNlpStrategy |
class | BonCbcFullNodeInfo |
Holds information for recreating a subproblem by incremental change from the parent for Bonmin. More... | |
class | BonCbcPartialNodeInfo |
Holds information for recreating a subproblem by incremental change from the parent for. More... | |
class | CbcDiver |
Class to do diving in the tree. More... | |
class | CbcProbedDiver |
Class to do probed diving in the tree. More... | |
class | CbcDfsDiver |
A more elaborate diving class. More... | |
class | DiverCompare |
class | GuessHeuristic |
class | AmplInterface |
Class for providing an Osi interface to Ipopt with an ampl nl file as input. More... | |
class | AmplTMINLP |
Ampl MINLP Interface. More... | |
class | AuxInfo |
Bonmin class for passing info between components of branch-and-cuts. More... | |
class | BoundsReader |
Reads a file containing change bounds for variables. More... | |
class | BranchingTQP |
This is an adapter class that converts a TMINLP2TNLP object into a TNLP, which is now just a QP. More... | |
class | NamesReader |
A class for reading a .col or .row file containing name for variables and constraints (usually ampl generated file). More... | |
class | CurvatureEstimator |
class | CutStrengthener |
Class for strengthening OA cuts, and generating additional ones. More... | |
class | OsiTMINLPInterface |
This is class provides an Osi interface for a Mixed Integer Linear Program expressed as a TMINLP (so that we can use it for example as the continuous solver in Cbc). More... | |
class | RegisteredOptions |
Class to add a few more information to Ipopt::RegisteredOptions. More... | |
class | StartPointReader |
This class reads a file with a starting point for Ipopt initalization. More... | |
class | StrongBranchingSolver |
This class is the base class for a solver that can be used in BonOsiSolverInterface to perform the strong branching solves. More... | |
class | TMINLP |
Base class for all MINLPs that use a standard triplet matrix form and dense vectors. More... | |
class | TMINLP2TNLP |
This is an adapter class that converts a TMINLP to a TNLP to be solved by Ipopt. More... | |
class | TNLP2FPNLP |
This is an adapter class to convert an NLP to a Feasibility Pump NLP by changing the objective function to the (2-norm) distance to a point. More... | |
class | TNLPSolver |
This is a generic class for calling an NLP solver to solve a TNLP. More... | |
class | vector |
A small wrap around std::vector to give easy access to array for interfacing with fortran code. More... | |
struct | SimpleReferenced |
struct | SimpleReferencedPtr |
class | BqpdSolver |
class | BqpdWarmStart |
Warm start for filter interface. More... | |
class | FilterSolver |
class | FilterWarmStart |
Warm start for filter interface. More... | |
class | FilterWarmStartDiff |
class | IpoptInteriorWarmStarter |
class | IpoptSolver |
class | IpoptWarmStart |
Class for storing warm start informations for Ipopt. More... | |
class | IpoptWarmStartDiff |
Diff class for IpoptWarmStart. More... | |
Enumerations | |
enum | Algorithm { Dummy = -1, B_BB = 0, B_OA = 1, B_QG = 2, B_Hyb = 3, B_Ecp = 4 } |
Type of algorithms which can be used. More... | |
enum | OA_Message { FEASIBLE_NLP, INFEASIBLE_NLP, UPDATE_UB, SOLVED_LOCAL_SEARCH, LOCAL_SEARCH_ABORT, UPDATE_LB, ABORT, OASUCCESS, LP_ERROR, PERIODIC_MSG, DUMMY_END } |
enum | CutStrengtheningType { CS_None = 0, CS_StrengthenedGlobal = 1, CS_UnstrengthenedGlobal_StrengthenedLocal = 2, CS_StrengthenedGlobal_StrengthenedLocal = 3 } |
enum | DisjunctiveCutType { DC_None = 0, DC_MostFractional = 1 } |
enum | ErrorCodes { ERROR_IN_AMPL_SUFFIXES = 111, UNSUPPORTED_CBC_OBJECT } |
Some error codes for uncatachable errors. More... | |
enum | Solver { EIpopt = 0, EFilterSQP } |
Solvers for solving nonlinear programs. More... | |
Functions | |
int | std_m (int n) |
int | warn_m (int n) |
int | err_m (int n) |
DECLARE_STD_EXCEPTION (TMINLP_INVALID) | |
DECLARE_STD_EXCEPTION (TMINLP_INVALID_VARIABLE_BOUNDS) | |
template<class X> | |
SimpleReferenced< X > * | make_referenced (X other) |
template<class X> | |
SimpleReferencedPtr< X > * | make_referenced (X *other) |
Variables | |
const double | maxNlpInf_0 = 1e-5 |
An heuristic to call an NlpSolver if all CouenneObjects are close to be satisfied (for other integer objects, rounding is performed, is SOS are not satisfied does not run). |
enum Bonmin::Algorithm |
enum Bonmin::OA_Message |
FEASIBLE_NLP | |
INFEASIBLE_NLP | |
UPDATE_UB | |
SOLVED_LOCAL_SEARCH | |
LOCAL_SEARCH_ABORT | |
UPDATE_LB | |
ABORT | |
OASUCCESS | |
LP_ERROR | |
PERIODIC_MSG | |
DUMMY_END |
Definition at line 16 of file BonOAMessages.hpp.
CS_None | |
CS_StrengthenedGlobal | |
CS_UnstrengthenedGlobal_StrengthenedLocal | |
CS_StrengthenedGlobal_StrengthenedLocal |
Definition at line 20 of file BonCutStrengthener.hpp.
enum Bonmin::ErrorCodes |
Some error codes for uncatachable errors.
ERROR_IN_AMPL_SUFFIXES | |
UNSUPPORTED_CBC_OBJECT | There is a CbcObject in the model which is not understood by Bonmin. |
Definition at line 7 of file BonExitCodes.hpp.
enum Bonmin::Solver |
Solvers for solving nonlinear programs.
EIpopt | |
EFilterSQP | filterSQP Sequential Quadratic Programming algorithm. |
Definition at line 36 of file BonOsiTMINLPInterface.hpp.
int Bonmin::std_m | ( | int | n | ) | [inline] |
Definition at line 10 of file BonMsgUtils.hpp.
int Bonmin::warn_m | ( | int | n | ) | [inline] |
Definition at line 11 of file BonMsgUtils.hpp.
int Bonmin::err_m | ( | int | n | ) | [inline] |
Definition at line 12 of file BonMsgUtils.hpp.
Bonmin::DECLARE_STD_EXCEPTION | ( | TMINLP_INVALID | ) |
Bonmin::DECLARE_STD_EXCEPTION | ( | TMINLP_INVALID_VARIABLE_BOUNDS | ) |
SimpleReferenced<X>* Bonmin::make_referenced | ( | X | other | ) |
SimpleReferencedPtr<X>* Bonmin::make_referenced | ( | X * | other | ) |
const double Bonmin::maxNlpInf_0 = 1e-5 |
An heuristic to call an NlpSolver if all CouenneObjects are close to be satisfied (for other integer objects, rounding is performed, is SOS are not satisfied does not run).
Definition at line 19 of file BonNlpHeuristic.hpp.