, including all inherited members.
| add_cut(const Pointer< SimpleCut > &cut, int k, const Pointer< MinlpNode > &node=NULL) | LinearRelax | |
| add_cut(const Pointer< SimpleCut > &cut, const Pointer< MinlpNode > &node=NULL) | LinearRelax | [inline] |
| add_cut(const Pointer< LinearizationCut > &cut, int k, const Pointer< MinlpNode > &node=NULL) | LinearRelax | |
| add_cut(Pointer< IntervalGradientCut > intgradcut, int k, Pointer< MinlpNode > node=NULL) | LinearRelax | |
| add_level_cut(double level) | LinearRelax | |
| block_con | LinearRelax | |
| box_reduce(pair< double, double > &newbox, const pair< double, double > &oldbox, int k, int i, bool discrete=false, bool unknown_only=false) | LinearRelax | [private] |
| box_reduce(Pointer< MinlpNode > node, int k, const vector< bool > &discr, bool unknown_only=false, set< pair< int, IntervalReduction::which_bound_type > > *changed_var=NULL, double min_impr=0.01) | LinearRelax | |
| box_reduce(Pointer< MinlpNode > node, const vector< bool > &discr, bool unknown_only=false, set< pair< int, IntervalReduction::which_bound_type > > *changed_var=NULL, double min_impr=0.01) | LinearRelax | |
| box_reduce(dvector &newlow, dvector &newup, const vector< bool > &discr, bool unknown_only=false, set< pair< int, IntervalReduction::which_bound_type > > *changed_var=NULL, double min_impr=0.01) | LinearRelax | |
| boxreduce_reduced_integer | LinearRelax | |
| clear_solver() | LinearRelax | |
| core_size() const | LinearRelax | |
| couple_con | LinearRelax | |
| cutlimit_reached() const | LinearRelax | [inline] |
| cutpool | LinearRelax | [private] |
| cutpoolcoupling | LinearRelax | [private] |
| duplicate_nodeinfo(Pointer< MinlpNode > oldnode, Pointer< MinlpNode > newnode) | LinearRelax | |
| feasible(Pointer< MinlpNode > node, double tol=1E-4) | LinearRelax | |
| generate_cuts(Pointer< MinlpNode > node) | LinearRelax | |
| get_cuts(list< CutPool::CutInfo > &cutinfos, Pointer< MinlpNode > node=NULL) | LinearRelax | |
| get_upper_bound() | LinearRelax | |
| i_discr | LinearRelax | [private] |
| inactivetime_limit_global | LinearRelax | [private] |
| inactivetime_limit_local | LinearRelax | [private] |
| init(Pointer< MinlpProblem > convex_prob, const vector< int > &i_discr, Pointer< dvector > feas_point=NULL, bool is_feas=true) | LinearRelax | |
| integrate(LinearRelax &linrelax, int k, Pointer< MinlpNode > node=NULL) | LinearRelax | |
| levelcut_pos | LinearRelax | [private] |
| LinearRelax(Pointer< Param > param_) | LinearRelax | |
| LinearRelax(const LinearRelax &linrelax, int k, Pointer< MinlpNode > node=NULL, Pointer< SepQcFunc > alt_obj=NULL) | LinearRelax | |
| LinearRelaxSolverGeneral class | LinearRelax | [friend] |
| LinearRelaxSolverMIP class | LinearRelax | [friend] |
| lower | LinearRelax | [private] |
| max_cutsnr | LinearRelax | [private] |
| nr_all_cuts() const | LinearRelax | |
| nr_global_cuts() const | LinearRelax | |
| nr_local_cuts(Pointer< MinlpNode > node) const | LinearRelax | |
| obj | LinearRelax | |
| operator<<(ostream &out, LinearRelax &linrelax) | LinearRelax | [friend] |
| param | LinearRelax | [private] |
| point_feasible(Pointer< MinlpNode > node, const dvector &x, double tol=1E-4) const | LinearRelax | |
| remove_node(Pointer< MinlpNode > node) | LinearRelax | |
| set_box(const dvector &lower_, const dvector &upper_) | LinearRelax | [inline] |
| solve(dvector &sol_point, double &value, Pointer< MinlpNode > node, dvector *dual_point=NULL, double tol=1E-4) | LinearRelax | |
| solver | LinearRelax | [private] |
| solver_node | LinearRelax | [private] |
| update_cuts(Pointer< MinlpNode > node, int k, IntervalGradientCutGenerator &generator, LinearizedConCutGenerator &linconcutgen) | LinearRelax | |
| update_level_cut(double newlevel) | LinearRelax | |
| upper | LinearRelax | [private] |
