MinlpBCP Member List

This is the complete list of members for MinlpBCP, including all inherited members.

add_ExtremePoint(const dvector &w, int k, Pointer< MinlpNode >=NULL)	MinlpBCP	`[private]`
add_sol_candidate(const dvector &x)	MinlpBCP	`[private, virtual]`
bb_tree	MinlpBCP	`[private]`
BestBound enum value	MinlpBCP	`[private]`
bin_subdiv(list< Pointer< MinlpNode > > &nodes, int &subdiv_var, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
BinSubdiv enum value	MinlpBCP	`[private]`
bisect_subdiv(list< Pointer< MinlpNode > > &nodes, int &subdiv_var, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
BisectSubdiv enum value	MinlpBCP	`[private]`
block_convex_prob	MinlpBCP	`[private]`
block_prob	MinlpBCP	`[private]`
block_sub_convex_prob	MinlpBCP	`[private]`
bound_computed	MinlpBCP	`[private]`
bound_failed	MinlpBCP	`[private]`
bound_impr_tol	MinlpBCP	`[private]`
bound_time	MinlpBCP	`[private]`
bound_type	MinlpBCP	`[private]`
boxreduce(Pointer< MinlpNode > node, int index, IntervalReduction::which_bound_type which_bound)	MinlpBCP	`[private]`
BranchCut enum value	MinlpBCP	`[private]`
clean_sub_problems()	MinlpBCP	`[private]`
colgen	MinlpBCP	`[private]`
ColumnGenerator class	MinlpBCP	`[friend]`
conv_rate_check(double val)	MinlpBCP	`[private]`
conv_rate_cntrl_first_major_val	MinlpBCP	`[private]`
conv_rate_cntrl_improve_iter	MinlpBCP	`[private]`
conv_rate_cntrl_last_major_val	MinlpBCP	`[private]`
conv_rate_cntrl_last_val	MinlpBCP	`[private]`
conv_rate_cntrl_max_rel_improvement	MinlpBCP	`[private]`
conv_rate_cntrl_minor_iter	MinlpBCP	`[private]`
conv_rate_cntrl_stopping_rho	MinlpBCP	`[private]`
convex_prob	RelaxationSolver	`[protected]`
cost_subdiv(list< Pointer< MinlpNode > > &nodes, int &subdiv_var, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
CostSubdivLag enum value	MinlpBCP	`[private]`
CostSubdivNewton enum value	MinlpBCP	`[private]`
current_node	MinlpBCP	`[private]`
dim() const	Solver	`[inline]`
dim_	Solver	`[protected]`
dual_init_ExtremePoints(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
ExtremePoints	MinlpBCP	`[private]`
feasibility_check(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
find_sol_candidates(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
find_solcand_time	MinlpBCP	`[private]`
gap_tol	MinlpBCP	`[private]`
improve_bound(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
improve_LP_bound(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
init()	MinlpBCP	`[private]`
init_block_problems()	MinlpBCP	`[private]`
init_ExtremePoints(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
init_lag_problems(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
init_RMP_time	MinlpBCP	`[private]`
intervalreduction	MinlpBCP	`[private]`
intgrad_cutgen	MinlpBCP	`[private]`
intgrad_cuts	MinlpBCP	`[private]`
is_gams_prob	RelaxationSolver	`[protected]`
is_maxcut	MinlpBCP	`[private]`
iter()	Solver	`[inline]`
iter_	Solver	`[protected]`
iter_max	Solver
lag_cuts	MinlpBCP	`[private]`
lag_problem	MinlpBCP	`[private]`
lagheu	MinlpBCP	`[private]`
lagprob_solves	MinlpBCP	`[private]`
lagsolve_type	MinlpBCP	`[private]`
LagSolveStatus typedef	MinlpBCP	`[private]`
last_impr_iter	RelaxationSolver	`[protected]`
levelcuts	RelaxationSolver	`[protected]`
linconcutgen	MinlpBCP	`[private]`
linear_relax	RelaxationSolver	`[protected]`
locopt_NLP(dvector &start)	RelaxationSolver	`[protected]`
locopt_NLP(dvector &start, dvector &sol_point)	RelaxationSolver	`[protected]`
lower_bound	RelaxationSolver
LP_bound enum value	MinlpBCP	`[private]`
LP_RMP_bound enum value	MinlpBCP	`[private]`
maj_bound_type	MinlpBCP	`[private]`
make_sub_prob(Pointer< MinlpProblem > &out, Pointer< MinlpProblem > in, Pointer< MinlpNode > node)	RelaxationSolver	`[protected]`
max_time	MinlpBCP	`[private]`
mem_check()	MinlpBCP	`[private]`
mem_limit	MinlpBCP	`[private]`
MinlpBCP(Pointer< MinlpProblem > orig_prob_, Pointer< MinlpProblem > split_prob_, Pointer< LinearRelax > linear_relax_, 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)	MinlpBCP
minlpdata	RelaxationSolver	`[protected]`
MinlpNode class	MinlpBCP	`[friend]`
mip_cuts	MinlpBCP	`[private]`
NLP_bound enum value	MinlpBCP	`[private]`
nodeselect_type	MinlpBCP	`[private]`
nr_solcand_found	MinlpBCP	`[private]`
nr_subdiv_bisect	MinlpBCP	`[private]`
nr_subdiv_contvar	MinlpBCP	`[private]`
opt_val()	Solver	`[inline]`
opt_val_	Solver	`[protected]`
orig_prob	RelaxationSolver	`[protected]`
out_solver_log_p	Solver
out_solver_p	Solver
param	RelaxationSolver	`[protected]`
point_conversion_warnings	RelaxationSolver	`[protected]`
pre_bb_max_iter	MinlpBCP	`[private]`
pre_bound_type	MinlpBCP	`[private]`
preswitching(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
primal_init_ExtremePoints(const dvector &x, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
print(ostream &out) const	Solver	`[inline, virtual]`
prob_is_convex	MinlpBCP	`[private]`
project_ExtremePoints(dvector &x, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
prune_ExtremePoints(multimap< double, Pointer< MinlpNode > > &bb_tree)	MinlpBCP	`[private]`
quad_prob	MinlpBCP	`[private]`
rect_subdiv(list< Pointer< MinlpNode > > &nodes, Pointer< MinlpNode > node, int k, int i, double cut)	MinlpBCP	`[private]`
reform	RelaxationSolver	`[protected]`
RelaxationSolver(Pointer< MinlpProblem > orig_prob_, 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)	RelaxationSolver
RMP_bound enum value	MinlpBCP	`[private]`
RMPSubdiv enum value	MinlpBCP	`[private]`
select_node()	MinlpBCP	`[private]`
set_convex_prob(Pointer< MinlpProblem > convex_prob_, const Pointer< dvector > &sol_C_=NULL, bool sol_C_is_solution_=false)	MinlpBCP
RelaxationSolver::set_convex_prob(Pointer< MinlpProblem > convex_prob_)	RelaxationSolver	`[inline]`
set_levelcut_handler(Pointer< LevelCutHandler > levelcuts_)	RelaxationSolver	`[inline]`
set_linear_relax(Pointer< LinearRelax > linrelax_)	MinlpBCP
set_low_bound(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
set_LP_bound(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
set_LP_RMP_bound(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
set_MINLPData(Pointer< MINLPData > minlpdata_)	MinlpBCP
set_NLP_bound(Pointer< MinlpNode > node, bool improve=false)	MinlpBCP	`[private]`
set_problem_is_convex(bool prob_is_convex_)	MinlpBCP	`[inline]`
set_quad_relax(Pointer< MinlpProblem > quad_prob_)	MinlpBCP
set_reform(Pointer< Reformulation > reform_, Pointer< dvector > sol_C_, bool sol_C_is_solution_)	MinlpBCP
set_reform(Pointer< Reformulation > reform_)	MinlpBCP	`[virtual]`
set_RMP_bound(Pointer< MinlpNode > node)	MinlpBCP	`[private]`
set_split_prob(Pointer< MinlpProblem > split_prob_)	RelaxationSolver	`[inline]`
set_timer(Pointer< Timer > timer_)	MinlpBCP
set_upper_bound(double upper_bound)	RelaxationSolver	`[inline]`
sol_C	MinlpBCP	`[private]`
sol_C_is_solution	MinlpBCP	`[private]`
sol_cand	RelaxationSolver
sol_cand_closeval_tol	RelaxationSolver	`[protected]`
sol_cand_diam	RelaxationSolver	`[protected]`
sol_point	Solver
solve()	MinlpBCP	`[virtual]`
solve(dvector &start)	MinlpBCP	`[virtual]`
solve_lag_problem(LagSolveStatus &status, int k, Pointer< MinlpNode > node, Pointer< SepQcFunc > temp_cut=NULL)	MinlpBCP	`[private]`
Solver(int n, Pointer< ostream > out_solver_p_=out_out_p, Pointer< ostream > out_solver_log_p_=out_log_p)	Solver	`[inline]`
split_prob	RelaxationSolver	`[protected]`
start_bb()	MinlpBCP	`[private]`
stop_bound enum value	MinlpBCP	`[private]`
sub_convex_prob	MinlpBCP	`[private]`
subdiv_discrete_emphasis	MinlpBCP	`[private]`
subdiv_time	MinlpBCP	`[private]`
subdiv_type	MinlpBCP	`[private]`
subdivide(list< Pointer< MinlpNode > > &nodes, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
t_bound_type enum name	MinlpBCP	`[private]`
time()	Solver	`[inline]`
time_	Solver	`[protected]`
timer	MinlpBCP	`[private]`
tol	Solver
UnfixedDiscrete enum value	MinlpBCP	`[private]`
update_ExtremePoints_count	MinlpBCP	`[private]`
update_lag_problem(int k, const dvector &a)	MinlpBCP	`[private]`
update_lag_problems(const dvector &dual_point)	MinlpBCP	`[private]`
update_subdiv_bound(int k, int i, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
upper_bound_effort_level	MinlpBCP	`[private]`
viol_subdiv(list< Pointer< MinlpNode > > &nodes, int &subdiv_var, Pointer< MinlpNode > node)	MinlpBCP	`[private]`
ViolSubdiv enum value	MinlpBCP	`[private]`
~MinlpBCP()	MinlpBCP	`[virtual]`
~Solver()	Solver	`[inline, virtual]`