idol::OptimizerFactory Class Reference

#include <OptimizerFactory.h>

Inheritance diagram for idol::OptimizerFactory:

Collaboration diagram for idol::OptimizerFactory:

Public Member Functions
virtual Optimizer *	operator() (const Model &t_model) const =0
virtual OptimizerFactory *	clone () const =0
template<class T >
T &	as ()
template<class T >
const T &	as () const
template<class T >
bool	is () const

Detailed Description

OptimizerFactory is the base class for all optimizer factories.

An optimizer Factory is used to create an optimizer when actually needed. They can be seen as customizable "building plans" for actually creating external-mip.

Definition at line 26 of file OptimizerFactory.h.

Member Function Documentation

as() [1/2]

template<class T >

T & idol::OptimizerFactory::as ( )

inline

Definition at line 44 of file OptimizerFactory.h.

as() [2/2]

template<class T >

const T & idol::OptimizerFactory::as ( ) const

inline

Definition at line 52 of file OptimizerFactory.h.

clone()

virtual OptimizerFactory * idol::OptimizerFactory::clone ( ) const

pure virtual

Creates and return a copy of the optimizer factory. This is used for polymorphism.

Returns

A copied object of the current object (i.e., *this)

Implemented in idol::Bilevel::BranchAndCut, idol::Bilevel::KKT, idol::Bilevel::MinMax::Dualize, idol::Bilevel::PessimisticAsOptimistic, idol::Bilevel::StrongDuality, idol::Bilevel::MibS, idol::BranchAndBound< NodeT >, idol::DantzigWolfeDecomposition, idol::PADM, idol::PenaltyMethod, idol::Cplex, idol::GLPK, idol::Gurobi, idol::HiGHS, idol::JuMP, idol::Mosek, idol::Osi, idol::Robust::AffineDecisionRule, idol::Robust::Benders, idol::Robust::ColumnAndConstraintGeneration, idol::Robust::Deterministic, and idol::Robust::ScenarioBasedKAdaptabilityProblemSolver.

is()

template<class T >

bool idol::OptimizerFactory::is ( ) const

inline

Definition at line 60 of file OptimizerFactory.h.

operator()()

virtual Optimizer * idol::OptimizerFactory::operator() ( const Model &  t_model ) const

pure virtual

Creates and returns a new optimizer to solve the model given as parameter.

Parameters

t_model

The model which the optimizer will solve

Returns

A new optimizer for the model

Implemented in idol::Bilevel::BranchAndCut, idol::Bilevel::KKT, idol::Bilevel::MinMax::Dualize, idol::Bilevel::PessimisticAsOptimistic, idol::Bilevel::StrongDuality, idol::Bilevel::MibS, idol::BranchAndBound< NodeT >, idol::DantzigWolfeDecomposition, idol::PADM, idol::PenaltyMethod, idol::Cplex, idol::GLPK, idol::Gurobi, idol::HiGHS, idol::JuMP, idol::Mosek, idol::Osi, idol::Robust::AffineDecisionRule, idol::Robust::Benders, idol::Robust::ColumnAndConstraintGeneration, idol::Robust::Deterministic, and idol::Robust::ScenarioBasedKAdaptabilityProblemSolver.