#include <lagheu.h>
Inheritance diagram for LagHeu2:
Public Member Functions | |
LagHeu2 (Pointer< MinlpProblem > orig_prob_, Pointer< LinearRelax > linrelax_, bool is_gams_prob=false, double closeval_tol_=0., Pointer< dvector > diam_=NULL, Pointer< Param > param_=NULL, Pointer< ostream > out_solver_p_=out_out_p, Pointer< ostream > out_solver_log_p_=out_log_p) | |
int | solve (Pointer< MinlpNode > node_) |
void | set_reform (Pointer< Reformulation > reform_) |
Private Member Functions | |
void | search (map< pair< double, int >, multimap< double, list< ExtremePoint >::iterator > >::reverse_iterator it_k, double ns) |
bool | project (dvector &res) |
Tries to make x feasible. | |
double | key (const dvector &x) |
Gives key for x. | |
Private Attributes | |
dvector | x |
map< pair< double, int >, multimap< double, list< ExtremePoint >::iterator > > | W |
{ ((key, k), { (z*_kj, w_kj) }_j }_k | |
Pointer< MinlpPenaltyFunc > | penalty |
map< double, dvector > | candidates |
int | max_candidates |
int | max_ns |
double | ns_done |
double | ns_all |
int | lastprint |
LagHeu2 | max locopt options integer $ 0$ default 100 level 0 Number of best candidates to keep for local optimization. | |
LagHeu2 | max combinations options integer $ 0$ default 10000 level 0 Upper bound on the number of combinations of extreme points to explore. |
Definition at line 198 of file lagheu.h.
LagHeu2::LagHeu2 | ( | Pointer< MinlpProblem > | orig_prob_, | |
Pointer< LinearRelax > | linrelax_, | |||
bool | is_gams_prob = false , |
|||
double | closeval_tol_ = 0. , |
|||
Pointer< dvector > | diam_ = NULL , |
|||
Pointer< Param > | param_ = NULL , |
|||
Pointer< ostream > | out_solver_p_ = out_out_p , |
|||
Pointer< ostream > | out_solver_log_p_ = out_log_p | |||
) |
void LagHeu2::search | ( | map< pair< double, int >, multimap< double, list< ExtremePoint >::iterator > >::reverse_iterator | it_k, | |
double | ns | |||
) | [private] |
bool LagHeu2::project | ( | dvector & | res | ) | [private] |
Tries to make x feasible.
res | The vector to store the result in. |
double LagHeu2::key | ( | const dvector & | x | ) | [private] |
Gives key for x.
void LagHeu2::set_reform | ( | Pointer< Reformulation > | reform_ | ) | [virtual] |
Reimplemented from RelaxationSolver.
dvector LagHeu2::x [private] |
map<pair<double, int>, multimap<double, list<ExtremePoint>::iterator> > LagHeu2::W [private] |
Pointer<MinlpPenaltyFunc> LagHeu2::penalty [private] |
map<double, dvector> LagHeu2::candidates [private] |
int LagHeu2::max_candidates [private] |
int LagHeu2::max_ns [private] |
double LagHeu2::ns_done [private] |
double LagHeu2::ns_all [private] |
int LagHeu2::lastprint [private] |