#include <lagheu.h>
Inheritance diagram for LagHeu2b:


Public Member Functions | |
| LagHeu2b (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 | |
| int | block_value (double &val, int k) |
| void | search (double ns) |
| double | key () |
| Gives key for x. | |
| bool | project () |
| Tries to make x feasible. | |
| bool | switch_binaries (double val, bool eq, map< int, double > &coeff) |
| void | make_binaries_feasible () |
| void | switch_binaries2 (double val, bool eq, map< int, double > &coeff) |
| void | switch_binaries2_rek (double val, bool eq, double &bestval, dvector &pt, map< int, double >::iterator coeff_it, map< int, double > &coeff) |
| void | move_continuous (double &val, bool eq, map< int, double > &cont_coeff) |
Private Attributes | |
| dvector | x |
| vector< dvector > | z |
| map< pair< double, int >, multimap< double, list< ExtremePoint >::iterator > > | W |
| { ((key, k), { (z*_kj, w_kj) }_j }_k | |
| dvector | W_val |
| list< int > | unfixed_blocks |
| Pointer< MinlpPenaltyFunc > | penalty |
| multimap< 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 252 of file lagheu.h.
| LagHeu2b::LagHeu2b | ( | 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 LagHeu2b::block_value | ( | double & | val, | |
| int | k | |||
| ) | [private] |
| void LagHeu2b::search | ( | double | ns | ) | [private] |
| double LagHeu2b::key | ( | ) | [private] |
Gives key for x.
| bool LagHeu2b::project | ( | ) | [private] |
Tries to make x feasible.
| bool LagHeu2b::switch_binaries | ( | double | val, | |
| bool | eq, | |||
| map< int, double > & | coeff | |||
| ) | [private] |
| void LagHeu2b::make_binaries_feasible | ( | ) | [private] |
| void LagHeu2b::switch_binaries2 | ( | double | val, | |
| bool | eq, | |||
| map< int, double > & | coeff | |||
| ) | [private] |
| void LagHeu2b::switch_binaries2_rek | ( | double | val, | |
| bool | eq, | |||
| double & | bestval, | |||
| dvector & | pt, | |||
| map< int, double >::iterator | coeff_it, | |||
| map< int, double > & | coeff | |||
| ) | [private] |
| void LagHeu2b::move_continuous | ( | double & | val, | |
| bool | eq, | |||
| map< int, double > & | cont_coeff | |||
| ) | [private] |
| void LagHeu2b::set_reform | ( | Pointer< Reformulation > | reform_ | ) | [virtual] |
Reimplemented from RelaxationSolver.
dvector LagHeu2b::x [private] |
vector<dvector> LagHeu2b::z [private] |
map<pair<double, int>, multimap<double, list<ExtremePoint>::iterator> > LagHeu2b::W [private] |
dvector LagHeu2b::W_val [private] |
list<int> LagHeu2b::unfixed_blocks [private] |
Pointer<MinlpPenaltyFunc> LagHeu2b::penalty [private] |
multimap<double, dvector> LagHeu2b::candidates [private] |
int LagHeu2b::max_candidates [private] |
int LagHeu2b::max_ns [private] |
double LagHeu2b::ns_done [private] |
double LagHeu2b::ns_all [private] |
int LagHeu2b::lastprint [private] |
1.4.7