source: html/options_list.html @ 1586

Last change on this file since 1586 was 1586, checked in by pbonami, 10 years ago

Two typos in links

File size: 87.8 KB
Line 
1<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
2  "http://www.w3.org/TR/html4/loose.dtd"> 
3<html > 
4<head><title></title> 
5<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> 
6<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)"> 
7<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)"> 
8<!-- html --> 
9<meta name="src" content="tmp.tex"> 
10<meta name="date" content="2010-01-23 16:47:00"> 
11<link rel="stylesheet" type="text/css" href="bonmin.css"> 
12</head><body 
13>
14<!--l. 8--><p class="noindent" ><div id="header">   <h1 id="siteName"><TT> <big> BONMIN </big> </tt> Users' Manual</h1>   <div id="globalNav">   <a href="Intro.html">Introduction</a> |   <a href="Obtain.html">Download</a> |  <a href="Install.html">Install</a> |   <a href="use.html">Use</a> |   <a href="options_set.html">Setting Options</a> |   <a href="options_list.html">Options List</a> |   <a href="bib.html">Bibliography</a> |  </div>   </div>  <div id="leftPanel"> <div id="side-bar">  <ul> <li class="main"><a href="/Bonmin/index.html">Bonmin</a></li>  <li><a href="https://projects.coin-or.org/Bonmin">Wiki</a></li>   <li><a href="http://neos.mcs.anl.gov/neos/solvers/minco:Bonmin/AMPL.html"> NEOS </a> </li>  <li><a href="http://egon.cheme.cmu.edu/ibm/page.htm">IBM-CMU OCR </a></li>  <li><a href="http://domino.research.ibm.com/comm/research_projects.nsf/pages/minlp.index.html">  IBM MINLP </a></li>  <br>  <br>  <li class="main"><a href="/index.html">COIN-OR Home</a></li>  <li><a href="/projects.html">Projects</a></li>  <li><a href="/faqs.html">FAQs</a></li>   <li><a href="/download.html">Download</a></li>  <li><a href="/mail.html">Mailing Lists</a></li>  <li><a href="/how-to-help.html">Get Involved</a></li>  <li><a href="/resources.html">Related Resources</a></li>  <li class="main"><a href="/foundation.html">  <br>  <br>  COIN-OR Foundation  </a></li>   <li><a href="/events.html">Events</a></li>  <li><a href="/members.html">Members</a></li>  </ul>  </div> </div> <!--end navBar div -->  <br>   <h2 id="pageName"> List of <span 
15class="cmtt-10">BONMIN</span>&#x00A0;options  </h2>    </div> 
16<!--l. 860--><p class="noindent" > <table border="1"> <tr> <td>Option </td> <td> type </td> <td> default </td> <td> B-BB</td> <td> B-OA</td> <td> B-QG</td> <td> B-Hyb</td> </tr> <tr> <th colspan=7> <a href="##sec:Algorithm_choice">Algorithm choice</a> </th> </tr> <tr> <td> <a href="##sec:algorithm">algorithm</a> </td> <td>S</td> <td>B-BB</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Branch-and-bound_options">Branch-and-bound options</a> </th> </tr> <tr> <td> <a href="##sec:allowable_fraction_gap">allowable_fraction_gap</a> </td> <td>F</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:allowable_gap">allowable_gap</a> </td> <td>F</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:cutoff">cutoff</a> </td> <td>F</td> <td>1e+100</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:cutoff_decr">cutoff_decr</a> </td> <td>F</td> <td>1e-05</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:enable_dynamic_nlp">enable_dynamic_nlp</a> </td> <td>S</td> <td>no</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:integer_tolerance">integer_tolerance</a> </td> <td>F</td> <td>1e-06</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:iteration_limit">iteration_limit</a> </td> <td>I</td> <td>INT_MAX</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:nlp_failure_behavior">nlp_failure_behavior</a> </td> <td>S</td> <td>stop</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:node_comparison">node_comparison</a> </td> <td>S</td> <td>best-bound</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:node_limit">node_limit</a> </td> <td>I</td> <td>INT_MAX</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:num_cut_passes">num_cut_passes</a> </td> <td>I</td> <td>1</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:num_cut_passes_at_root">num_cut_passes_at_root</a> </td> <td>I</td> <td>20</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:number_before_trust">number_before_trust</a> </td> <td>I</td> <td>8</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:number_strong_branch">number_strong_branch</a> </td> <td>I</td> <td>20</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:solution_limit">solution_limit</a> </td> <td>I</td> <td>INT_MAX</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:sos_constraints">sos_constraints</a> </td> <td>S</td> <td>enable</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:time_limit">time_limit</a> </td> <td>F</td> <td>1e+10</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:tree_search_strategy">tree_search_strategy</a> </td> <td>S</td> <td>probed-dive</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:variable_selection">variable_selection</a> </td> <td>S</td> <td>strong-branching</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=7> <a href="##sec:MILP_cutting_planes_in_hybrid">MILP cutting planes in hybrid</a> </th> </tr> <tr> <td> <a href="##sec:2mir_cuts">2mir_cuts</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:Gomory_cuts">Gomory_cuts</a> </td> <td>I</td> <td>-5</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:clique_cuts">clique_cuts</a> </td> <td>I</td> <td>-5</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:cover_cuts">cover_cuts</a> </td> <td>I</td> <td>-5</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:flow_cover_cuts">flow_cover_cuts</a> </td> <td>I</td> <td>-5</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:lift_and_project_cuts">lift_and_project_cuts</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:mir_cuts">mir_cuts</a> </td> <td>I</td> <td>-5</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:reduce_and_split_cuts">reduce_and_split_cuts</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:MINLP_Heuristics">MINLP Heuristics</a> </th> </tr> <tr> <td> <a href="##sec:feasibility_pump_objective_norm">feasibility_pump_objective_norm</a> </td> <td>I</td> <td>1</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:heuristic_RINS">heuristic_RINS</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:heuristic_dive_MIP_vectorLength">heuristic_dive_MIP_vectorLength</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:heuristic_dive_fractional">heuristic_dive_fractional</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:heuristic_dive_vectorLength">heuristic_dive_vectorLength</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:heuristic_feasibility_pump">heuristic_feasibility_pump</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:pump_for_minlp">pump_for_minlp</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:MINLP_heuristics">MINLP heuristics</a> </th> </tr> <tr> <td> <a href="##sec:heuristic_dive_MIP_fractional">heuristic_dive_MIP_fractional</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Nlp_solution_robustness">Nlp solution robustness</a> </th> </tr> <tr> <td> <a href="##sec:max_consecutive_failures">max_consecutive_failures</a> </td> <td>I</td> <td>10</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:max_random_point_radius">max_random_point_radius</a> </td> <td>F</td> <td>100000</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:num_iterations_suspect">num_iterations_suspect</a> </td> <td>I</td> <td>-1</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:num_retry_unsolved_random_point">num_retry_unsolved_random_point</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:random_point_perturbation_interval">random_point_perturbation_interval</a> </td> <td>F</td> <td>1</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:random_point_type">random_point_type</a> </td> <td>S</td> <td>Jon</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=7> <a href="##sec:Nlp_solve_options_in_B-Hyb">Nlp solve options in B-Hyb</a> </th> </tr> <tr> <td> <a href="##sec:nlp_solve_frequency">nlp_solve_frequency</a> </td> <td>I</td> <td>10</td> <td> -</td> <td>-</td> <td>-</td> <td>+</td> </tr> <tr> <td> <a href="##sec:nlp_solve_max_depth">nlp_solve_max_depth</a> </td> <td>I</td> <td>10</td> <td> -</td> <td>-</td> <td>-</td> <td>+</td> </tr> <tr> <td> <a href="##sec:nlp_solves_per_depth">nlp_solves_per_depth</a> </td> <td>F</td> <td>1e+100</td> <td> -</td> <td>-</td> <td>-</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Options_for_MILP_solver">Options for MILP solver</a> </th> </tr> <tr> <td> <a href="##sec:milp_log_level">milp_log_level</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:milp_solver">milp_solver</a> </td> <td>S</td> <td>Cbc_D</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=7> <a href="##sec:Options_for_OA_decomposition">Options for OA decomposition</a> </th> </tr> <tr> <td> <a href="##sec:oa_decomposition">oa_decomposition</a> </td> <td>S</td> <td>no</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:oa_log_frequency">oa_log_frequency</a> </td> <td>F</td> <td>100</td> <td> +</td> <td>-</td> <td>-</td> <td>+</td> </tr> <tr> <td> <a href="##sec:oa_log_level">oa_log_level</a> </td> <td>I</td> <td>1</td> <td> +</td> <td>-</td> <td>-</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Options_for_ecp_cuts_generation">Options for ecp cuts generation</a> </th> </tr> <tr> <td> <a href="##sec:ecp_abs_tol">ecp_abs_tol</a> </td> <td>F</td> <td>1e-06</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:ecp_max_rounds">ecp_max_rounds</a> </td> <td>I</td> <td>5</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:ecp_propability_factor">ecp_propability_factor</a> </td> <td>F</td> <td>10</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:ecp_rel_tol">ecp_rel_tol</a> </td> <td>F</td> <td>0</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:filmint_ecp_cuts">filmint_ecp_cuts</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Options_for_feasibility_checker_using_OA_cuts">Options for feasibility checker using OA cuts</a> </th> </tr> <tr> <td> <a href="##sec:feas_check_cut_types">feas_check_cut_types</a> </td> <td>S</td> <td>outer-approx</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:feas_check_discard_policy">feas_check_discard_policy</a> </td> <td>S</td> <td>detect-cycles</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:generate_benders_after_so_many_oa">generate_benders_after_so_many_oa</a> </td> <td>I</td> <td>5000</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Options_for_feasibility_pump">Options for feasibility pump</a> </th> </tr> <tr> <td> <a href="##sec:fp_log_frequency">fp_log_frequency</a> </td> <td>F</td> <td>100</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:fp_log_level">fp_log_level</a> </td> <td>I</td> <td>1</td> <td> -</td> <td>-</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Options_for_non-convex_problems">Options for non-convex problems</a> </th> </tr> <tr> <td> <a href="##sec:coeff_var_threshold">coeff_var_threshold</a> </td> <td>F</td> <td>0.1</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:dynamic_def_cutoff_decr">dynamic_def_cutoff_decr</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:first_perc_for_cutoff_decr">first_perc_for_cutoff_decr</a> </td> <td>F</td> <td>-0.02</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:max_consecutive_infeasible">max_consecutive_infeasible</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:num_resolve_at_infeasibles">num_resolve_at_infeasibles</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:num_resolve_at_node">num_resolve_at_node</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:num_resolve_at_root">num_resolve_at_root</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="##sec:second_perc_for_cutoff_decr">second_perc_for_cutoff_decr</a> </td> <td>F</td> <td>-0.05</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=7> <a href="##sec:Outer_Approximation_cuts_generation">Outer Approximation cuts generation</a> </th> </tr> <tr> <td> <a href="##sec:add_only_violated_oa">add_only_violated_oa</a> </td> <td>S</td> <td>no</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:oa_cuts_log_level">oa_cuts_log_level</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:oa_cuts_scope">oa_cuts_scope</a> </td> <td>S</td> <td>global</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:tiny_element">tiny_element</a> </td> <td>F</td> <td>1e-08</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:very_tiny_element">very_tiny_element</a> </td> <td>F</td> <td>1e-17</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Output_ond_log-levels_options">Output ond log-levels options</a> </th> </tr> <tr> <td> <a href="##sec:bb_log_interval">bb_log_interval</a> </td> <td>I</td> <td>100</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:bb_log_level">bb_log_level</a> </td> <td>I</td> <td>1</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:lp_log_level">lp_log_level</a> </td> <td>I</td> <td>0</td> <td> -</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:nlp_log_at_root">nlp_log_at_root</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:Strong_branching_setup">Strong branching setup</a> </th> </tr> <tr> <td> <a href="##sec:candidate_sort_criterion">candidate_sort_criterion</a> </td> <td>S</td> <td>best-ps-cost</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:maxmin_crit_have_sol">maxmin_crit_have_sol</a> </td> <td>F</td> <td>0.1</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:maxmin_crit_no_sol">maxmin_crit_no_sol</a> </td> <td>F</td> <td>0.7</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:min_number_strong_branch">min_number_strong_branch</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:number_before_trust_list">number_before_trust_list</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:number_look_ahead">number_look_ahead</a> </td> <td>I</td> <td>0</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:number_strong_branch_root">number_strong_branch_root</a> </td> <td>I</td> <td>INT_MAX</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:setup_pseudo_frac">setup_pseudo_frac</a> </td> <td>F</td> <td>0.5</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:trust_strong_branching_for_pseudo_cost">trust_strong_branching_for_pseudo_cost</a> </td> <td>S</td> <td>yes</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=7> <a href="##sec:nlp_interface_option">nlp interface option</a> </th> </tr> <tr> <td> <a href="##sec:file_solution">file_solution</a> </td> <td>S</td> <td>no</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:nlp_log_level">nlp_log_level</a> </td> <td>I</td> <td>1</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:nlp_solver">nlp_solver</a> </td> <td>S</td> <td>Ipopt</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="##sec:warm_start">warm_start</a> </td> <td>S</td> <td>none</td> <td> +</td> <td>-</td> <td>-</td> <td>-</td> </tr> </tr> </table> 
17   <a 
18 id="subsection.0.1"></a>
19   <h4 class="subsectionHead"><span class="titlemark">0.1   </span> <a 
20 id="x1-10000.1"></a>Algorithm choice</h4>
21<a 
22 id="section*.1"></a>
23<!--l. 863--><p class="noindent" ><span class="paragraphHead"><a 
24 id="x1-20000.1"></a><span 
25class="cmbx-10">algorithm:</span></span> Choice of the algorithm.
26<br class="newline" />This will preset some of the options of bonmin depending on the algorithm choice.
27The default value for this string option is &#8221;B-BB&#8221;.
28<br class="newline" />Possible values:
29     <ul class="itemize1">
30     <li class="itemize">B-BB: simple branch-and-bound algorithm,
31     </li>
32     <li class="itemize">B-OA: OA Decomposition algorithm,
33     </li>
34     <li class="itemize">B-QG: Quesada and Grossmann branch-and-cut algorithm,
35     </li>
36     <li class="itemize">B-Hyb: hybrid outer approximation based branch-and-cut,
37     </li>
38     <li class="itemize">B-Ecp: ecp cuts based branch-and-cut a la FilMINT.
39     </li>
40     <li class="itemize">B-iFP: Iterated Feasibility Pump for MINLP.</li></ul>
41   <a 
42 id="subsection.0.2"></a>
43   <h4 class="subsectionHead"><span class="titlemark">0.2   </span> <a 
44 id="x1-30000.2"></a>Branch-and-bound options</h4>
45<a 
46 id="section*.2"></a>
47<!--l. 880--><p class="noindent" ><span class="paragraphHead"><a 
48 id="x1-40000.2"></a><span 
49class="cmbx-10">allowable</span><span 
50class="cmbx-10">_fraction</span><span 
51class="cmbx-10">_gap:</span></span> Specify the value of relative gap under which the
52algorithm stops.
53<br class="newline" />Stop the tree search when the gap between the objective value of the best known
54solution and the best bound on the objective of any solution is less than this fraction
55of the absolute value of the best known solution value. The valid range for this real
56option is <span 
57class="cmsy-10">-</span>1 <span 
58class="cmsy-10">&#x22C5; </span>10<sup><span 
59class="cmr-7">+20</span></sup> <span 
60class="cmsy-10">&#x2264;</span> <span 
61class="cmmi-10">allowable</span>_<span 
62class="cmmi-10">fraction</span>_<span 
63class="cmmi-10">gap</span> <span 
64class="cmsy-10">&#x2264; </span>1 <span 
65class="cmsy-10">&#x22C5; </span>10<sup><span 
66class="cmr-7">+20</span></sup> and its default value is
670.
68
69<a 
70 id="section*.3"></a>
71<!--l. 890--><p class="noindent" ><span class="paragraphHead"><a 
72 id="x1-50000.2"></a><span 
73class="cmbx-10">allowable</span><span 
74class="cmbx-10">_gap:</span></span> Specify the value of absolute gap under which the algorithm stops.
75<br class="newline" />Stop the tree search when the gap between the objective value of the best known
76solution and the best bound on the objective of any solution is less than this. The
77valid range for this real option is <span 
78class="cmsy-10">-</span>1 <span 
79class="cmsy-10">&#x22C5; </span>10<sup><span 
80class="cmr-7">+20</span></sup> <span 
81class="cmsy-10">&#x2264;</span> <span 
82class="cmmi-10">allowable</span>_<span 
83class="cmmi-10">gap</span> <span 
84class="cmsy-10">&#x2264; </span>1 <span 
85class="cmsy-10">&#x22C5; </span>10<sup><span 
86class="cmr-7">+20</span></sup> and its
87default value is 0.
88<a 
89 id="section*.4"></a>
90<!--l. 899--><p class="noindent" ><span class="paragraphHead"><a 
91 id="x1-60000.2"></a><span 
92class="cmbx-10">cutoff:</span></span> Specify cutoff value.
93<br class="newline" />cutoff should be the value of a feasible solution known by the user (if any). The
94algorithm will only look for solutions better than cutoof. The valid range for
95this real option is <span 
96class="cmsy-10">-</span>1 <span 
97class="cmsy-10">&#x22C5; </span>10<sup><span 
98class="cmr-7">+100</span></sup> <span 
99class="cmsy-10">&#x2264;</span> <span 
100class="cmmi-10">cutoff</span> <span 
101class="cmsy-10">&#x2264; </span>1 <span 
102class="cmsy-10">&#x22C5; </span>10<sup><span 
103class="cmr-7">+100</span></sup> and its default value is
1041 <span 
105class="cmsy-10">&#x22C5; </span>10<sup><span 
106class="cmr-7">+100</span></sup>.
107<a 
108 id="section*.5"></a>
109<!--l. 907--><p class="noindent" ><span class="paragraphHead"><a 
110 id="x1-70000.2"></a><span 
111class="cmbx-10">cutoff</span><span 
112class="cmbx-10">_decr:</span></span> Specify cutoff decrement.
113<br class="newline" />Specify the amount by which cutoff is decremented below a new best upper-bound
114(usually a small positive value but in non-convex problems it may be a negative
115value). The valid range for this real option is <span 
116class="cmsy-10">-</span>1 <span 
117class="cmsy-10">&#x22C5; </span>10<sup><span 
118class="cmr-7">+10</span></sup> <span 
119class="cmsy-10">&#x2264;</span> <span 
120class="cmmi-10">cutoff</span>_<span 
121class="cmmi-10">decr</span> <span 
122class="cmsy-10">&#x2264; </span>1 <span 
123class="cmsy-10">&#x22C5; </span>10<sup><span 
124class="cmr-7">+10</span></sup>
125and its default value is 1 <span 
126class="cmsy-10">&#x22C5; </span>10<sup><span 
127class="cmsy-7">-</span><span 
128class="cmr-7">05</span></sup>.
129<a 
130 id="section*.6"></a>
131<!--l. 916--><p class="noindent" ><span class="paragraphHead"><a 
132 id="x1-80000.2"></a><span 
133class="cmbx-10">enable</span><span 
134class="cmbx-10">_dynamic</span><span 
135class="cmbx-10">_nlp:</span></span> Enable dynamic linear and quadratic rows addition in nlp
136<br class="newline" />
137   The default value for this string option is &#8221;no&#8221;.
138<br class="newline" />Possible values:
139     <ul class="itemize1">
140     <li class="itemize">no:
141     </li>
142     <li class="itemize">yes:</li></ul>
143<a 
144 id="section*.7"></a>
145<!--l. 926--><p class="noindent" ><span class="paragraphHead"><a 
146 id="x1-90000.2"></a><span 
147class="cmbx-10">integer</span><span 
148class="cmbx-10">_tolerance:</span></span> Set integer tolerance.
149<br class="newline" />Any number within that value of an integer is considered integer. The valid range for
150this real option is 0 <span 
151class="cmmi-10">&#x003C;</span> <span 
152class="cmmi-10">integer</span>_<span 
153class="cmmi-10">tolerance</span> <span 
154class="cmmi-10">&#x003C;</span> +<span 
155class="cmmi-10">inf</span> and its default value is
1561 <span 
157class="cmsy-10">&#x22C5; </span>10<sup><span 
158class="cmsy-7">-</span><span 
159class="cmr-7">06</span></sup>.
160<a 
161 id="section*.8"></a>
162<!--l. 933--><p class="noindent" ><span class="paragraphHead"><a 
163 id="x1-100000.2"></a><span 
164class="cmbx-10">iteration</span><span 
165class="cmbx-10">_limit:</span></span> Set the cumulated maximum number of iteration in the
166algorithm used to process nodes continuous relaxations in the branch-and-bound.
167<br class="newline" />value 0 deactivates option. The valid range for this integer option is
168
1690 <span 
170class="cmsy-10">&#x2264;</span> <span 
171class="cmmi-10">iteration</span>_<span 
172class="cmmi-10">limit</span> <span 
173class="cmmi-10">&#x003C;</span> +<span 
174class="cmmi-10">inf</span> and its default value is 2147483647.
175<a 
176 id="section*.9"></a>
177<!--l. 939--><p class="noindent" ><span class="paragraphHead"><a 
178 id="x1-110000.2"></a><span 
179class="cmbx-10">nlp</span><span 
180class="cmbx-10">_failure</span><span 
181class="cmbx-10">_behavior:</span></span> Set the behavior when an NLP or a series of NLP are
182unsolved by Ipopt (we call unsolved an NLP for which Ipopt is not able to guarantee
183optimality within the specified tolerances).
184<br class="newline" />If set to &#8221;fathom&#8221;, the algorithm will fathom the node when Ipopt fails to
185find a solution to the nlp at that node whithin the specified tolerances. The
186algorithm then becomes a heuristic, and the user will be warned that the
187solution might not be optimal. The default value for this string option is
188&#8221;stop&#8221;.
189<br class="newline" />Possible values:
190     <ul class="itemize1">
191     <li class="itemize">stop: Stop when failure happens.
192     </li>
193     <li class="itemize">fathom: Continue when failure happens.</li></ul>
194<a 
195 id="section*.10"></a>
196<!--l. 954--><p class="noindent" ><span class="paragraphHead"><a 
197 id="x1-120000.2"></a><span 
198class="cmbx-10">node</span><span 
199class="cmbx-10">_comparison:</span></span> Choose the node selection strategy.
200<br class="newline" />Choose the strategy for selecting the next node to be processed. The default value for
201this string option is &#8221;best-bound&#8221;.
202<br class="newline" />Possible values:
203     <ul class="itemize1">
204     <li class="itemize">best-bound: choose node with the smallest bound,
205     </li>
206     <li class="itemize">depth-first: Perform depth first search,
207     </li>
208     <li class="itemize">breadth-first: Perform breadth first search,
209     </li>
210     <li class="itemize">dynamic: Cbc dynamic strategy (starts with a depth first search and turn
211     to best bound after 3 integer feasible solutions have been found).
212     </li>
213     <li class="itemize">best-guess: choose node with smallest guessed integer solution</li></ul>
214<a 
215 id="section*.11"></a>
216<!--l. 971--><p class="noindent" ><span class="paragraphHead"><a 
217 id="x1-130000.2"></a><span 
218class="cmbx-10">node</span><span 
219class="cmbx-10">_limit:</span></span> Set the maximum number of nodes explored in the branch-and-bound
220search.
221<br class="newline" />The valid range for this integer option is 0 <span 
222class="cmsy-10">&#x2264;</span> <span 
223class="cmmi-10">node</span>_<span 
224class="cmmi-10">limit</span> <span 
225class="cmmi-10">&#x003C;</span> +<span 
226class="cmmi-10">inf</span> and its default
227value is 2147483647.
228
229<a 
230 id="section*.12"></a>
231<!--l. 977--><p class="noindent" ><span class="paragraphHead"><a 
232 id="x1-140000.2"></a><span 
233class="cmbx-10">num</span><span 
234class="cmbx-10">_cut</span><span 
235class="cmbx-10">_passes:</span></span> Set the maximum number of cut passes at regular nodes of the
236branch-and-cut.
237<br class="newline" />The valid range for this integer option is 0 <span 
238class="cmsy-10">&#x2264;</span> <span 
239class="cmmi-10">num</span>_<span 
240class="cmmi-10">cut</span>_<span 
241class="cmmi-10">passes</span> <span 
242class="cmmi-10">&#x003C;</span> +<span 
243class="cmmi-10">inf</span> and its default
244value is 1.
245<a 
246 id="section*.13"></a>
247<!--l. 983--><p class="noindent" ><span class="paragraphHead"><a 
248 id="x1-150000.2"></a><span 
249class="cmbx-10">num</span><span 
250class="cmbx-10">_cut</span><span 
251class="cmbx-10">_passes</span><span 
252class="cmbx-10">_at</span><span 
253class="cmbx-10">_root:</span></span> Set the maximum number of cut passes at regular
254nodes of the branch-and-cut.
255<br class="newline" />The valid range for this integer option is 0 <span 
256class="cmsy-10">&#x2264;</span> <span 
257class="cmmi-10">num</span>_<span 
258class="cmmi-10">cut</span>_<span 
259class="cmmi-10">passes</span>_<span 
260class="cmmi-10">at</span>_<span 
261class="cmmi-10">root</span> <span 
262class="cmmi-10">&#x003C;</span> +<span 
263class="cmmi-10">inf</span> and
264its default value is 20.
265<a 
266 id="section*.14"></a>
267<!--l. 989--><p class="noindent" ><span class="paragraphHead"><a 
268 id="x1-160000.2"></a><span 
269class="cmbx-10">number</span><span 
270class="cmbx-10">_before</span><span 
271class="cmbx-10">_trust:</span></span> Set the number of branches on a variable before its pseudo
272costs are to be believed in dynamic strong branching.
273<br class="newline" />A value of 0 disables pseudo costs. The valid range for this integer option is
2740 <span 
275class="cmsy-10">&#x2264;</span> <span 
276class="cmmi-10">number</span>_<span 
277class="cmmi-10">before</span>_<span 
278class="cmmi-10">trust</span> <span 
279class="cmmi-10">&#x003C;</span> +<span 
280class="cmmi-10">inf</span> and its default value is 8.
281<a 
282 id="section*.15"></a>
283<!--l. 995--><p class="noindent" ><span class="paragraphHead"><a 
284 id="x1-170000.2"></a><span 
285class="cmbx-10">number</span><span 
286class="cmbx-10">_strong</span><span 
287class="cmbx-10">_branch:</span></span> Choose the maximum number of variables considered for
288strong branching.
289<br class="newline" />Set the number of variables on which to do strong branching. The valid range for this
290integer option is 0 <span 
291class="cmsy-10">&#x2264;</span> <span 
292class="cmmi-10">number</span>_<span 
293class="cmmi-10">strong</span>_<span 
294class="cmmi-10">branch</span> <span 
295class="cmmi-10">&#x003C;</span> +<span 
296class="cmmi-10">inf</span> and its default value is
29720.
298<a 
299 id="section*.16"></a>
300<!--l. 1002--><p class="noindent" ><span class="paragraphHead"><a 
301 id="x1-180000.2"></a><span 
302class="cmbx-10">solution</span><span 
303class="cmbx-10">_limit:</span></span> Abort after that much integer feasible solution have been found by
304algorithm
305<br class="newline" />value 0 deactivates option The valid range for this integer option is
3060 <span 
307class="cmsy-10">&#x2264;</span> <span 
308class="cmmi-10">solution</span>_<span 
309class="cmmi-10">limit</span> <span 
310class="cmmi-10">&#x003C;</span> +<span 
311class="cmmi-10">inf</span> and its default value is 2147483647.
312<a 
313 id="section*.17"></a>
314<!--l. 1008--><p class="noindent" ><span class="paragraphHead"><a 
315 id="x1-190000.2"></a><span 
316class="cmbx-10">sos</span><span 
317class="cmbx-10">_constraints:</span></span> Wether or not to activate SOS constraints.
318<br class="newline" />(only type 1 SOS are supported at the moment) The default value for this string
319option is &#8221;enable&#8221;.
320<br class="newline" />Possible values:
321     <ul class="itemize1">
322     <li class="itemize">enable:
323     </li>
324     <li class="itemize">disable:</li></ul>
325
326<a 
327 id="section*.18"></a>
328<!--l. 1018--><p class="noindent" ><span class="paragraphHead"><a 
329 id="x1-200000.2"></a><span 
330class="cmbx-10">time</span><span 
331class="cmbx-10">_limit:</span></span> Set the global maximum computation time (in secs) for the algorithm.
332<br class="newline" />The valid range for this real option is 0 <span 
333class="cmsy-10">&#x2264;</span> <span 
334class="cmmi-10">time</span>_<span 
335class="cmmi-10">limit</span> <span 
336class="cmmi-10">&#x003C;</span> +<span 
337class="cmmi-10">inf</span> and its default value is
3381 <span 
339class="cmsy-10">&#x22C5; </span>10<sup><span 
340class="cmr-7">+10</span></sup>.
341<a 
342 id="section*.19"></a>
343<!--l. 1024--><p class="noindent" ><span class="paragraphHead"><a 
344 id="x1-210000.2"></a><span 
345class="cmbx-10">tree</span><span 
346class="cmbx-10">_search</span><span 
347class="cmbx-10">_strategy:</span></span> Pick a strategy for traversing the tree
348<br class="newline" />All strategies can be used in conjunction with any of the node comparison functions.
349Options which affect dfs-dive are max-backtracks-in-dive and max-dive-depth. The
350dfs-dive won&#8217;t work in a non-convex problem where objective does not decrease down
351branches. The default value for this string option is &#8221;probed-dive&#8221;.
352<br class="newline" />Possible values:
353     <ul class="itemize1">
354     <li class="itemize">top-node: Always pick the top node as sorted by the node comparison
355     function
356     </li>
357     <li class="itemize">dive: Dive in the tree if possible, otherwise pick top node as sorted by the
358     tree comparison function.
359     </li>
360     <li class="itemize">probed-dive: Dive in the tree exploring two childs before continuing the
361     dive at each level.
362     </li>
363     <li class="itemize">dfs-dive: Dive in the tree if possible doing a depth first search. Backtrack
364     on leaves or when a prescribed depth is attained or when estimate of best
365     possible integer feasible solution in subtree is worst than cutoff. Once a
366     prescribed limit of backtracks is attained pick top node as sorted by the
367     tree comparison function
368     </li>
369     <li class="itemize">dfs-dive-dynamic: Same as dfs-dive but once enough solution are found
370     switch to best-bound and if too many nodes switch to depth-first.</li></ul>
371<a 
372 id="section*.20"></a>
373<!--l. 1054--><p class="noindent" ><span class="paragraphHead"><a 
374 id="x1-220000.2"></a><span 
375class="cmbx-10">variable</span><span 
376class="cmbx-10">_selection:</span></span> Chooses variable selection strategy
377<br class="newline" />
378   The default value for this string option is &#8221;strong-branching&#8221;.
379<br class="newline" />Possible values:
380     <ul class="itemize1">
381     <li class="itemize">most-fractional: Choose most fractional variable
382     </li>
383     <li class="itemize">strong-branching: Perform strong branching
384
385     </li>
386     <li class="itemize">reliability-branching: Use reliability branching
387     </li>
388     <li class="itemize">curvature-estimator: Use curvature estimation to select branching variable
389     </li>
390     <li class="itemize">qp-strong-branching: Perform strong branching with QP approximation
391     </li>
392     <li class="itemize">lp-strong-branching: Perform strong branching with LP approximation
393     </li>
394     <li class="itemize">nlp-strong-branching: Perform strong branching with NLP approximation
395     </li>
396     <li class="itemize">osi-simple: Osi method to do simple branching
397     </li>
398     <li class="itemize">osi-strong: Osi method to do strong branching
399     </li>
400     <li class="itemize">random: Method to choose branching variable randomly</li></ul>
401   <a 
402 id="subsection.0.3"></a>
403   <h4 class="subsectionHead"><span class="titlemark">0.3   </span> <a 
404 id="x1-230000.3"></a>MILP cutting planes in hybrid</h4>
405<a 
406 id="section*.21"></a>
407<!--l. 1075--><p class="noindent" ><span class="paragraphHead"><a 
408 id="x1-240000.3"></a><span 
409class="cmbx-10">2mir</span><span 
410class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating 2-MIR cuts in
411branch-and-cut
412<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
413nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
414root node, if k=-99 generate cuts only at the root node, if k=0 or 100 do not generate
415cuts. The valid range for this integer option is <span 
416class="cmsy-10">-</span>100 <span 
417class="cmsy-10">&#x2264;</span> 2<span 
418class="cmmi-10">mir</span>_<span 
419class="cmmi-10">cuts</span> <span 
420class="cmmi-10">&#x003C;</span> +<span 
421class="cmmi-10">inf</span> and its
422default value is 0.
423<a 
424 id="section*.22"></a>
425<!--l. 1086--><p class="noindent" ><span class="paragraphHead"><a 
426 id="x1-250000.3"></a><span 
427class="cmbx-10">Gomory</span><span 
428class="cmbx-10">_cuts:</span></span> Frequency k (in terms of nodes) for generating Gomory cuts in
429branch-and-cut.
430<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
431nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
432root node, if k=-99 generate cuts only at the root node, if k=0 or 100 do not generate
433cuts. The valid range for this integer option is <span 
434class="cmsy-10">-</span>100 <span 
435class="cmsy-10">&#x2264;</span> <span 
436class="cmmi-10">Gomory</span>_<span 
437class="cmmi-10">cuts</span> <span 
438class="cmmi-10">&#x003C;</span> +<span 
439class="cmmi-10">inf</span> and its
440default value is <span 
441class="cmsy-10">-</span>5.
442
443<a 
444 id="section*.23"></a>
445<!--l. 1097--><p class="noindent" ><span class="paragraphHead"><a 
446 id="x1-260000.3"></a><span 
447class="cmbx-10">clique</span><span 
448class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating clique cuts in
449branch-and-cut
450<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
451nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
452root node, if k=-99 generate cuts only at the root node, if k=0 or 100 do not generate
453cuts. The valid range for this integer option is <span 
454class="cmsy-10">-</span>100 <span 
455class="cmsy-10">&#x2264;</span> <span 
456class="cmmi-10">clique</span>_<span 
457class="cmmi-10">cuts</span> <span 
458class="cmmi-10">&#x003C;</span> +<span 
459class="cmmi-10">inf</span> and its
460default value is <span 
461class="cmsy-10">-</span>5.
462<a 
463 id="section*.24"></a>
464<!--l. 1108--><p class="noindent" ><span class="paragraphHead"><a 
465 id="x1-270000.3"></a><span 
466class="cmbx-10">cover</span><span 
467class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating cover cuts in
468branch-and-cut
469<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
470nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
471root node, if k=-99 generate cuts only at the root node, if k=0 or 100 do not generate
472cuts. The valid range for this integer option is <span 
473class="cmsy-10">-</span>100 <span 
474class="cmsy-10">&#x2264;</span> <span 
475class="cmmi-10">cover</span>_<span 
476class="cmmi-10">cuts</span> <span 
477class="cmmi-10">&#x003C;</span> +<span 
478class="cmmi-10">inf</span> and its
479default value is <span 
480class="cmsy-10">-</span>5.
481<a 
482 id="section*.25"></a>
483<!--l. 1119--><p class="noindent" ><span class="paragraphHead"><a 
484 id="x1-280000.3"></a><span 
485class="cmbx-10">flow</span><span 
486class="cmbx-10">_cover</span><span 
487class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating flow cover cuts in
488branch-and-cut
489<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
490nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
491root node, if k=-99 generate cuts only at the root node, if k=0 or 100 do not generate
492cuts. The valid range for this integer option is <span 
493class="cmsy-10">-</span>100 <span 
494class="cmsy-10">&#x2264;</span> <span 
495class="cmmi-10">flow</span>_<span 
496class="cmmi-10">cover</span>_<span 
497class="cmmi-10">cuts</span> <span 
498class="cmmi-10">&#x003C;</span> +<span 
499class="cmmi-10">inf</span> and
500its default value is <span 
501class="cmsy-10">-</span>5.
502<a 
503 id="section*.26"></a>
504<!--l. 1130--><p class="noindent" ><span class="paragraphHead"><a 
505 id="x1-290000.3"></a><span 
506class="cmbx-10">lift</span><span 
507class="cmbx-10">_and</span><span 
508class="cmbx-10">_project</span><span 
509class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating lift-and-project
510cuts in branch-and-cut
511<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every
512-k nodes but Cbc may decide to stop generating cuts, if not enough are
513generated at the root node, if k=-99 generate cuts only at the root node, if
514k=0 or 100 do not generate cuts. The valid range for this integer option is
515<span 
516class="cmsy-10">-</span>100 <span 
517class="cmsy-10">&#x2264;</span> <span 
518class="cmmi-10">lift</span>_<span 
519class="cmmi-10">and</span>_<span 
520class="cmmi-10">project</span>_<span 
521class="cmmi-10">cuts</span> <span 
522class="cmmi-10">&#x003C;</span> +<span 
523class="cmmi-10">inf</span> and its default value is 0.
524<a 
525 id="section*.27"></a>
526<!--l. 1141--><p class="noindent" ><span class="paragraphHead"><a 
527 id="x1-300000.3"></a><span 
528class="cmbx-10">mir</span><span 
529class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating MIR cuts in branch-and-cut
530<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
531nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
532root node, if k=-99 generate cuts only at the root node, if k=0 or 100 do not generate
533cuts. The valid range for this integer option is <span 
534class="cmsy-10">-</span>100 <span 
535class="cmsy-10">&#x2264;</span> <span 
536class="cmmi-10">mir</span>_<span 
537class="cmmi-10">cuts</span> <span 
538class="cmmi-10">&#x003C;</span> +<span 
539class="cmmi-10">inf</span> and its
540default value is <span 
541class="cmsy-10">-</span>5.
542
543<a 
544 id="section*.28"></a>
545<!--l. 1152--><p class="noindent" ><span class="paragraphHead"><a 
546 id="x1-310000.3"></a><span 
547class="cmbx-10">reduce</span><span 
548class="cmbx-10">_and</span><span 
549class="cmbx-10">_split</span><span 
550class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating
551reduce-and-split cuts in branch-and-cut
552<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every
553-k nodes but Cbc may decide to stop generating cuts, if not enough are
554generated at the root node, if k=-99 generate cuts only at the root node, if
555k=0 or 100 do not generate cuts. The valid range for this integer option is
556<span 
557class="cmsy-10">-</span>100 <span 
558class="cmsy-10">&#x2264;</span> <span 
559class="cmmi-10">reduce</span>_<span 
560class="cmmi-10">and</span>_<span 
561class="cmmi-10">split</span>_<span 
562class="cmmi-10">cuts</span> <span 
563class="cmmi-10">&#x003C;</span> +<span 
564class="cmmi-10">inf</span> and its default value is 0.
565   <a 
566 id="subsection.0.4"></a>
567   <h4 class="subsectionHead"><span class="titlemark">0.4   </span> <a 
568 id="x1-320000.4"></a>MINLP Heuristics</h4>
569<a 
570 id="section*.29"></a>
571<!--l. 1165--><p class="noindent" ><span class="paragraphHead"><a 
572 id="x1-330000.4"></a><span 
573class="cmbx-10">feasibility</span><span 
574class="cmbx-10">_pump</span><span 
575class="cmbx-10">_objective</span><span 
576class="cmbx-10">_norm:</span></span> Norm of feasibility pump objective function
577<br class="newline" />The valid range for this integer option is 1 <span 
578class="cmsy-10">&#x2264;</span> <span 
579class="cmmi-10">feasibility</span>_<span 
580class="cmmi-10">pump</span>_<span 
581class="cmmi-10">objective</span>_<span 
582class="cmmi-10">norm</span> <span 
583class="cmsy-10">&#x2264; </span>2
584and its default value is 1.
585<a 
586 id="section*.30"></a>
587<!--l. 1171--><p class="noindent" ><span class="paragraphHead"><a 
588 id="x1-340000.4"></a><span 
589class="cmbx-10">heuristic</span><span 
590class="cmbx-10">_RINS:</span></span> if yes runs the RINS heuristic
591<br class="newline" />
592   The default value for this string option is &#8221;no&#8221;.
593<br class="newline" />Possible values:
594     <ul class="itemize1">
595     <li class="itemize">no: don&#8217;t run it
596     </li>
597     <li class="itemize">yes: runs the heuristic</li></ul>
598<a 
599 id="section*.31"></a>
600<!--l. 1181--><p class="noindent" ><span class="paragraphHead"><a 
601 id="x1-350000.4"></a><span 
602class="cmbx-10">heuristic</span><span 
603class="cmbx-10">_dive</span><span 
604class="cmbx-10">_MIP</span><span 
605class="cmbx-10">_vectorLength:</span></span> if yes runs the Dive MIP VectorLength
606heuristic
607<br class="newline" />
608   The default value for this string option is &#8221;no&#8221;.
609<br class="newline" />Possible values:
610     <ul class="itemize1">
611     <li class="itemize">no: don&#8217;t run it
612     </li>
613     <li class="itemize">yes: runs the heuristic</li></ul>
614
615<a 
616 id="section*.32"></a>
617<!--l. 1191--><p class="noindent" ><span class="paragraphHead"><a 
618 id="x1-360000.4"></a><span 
619class="cmbx-10">heuristic</span><span 
620class="cmbx-10">_dive</span><span 
621class="cmbx-10">_fractional:</span></span> if yes runs the Dive Fractional heuristic
622<br class="newline" />
623   The default value for this string option is &#8221;no&#8221;.
624<br class="newline" />Possible values:
625     <ul class="itemize1">
626     <li class="itemize">no: don&#8217;t run it
627     </li>
628     <li class="itemize">yes: runs the heuristic</li></ul>
629<a 
630 id="section*.33"></a>
631<!--l. 1201--><p class="noindent" ><span class="paragraphHead"><a 
632 id="x1-370000.4"></a><span 
633class="cmbx-10">heuristic</span><span 
634class="cmbx-10">_dive</span><span 
635class="cmbx-10">_vectorLength:</span></span> if yes runs the Dive VectorLength heuristic
636<br class="newline" />
637   The default value for this string option is &#8221;no&#8221;.
638<br class="newline" />Possible values:
639     <ul class="itemize1">
640     <li class="itemize">no: don&#8217;t run it
641     </li>
642     <li class="itemize">yes: runs the heuristic</li></ul>
643<a 
644 id="section*.34"></a>
645<!--l. 1211--><p class="noindent" ><span class="paragraphHead"><a 
646 id="x1-380000.4"></a><span 
647class="cmbx-10">heuristic</span><span 
648class="cmbx-10">_feasibility</span><span 
649class="cmbx-10">_pump:</span></span> whether the heuristic feasibility pump should be used
650<br class="newline" />
651   The default value for this string option is &#8221;no&#8221;.
652<br class="newline" />Possible values:
653     <ul class="itemize1">
654     <li class="itemize">no: don&#8217;t use it
655     </li>
656     <li class="itemize">yes: use it</li></ul>
657<a 
658 id="section*.35"></a>
659<!--l. 1221--><p class="noindent" ><span class="paragraphHead"><a 
660 id="x1-390000.4"></a><span 
661class="cmbx-10">pump</span><span 
662class="cmbx-10">_for</span><span 
663class="cmbx-10">_minlp:</span></span> if yes runs FP for MINLP
664<br class="newline" />
665   The default value for this string option is &#8221;no&#8221;.
666<br class="newline" />Possible values:
667     <ul class="itemize1">
668     <li class="itemize">no: don&#8217;t run it
669     </li>
670     <li class="itemize">yes: runs the heuristic</li></ul>
671
672   <a 
673 id="subsection.0.5"></a>
674   <h4 class="subsectionHead"><span class="titlemark">0.5   </span> <a 
675 id="x1-400000.5"></a>MINLP heuristics</h4>
676<a 
677 id="section*.36"></a>
678<!--l. 1233--><p class="noindent" ><span class="paragraphHead"><a 
679 id="x1-410000.5"></a><span 
680class="cmbx-10">heuristic</span><span 
681class="cmbx-10">_dive</span><span 
682class="cmbx-10">_MIP</span><span 
683class="cmbx-10">_fractional:</span></span> if yes runs the Dive MIP Fractional heuristic
684<br class="newline" />
685   The default value for this string option is &#8221;no&#8221;.
686<br class="newline" />Possible values:
687     <ul class="itemize1">
688     <li class="itemize">no: don&#8217;t run it
689     </li>
690     <li class="itemize">yes: runs the heuristic</li></ul>
691   <a 
692 id="subsection.0.6"></a>
693   <h4 class="subsectionHead"><span class="titlemark">0.6   </span> <a 
694 id="x1-420000.6"></a>Nlp solution robustness</h4>
695<a 
696 id="section*.37"></a>
697<!--l. 1245--><p class="noindent" ><span class="paragraphHead"><a 
698 id="x1-430000.6"></a><span 
699class="cmbx-10">max</span><span 
700class="cmbx-10">_consecutive</span><span 
701class="cmbx-10">_failures:</span></span> (temporarily removed) Number <span 
702class="cmmi-10">n </span>of consecutive
703unsolved problems before aborting a branch of the tree.
704<br class="newline" />When <span 
705class="cmmi-10">n &#x003E; </span>0, continue exploring a branch of the tree until <span 
706class="cmmi-10">n </span>consecutive problems in
707the branch are unsolved (we call unsolved a problem for which Ipopt can not
708guarantee optimality within the specified tolerances). The valid range for this integer
709option is 0 <span 
710class="cmsy-10">&#x2264;</span> <span 
711class="cmmi-10">max</span>_<span 
712class="cmmi-10">consecutive</span>_<span 
713class="cmmi-10">failures</span> <span 
714class="cmmi-10">&#x003C;</span> +<span 
715class="cmmi-10">inf</span> and its default value is
71610.
717<a 
718 id="section*.38"></a>
719<!--l. 1255--><p class="noindent" ><span class="paragraphHead"><a 
720 id="x1-440000.6"></a><span 
721class="cmbx-10">max</span><span 
722class="cmbx-10">_random</span><span 
723class="cmbx-10">_point</span><span 
724class="cmbx-10">_radius:</span></span> Set max value r for coordinate of a random point.
725<br class="newline" />When picking a random point coordinate i will be in the interval [min(max(l,-r),u-r),
726max(min(u,r),l+r)] (where l is the lower bound for the variable and u is its upper bound)
727The valid range for this real option is 0 <span 
728class="cmmi-10">&#x003C;</span> <span 
729class="cmmi-10">max</span>_<span 
730class="cmmi-10">random</span>_<span 
731class="cmmi-10">point</span>_<span 
732class="cmmi-10">radius</span> <span 
733class="cmmi-10">&#x003C;</span> +<span 
734class="cmmi-10">inf</span> and
735its default value is 100000.
736<a 
737 id="section*.39"></a>
738<!--l. 1264--><p class="noindent" ><span class="paragraphHead"><a 
739 id="x1-450000.6"></a><span 
740class="cmbx-10">num</span><span 
741class="cmbx-10">_iterations</span><span 
742class="cmbx-10">_suspect:</span></span> Number of iterations over which a node is considered
743&#8221;suspect&#8221; (for debugging purposes only, see detailed documentation).
744<br class="newline" />When the number of iterations to solve a node is above this number, the
745subproblem at this node is considered to be suspect and it will be outputed in a
746file (set to -1 to deactivate this). The valid range for this integer option is
747<span 
748class="cmsy-10">-</span>1 <span 
749class="cmsy-10">&#x2264;</span> <span 
750class="cmmi-10">num</span>_<span 
751class="cmmi-10">iterations</span>_<span 
752class="cmmi-10">suspect</span> <span 
753class="cmmi-10">&#x003C;</span> +<span 
754class="cmmi-10">inf</span> and its default value is <span 
755class="cmsy-10">-</span>1.
756
757<a 
758 id="section*.40"></a>
759<!--l. 1273--><p class="noindent" ><span class="paragraphHead"><a 
760 id="x1-460000.6"></a><span 
761class="cmbx-10">num</span><span 
762class="cmbx-10">_retry</span><span 
763class="cmbx-10">_unsolved</span><span 
764class="cmbx-10">_random</span><span 
765class="cmbx-10">_point:</span></span> Number <span 
766class="cmmi-10">k </span>of times that the algorithm will
767try to resolve an unsolved NLP with a random starting point (we call unsolved an
768NLP for which Ipopt is not able to guarantee optimality within the specified
769tolerances).
770<br class="newline" />When Ipopt fails to solve a continuous NLP sub-problem, if <span 
771class="cmmi-10">k &#x003E; </span>0, the algorithm will
772try again to solve the failed NLP with <span 
773class="cmmi-10">k </span>new randomly chosen starting points or until
774the problem is solved with success. The valid range for this integer option is
7750 <span 
776class="cmsy-10">&#x2264;</span> <span 
777class="cmmi-10">num</span>_<span 
778class="cmmi-10">retry</span>_<span 
779class="cmmi-10">unsolved</span>_<span 
780class="cmmi-10">random</span>_<span 
781class="cmmi-10">point</span> <span 
782class="cmmi-10">&#x003C;</span> +<span 
783class="cmmi-10">inf</span> and its default value is
7840.
785<a 
786 id="section*.41"></a>
787<!--l. 1283--><p class="noindent" ><span class="paragraphHead"><a 
788 id="x1-470000.6"></a><span 
789class="cmbx-10">random</span><span 
790class="cmbx-10">_point</span><span 
791class="cmbx-10">_perturbation</span><span 
792class="cmbx-10">_interval:</span></span> Amount by which starting point is
793perturbed when choosing to pick random point by perturbating starting point
794<br class="newline" />The valid range for this real option is 0 <span 
795class="cmmi-10">&#x003C;</span> <span 
796class="cmmi-10">random</span>_<span 
797class="cmmi-10">point</span>_<span 
798class="cmmi-10">perturbation</span>_<span 
799class="cmmi-10">interval</span> <span 
800class="cmmi-10">&#x003C;</span> +<span 
801class="cmmi-10">inf</span>
802and its default value is 1.
803<a 
804 id="section*.42"></a>
805<!--l. 1289--><p class="noindent" ><span class="paragraphHead"><a 
806 id="x1-480000.6"></a><span 
807class="cmbx-10">random</span><span 
808class="cmbx-10">_point</span><span 
809class="cmbx-10">_type:</span></span> method to choose a random starting point
810<br class="newline" />
811   The default value for this string option is &#8221;Jon&#8221;.
812<br class="newline" />Possible values:
813     <ul class="itemize1">
814     <li class="itemize">Jon: Choose random point uniformly between the bounds
815     </li>
816     <li class="itemize">Andreas: perturb the starting point of the problem within a prescribed
817     interval
818     </li>
819     <li class="itemize">Claudia: perturb the starting point using the perturbation radius suffix
820     information</li></ul>
821   <a 
822 id="subsection.0.7"></a>
823   <h4 class="subsectionHead"><span class="titlemark">0.7   </span> <a 
824 id="x1-490000.7"></a>Nlp solve options in B-Hyb</h4>
825<a 
826 id="section*.43"></a>
827<!--l. 1304--><p class="noindent" ><span class="paragraphHead"><a 
828 id="x1-500000.7"></a><span 
829class="cmbx-10">nlp</span><span 
830class="cmbx-10">_solve</span><span 
831class="cmbx-10">_frequency:</span></span> Specify the frequency (in terms of nodes) at which NLP
832relaxations are solved in B-Hyb.
833<br class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
834this integer option is 0 <span 
835class="cmsy-10">&#x2264;</span> <span 
836class="cmmi-10">nlp</span>_<span 
837class="cmmi-10">solve</span>_<span 
838class="cmmi-10">frequency</span> <span 
839class="cmmi-10">&#x003C;</span> +<span 
840class="cmmi-10">inf</span> and its default value is
84110.
842
843<a 
844 id="section*.44"></a>
845<!--l. 1311--><p class="noindent" ><span class="paragraphHead"><a 
846 id="x1-510000.7"></a><span 
847class="cmbx-10">nlp</span><span 
848class="cmbx-10">_solve</span><span 
849class="cmbx-10">_max</span><span 
850class="cmbx-10">_depth:</span></span> Set maximum depth in the tree at which NLP relaxations
851are solved in B-Hyb.
852<br class="newline" />A depth of 0 amounts to to never solve the NLP relaxation. The valid range for this
853integer option is 0 <span 
854class="cmsy-10">&#x2264;</span> <span 
855class="cmmi-10">nlp</span>_<span 
856class="cmmi-10">solve</span>_<span 
857class="cmmi-10">max</span>_<span 
858class="cmmi-10">depth</span> <span 
859class="cmmi-10">&#x003C;</span> +<span 
860class="cmmi-10">inf</span> and its default value is
86110.
862<a 
863 id="section*.45"></a>
864<!--l. 1318--><p class="noindent" ><span class="paragraphHead"><a 
865 id="x1-520000.7"></a><span 
866class="cmbx-10">nlp</span><span 
867class="cmbx-10">_solves</span><span 
868class="cmbx-10">_per</span><span 
869class="cmbx-10">_depth:</span></span> Set average number of nodes in the tree at which NLP
870relaxations are solved in B-Hyb for each depth.
871<br class="newline" />The valid range for this real option is 0 <span 
872class="cmsy-10">&#x2264;</span> <span 
873class="cmmi-10">nlp</span>_<span 
874class="cmmi-10">solves</span>_<span 
875class="cmmi-10">per</span>_<span 
876class="cmmi-10">depth</span> <span 
877class="cmmi-10">&#x003C;</span> +<span 
878class="cmmi-10">inf</span> and its
879default value is 1 <span 
880class="cmsy-10">&#x22C5; </span>10<sup><span 
881class="cmr-7">+100</span></sup>.
882   <a 
883 id="subsection.0.8"></a>
884   <h4 class="subsectionHead"><span class="titlemark">0.8   </span> <a 
885 id="x1-530000.8"></a>Options for MILP solver</h4>
886<a 
887 id="section*.46"></a>
888<!--l. 1326--><p class="noindent" ><span class="paragraphHead"><a 
889 id="x1-540000.8"></a><span 
890class="cmbx-10">milp</span><span 
891class="cmbx-10">_log</span><span 
892class="cmbx-10">_level:</span></span> specify MILP solver log level.
893<br class="newline" />Set the level of output of the MILP subsolver in OA : 0 - none, 1 - minimal,
8942 - normal low, 3 - normal high The valid range for this integer option is
8950 <span 
896class="cmsy-10">&#x2264;</span> <span 
897class="cmmi-10">milp</span>_<span 
898class="cmmi-10">log</span>_<span 
899class="cmmi-10">level</span> <span 
900class="cmsy-10">&#x2264; </span>3 and its default value is 0.
901<a 
902 id="section*.47"></a>
903<!--l. 1334--><p class="noindent" ><span class="paragraphHead"><a 
904 id="x1-550000.8"></a><span 
905class="cmbx-10">milp</span><span 
906class="cmbx-10">_solver:</span></span> Choose the subsolver to solve MILP sub-problems in OA
907decompositions.
908<br class="newline" />To use Cplex, a valid license is required and you should have compiled OsiCpx in
909COIN-OR (see Osi documentation). The default value for this string option is
910&#8221;Cbc_D&#8221;.
911<br class="newline" />Possible values:
912     <ul class="itemize1">
913     <li class="itemize">Cbc_D: Coin Branch and Cut with its default
914     </li>
915     <li class="itemize">Cbc_Par: Coin Branch and Cut with passed parameters
916     </li>
917     <li class="itemize">Cplex: Ilog Cplex</li></ul>
918   <a 
919 id="subsection.0.9"></a>
920   <h4 class="subsectionHead"><span class="titlemark">0.9   </span> <a 
921 id="x1-560000.9"></a>Options for OA decomposition</h4>
922
923<a 
924 id="section*.48"></a>
925<!--l. 1349--><p class="noindent" ><span class="paragraphHead"><a 
926 id="x1-570000.9"></a><span 
927class="cmbx-10">oa</span><span 
928class="cmbx-10">_decomposition:</span></span> If yes do initial OA decomposition
929<br class="newline" />
930   The default value for this string option is &#8221;no&#8221;.
931<br class="newline" />Possible values:
932     <ul class="itemize1">
933     <li class="itemize">no:
934     </li>
935     <li class="itemize">yes:</li></ul>
936<a 
937 id="section*.49"></a>
938<!--l. 1359--><p class="noindent" ><span class="paragraphHead"><a 
939 id="x1-580000.9"></a><span 
940class="cmbx-10">oa</span><span 
941class="cmbx-10">_log</span><span 
942class="cmbx-10">_frequency:</span></span> display an update on lower and upper bounds in OA every n
943seconds
944<br class="newline" />The valid range for this real option is 0 <span 
945class="cmmi-10">&#x003C;</span> <span 
946class="cmmi-10">oa</span>_<span 
947class="cmmi-10">log</span>_<span 
948class="cmmi-10">frequency</span> <span 
949class="cmmi-10">&#x003C;</span> +<span 
950class="cmmi-10">inf</span> and its default
951value is 100.
952<a 
953 id="section*.50"></a>
954<!--l. 1365--><p class="noindent" ><span class="paragraphHead"><a 
955 id="x1-590000.9"></a><span 
956class="cmbx-10">oa</span><span 
957class="cmbx-10">_log</span><span 
958class="cmbx-10">_level:</span></span> specify OA iterations log level.
959<br class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
960The valid range for this integer option is 0 <span 
961class="cmsy-10">&#x2264;</span> <span 
962class="cmmi-10">oa</span>_<span 
963class="cmmi-10">log</span>_<span 
964class="cmmi-10">level</span> <span 
965class="cmsy-10">&#x2264; </span>2 and its default value is
9661.
967   <a 
968 id="subsection.0.10"></a>
969   <h4 class="subsectionHead"><span class="titlemark">0.10   </span> <a 
970 id="x1-600000.10"></a>Options for ecp cuts generation</h4>
971<a 
972 id="section*.51"></a>
973<!--l. 1374--><p class="noindent" ><span class="paragraphHead"><a 
974 id="x1-610000.10"></a><span 
975class="cmbx-10">ecp</span><span 
976class="cmbx-10">_abs</span><span 
977class="cmbx-10">_tol:</span></span> Set the absolute termination tolerance for ECP rounds.
978<br class="newline" />The valid range for this real option is 0 <span 
979class="cmsy-10">&#x2264;</span> <span 
980class="cmmi-10">ecp</span>_<span 
981class="cmmi-10">abs</span>_<span 
982class="cmmi-10">tol</span> <span 
983class="cmmi-10">&#x003C;</span> +<span 
984class="cmmi-10">inf</span> and its default value is
9851 <span 
986class="cmsy-10">&#x22C5; </span>10<sup><span 
987class="cmsy-7">-</span><span 
988class="cmr-7">06</span></sup>.
989<a 
990 id="section*.52"></a>
991<!--l. 1380--><p class="noindent" ><span class="paragraphHead"><a 
992 id="x1-620000.10"></a><span 
993class="cmbx-10">ecp</span><span 
994class="cmbx-10">_max</span><span 
995class="cmbx-10">_rounds:</span></span> Set the maximal number of rounds of ECP cuts.
996<br class="newline" />The valid range for this integer option is 0 <span 
997class="cmsy-10">&#x2264;</span> <span 
998class="cmmi-10">ecp</span>_<span 
999class="cmmi-10">max</span>_<span 
1000class="cmmi-10">rounds</span> <span 
1001class="cmmi-10">&#x003C;</span> +<span 
1002class="cmmi-10">inf</span> and its
1003default value is 5.
1004<a 
1005 id="section*.53"></a>
1006<!--l. 1386--><p class="noindent" ><span class="paragraphHead"><a 
1007 id="x1-630000.10"></a><span 
1008class="cmbx-10">ecp</span><span 
1009class="cmbx-10">_propability</span><span 
1010class="cmbx-10">_factor:</span></span> Factor appearing in formula for skipping ECP cuts.
1011<br class="newline" />Choosing -1 disables the skipping. The valid range for this real option is
1012<span 
1013class="cmsy-10">-</span><span 
1014class="cmmi-10">inf</span> <span 
1015class="cmmi-10">&#x003C;</span> <span 
1016class="cmmi-10">ecp</span>_<span 
1017class="cmmi-10">propability</span>_<span 
1018class="cmmi-10">factor</span> <span 
1019class="cmmi-10">&#x003C;</span> +<span 
1020class="cmmi-10">inf</span> and its default value is 10.
1021
1022<a 
1023 id="section*.54"></a>
1024<!--l. 1392--><p class="noindent" ><span class="paragraphHead"><a 
1025 id="x1-640000.10"></a><span 
1026class="cmbx-10">ecp</span><span 
1027class="cmbx-10">_rel</span><span 
1028class="cmbx-10">_tol:</span></span> Set the relative termination tolerance for ECP rounds.
1029<br class="newline" />The valid range for this real option is 0 <span 
1030class="cmsy-10">&#x2264;</span> <span 
1031class="cmmi-10">ecp</span>_<span 
1032class="cmmi-10">rel</span>_<span 
1033class="cmmi-10">tol</span> <span 
1034class="cmmi-10">&#x003C;</span> +<span 
1035class="cmmi-10">inf</span> and its default value is
10360.
1037<a 
1038 id="section*.55"></a>
1039<!--l. 1398--><p class="noindent" ><span class="paragraphHead"><a 
1040 id="x1-650000.10"></a><span 
1041class="cmbx-10">filmint</span><span 
1042class="cmbx-10">_ecp</span><span 
1043class="cmbx-10">_cuts:</span></span> Specify the frequency (in terms of nodes) at which some a la
1044filmint ecp cuts are generated.
1045<br class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
1046this integer option is 0 <span 
1047class="cmsy-10">&#x2264;</span> <span 
1048class="cmmi-10">filmint</span>_<span 
1049class="cmmi-10">ecp</span>_<span 
1050class="cmmi-10">cuts</span> <span 
1051class="cmmi-10">&#x003C;</span> +<span 
1052class="cmmi-10">inf</span> and its default value is
10530.
1054   <a 
1055 id="subsection.0.11"></a>
1056   <h4 class="subsectionHead"><span class="titlemark">0.11   </span> <a 
1057 id="x1-660000.11"></a>Options for feasibility checker using OA cuts</h4>
1058<a 
1059 id="section*.56"></a>
1060<!--l. 1407--><p class="noindent" ><span class="paragraphHead"><a 
1061 id="x1-670000.11"></a><span 
1062class="cmbx-10">feas</span><span 
1063class="cmbx-10">_check</span><span 
1064class="cmbx-10">_cut</span><span 
1065class="cmbx-10">_types:</span></span> Choose the type of cuts generated when an integer feasible
1066solution is found
1067<br class="newline" />If it seems too much memory is used should try Benders to use less The default value
1068for this string option is &#8221;outer-approx&#8221;.
1069<br class="newline" />Possible values:
1070     <ul class="itemize1">
1071     <li class="itemize">outer-approx: Generate a set of Outer Approximations cuts.
1072     </li>
1073     <li class="itemize">Benders: Generate a single Benders cut.</li></ul>
1074<a 
1075 id="section*.57"></a>
1076<!--l. 1418--><p class="noindent" ><span class="paragraphHead"><a 
1077 id="x1-680000.11"></a><span 
1078class="cmbx-10">feas</span><span 
1079class="cmbx-10">_check</span><span 
1080class="cmbx-10">_discard</span><span 
1081class="cmbx-10">_policy:</span></span> How cuts from feasibility checker are discarded
1082<br class="newline" />Normally to avoid cycle cuts from feasibility checker should not be discarded in the
1083node where they are generated. However Cbc sometimes does it if no care
1084is taken which can lead to an infinite loop in Bonmin (usualy on simple
1085problems). To avoid this one can instruct Cbc to never discard a cut but if we do
1086that for all cuts it can lead to memory problems. The default policy here
1087is to detect cycles and only then impose to Cbc to keep the cut. The two
1088other alternative are to instruct Cbc to keep all cuts or to just ignore the
1089problem and hope for the best The default value for this string option is
1090&#8221;detect-cycles&#8221;.
1091<br class="newline" />Possible values:
1092     <ul class="itemize1">
1093     <li class="itemize">detect-cycles: Detect if a cycle occurs and only in this case force not to
1094     discard.
1095
1096     </li>
1097     <li class="itemize">keep-all: Force cuts from feasibility checker not to be discarded (memory
1098     hungry but sometimes better).
1099     </li>
1100     <li class="itemize">treated-as-normal: Cuts from memory checker can be discarded as any
1101     other cuts (code may cycle then)</li></ul>
1102<a 
1103 id="section*.58"></a>
1104<!--l. 1443--><p class="noindent" ><span class="paragraphHead"><a 
1105 id="x1-690000.11"></a><span 
1106class="cmbx-10">generate</span><span 
1107class="cmbx-10">_benders</span><span 
1108class="cmbx-10">_after</span><span 
1109class="cmbx-10">_so</span><span 
1110class="cmbx-10">_many</span><span 
1111class="cmbx-10">_oa:</span></span> Specify that after so many oa cuts have
1112been generated Benders cuts should be generated instead.
1113<br class="newline" />It seems that sometimes generating too many oa cuts slows down the optimization
1114compared to Benders due to the size of the LP. With this option we specify that after
1115so many OA cuts have been generated we should switch to Benders cuts. The valid
1116range for this integer option is 0 <span 
1117class="cmsy-10">&#x2264;</span> <span 
1118class="cmmi-10">generate</span>_<span 
1119class="cmmi-10">benders</span>_<span 
1120class="cmmi-10">after</span>_<span 
1121class="cmmi-10">so</span>_<span 
1122class="cmmi-10">many</span>_<span 
1123class="cmmi-10">oa</span> <span 
1124class="cmmi-10">&#x003C;</span> +<span 
1125class="cmmi-10">inf</span>
1126and its default value is 5000.
1127   <a 
1128 id="subsection.0.12"></a>
1129   <h4 class="subsectionHead"><span class="titlemark">0.12   </span> <a 
1130 id="x1-700000.12"></a>Options for feasibility pump</h4>
1131<a 
1132 id="section*.59"></a>
1133<!--l. 1455--><p class="noindent" ><span class="paragraphHead"><a 
1134 id="x1-710000.12"></a><span 
1135class="cmbx-10">fp</span><span 
1136class="cmbx-10">_log</span><span 
1137class="cmbx-10">_frequency:</span></span> display an update on lower and upper bounds in FP every n
1138seconds
1139<br class="newline" />The valid range for this real option is 0 <span 
1140class="cmmi-10">&#x003C;</span> <span 
1141class="cmmi-10">fp</span>_<span 
1142class="cmmi-10">log</span>_<span 
1143class="cmmi-10">frequency</span> <span 
1144class="cmmi-10">&#x003C;</span> +<span 
1145class="cmmi-10">inf</span> and its default
1146value is 100.
1147<a 
1148 id="section*.60"></a>
1149<!--l. 1461--><p class="noindent" ><span class="paragraphHead"><a 
1150 id="x1-720000.12"></a><span 
1151class="cmbx-10">fp</span><span 
1152class="cmbx-10">_log</span><span 
1153class="cmbx-10">_level:</span></span> specify FP iterations log level.
1154<br class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
1155The valid range for this integer option is 0 <span 
1156class="cmsy-10">&#x2264;</span> <span 
1157class="cmmi-10">fp</span>_<span 
1158class="cmmi-10">log</span>_<span 
1159class="cmmi-10">level</span> <span 
1160class="cmsy-10">&#x2264; </span>2 and its default value is
11611.
1162   <a 
1163 id="subsection.0.13"></a>
1164   <h4 class="subsectionHead"><span class="titlemark">0.13   </span> <a 
1165 id="x1-730000.13"></a>Options for non-convex problems</h4>
1166<a 
1167 id="section*.61"></a>
1168<!--l. 1470--><p class="noindent" ><span class="paragraphHead"><a 
1169 id="x1-740000.13"></a><span 
1170class="cmbx-10">coeff</span><span 
1171class="cmbx-10">_var</span><span 
1172class="cmbx-10">_threshold:</span></span> Coefficient of variation threshold (for dynamic definition of
1173cutoff_decr).
1174<br class="newline" />Coefficient of variation threshold (for dynamic definition of cutoff_decr). The valid
1175range for this real option is 0 <span 
1176class="cmsy-10">&#x2264;</span> <span 
1177class="cmmi-10">coeff</span>_<span 
1178class="cmmi-10">var</span>_<span 
1179class="cmmi-10">threshold</span> <span 
1180class="cmmi-10">&#x003C;</span> +<span 
1181class="cmmi-10">inf</span> and its default value is
11820<span 
1183class="cmmi-10">.</span>1.
1184
1185<a 
1186 id="section*.62"></a>
1187<!--l. 1477--><p class="noindent" ><span class="paragraphHead"><a 
1188 id="x1-750000.13"></a><span 
1189class="cmbx-10">dynamic</span><span 
1190class="cmbx-10">_def</span><span 
1191class="cmbx-10">_cutoff</span><span 
1192class="cmbx-10">_decr:</span></span> Do you want to define the parameter cutoff_decr
1193dynamically?
1194<br class="newline" />
1195   The default value for this string option is &#8221;no&#8221;.
1196<br class="newline" />Possible values:
1197     <ul class="itemize1">
1198     <li class="itemize">no: No, define it statically
1199     </li>
1200     <li class="itemize">yes: Yes, define it dynamically</li></ul>
1201<a 
1202 id="section*.63"></a>
1203<!--l. 1487--><p class="noindent" ><span class="paragraphHead"><a 
1204 id="x1-760000.13"></a><span 
1205class="cmbx-10">first</span><span 
1206class="cmbx-10">_perc</span><span 
1207class="cmbx-10">_for</span><span 
1208class="cmbx-10">_cutoff</span><span 
1209class="cmbx-10">_decr:</span></span> The percentage used when, the coeff of variance is
1210smaller than the threshold, to compute the cutoff_decr dynamically.
1211<br class="newline" />The percentage used when, the coeff of variance is smaller than the threshold, to
1212compute the cutoff_decr dynamically. The valid range for this real option
1213is <span 
1214class="cmsy-10">-</span><span 
1215class="cmmi-10">inf</span> <span 
1216class="cmmi-10">&#x003C;</span> <span 
1217class="cmmi-10">first</span>_<span 
1218class="cmmi-10">perc</span>_<span 
1219class="cmmi-10">for</span>_<span 
1220class="cmmi-10">cutoff</span>_<span 
1221class="cmmi-10">decr</span> <span 
1222class="cmmi-10">&#x003C;</span> +<span 
1223class="cmmi-10">inf</span> and its default value is
1224<span 
1225class="cmsy-10">-</span>0<span 
1226class="cmmi-10">.</span>02.
1227<a 
1228 id="section*.64"></a>
1229<!--l. 1495--><p class="noindent" ><span class="paragraphHead"><a 
1230 id="x1-770000.13"></a><span 
1231class="cmbx-10">max</span><span 
1232class="cmbx-10">_consecutive</span><span 
1233class="cmbx-10">_infeasible:</span></span> Number of consecutive infeasible subproblems before
1234aborting a branch.
1235<br class="newline" />Will continue exploring a branch of the tree until &#8221;max_consecutive_infeasible&#8221;consecutive
1236problems are infeasibles by the NLP sub-solver. The valid range for this integer
1237option is 0 <span 
1238class="cmsy-10">&#x2264;</span> <span 
1239class="cmmi-10">max</span>_<span 
1240class="cmmi-10">consecutive</span>_<span 
1241class="cmmi-10">infeasible</span> <span 
1242class="cmmi-10">&#x003C;</span> +<span 
1243class="cmmi-10">inf</span> and its default value is
12440.
1245<a 
1246 id="section*.65"></a>
1247<!--l. 1503--><p class="noindent" ><span class="paragraphHead"><a 
1248 id="x1-780000.13"></a><span 
1249class="cmbx-10">num</span><span 
1250class="cmbx-10">_resolve</span><span 
1251class="cmbx-10">_at</span><span 
1252class="cmbx-10">_infeasibles:</span></span> Number <span 
1253class="cmmi-10">k </span>of tries to resolve an infeasible node
1254(other than the root) of the tree with different starting point.
1255<br class="newline" />The algorithm will solve all the infeasible nodes with <span 
1256class="cmmi-10">k </span>different random starting
1257points and will keep the best local optimum found. The valid range for this integer
1258option is 0 <span 
1259class="cmsy-10">&#x2264;</span> <span 
1260class="cmmi-10">num</span>_<span 
1261class="cmmi-10">resolve</span>_<span 
1262class="cmmi-10">at</span>_<span 
1263class="cmmi-10">infeasibles</span> <span 
1264class="cmmi-10">&#x003C;</span> +<span 
1265class="cmmi-10">inf</span> and its default value is
12660.
1267<a 
1268 id="section*.66"></a>
1269<!--l. 1511--><p class="noindent" ><span class="paragraphHead"><a 
1270 id="x1-790000.13"></a><span 
1271class="cmbx-10">num</span><span 
1272class="cmbx-10">_resolve</span><span 
1273class="cmbx-10">_at</span><span 
1274class="cmbx-10">_node:</span></span> Number <span 
1275class="cmmi-10">k </span>of tries to resolve a node (other than the root)
1276of the tree with different starting point.
1277<br class="newline" />The algorithm will solve all the nodes with <span 
1278class="cmmi-10">k </span>different random starting points and
1279will keep the best local optimum found. The valid range for this integer option is
12800 <span 
1281class="cmsy-10">&#x2264;</span> <span 
1282class="cmmi-10">num</span>_<span 
1283class="cmmi-10">resolve</span>_<span 
1284class="cmmi-10">at</span>_<span 
1285class="cmmi-10">node</span> <span 
1286class="cmmi-10">&#x003C;</span> +<span 
1287class="cmmi-10">inf</span> and its default value is 0.
1288
1289<a 
1290 id="section*.67"></a>
1291<!--l. 1519--><p class="noindent" ><span class="paragraphHead"><a 
1292 id="x1-800000.13"></a><span 
1293class="cmbx-10">num</span><span 
1294class="cmbx-10">_resolve</span><span 
1295class="cmbx-10">_at</span><span 
1296class="cmbx-10">_root:</span></span> Number <span 
1297class="cmmi-10">k </span>of tries to resolve the root node with different
1298starting points.
1299<br class="newline" />The algorithm will solve the root node with <span 
1300class="cmmi-10">k </span>random starting points and will keep
1301the best local optimum found. The valid range for this integer option is
13020 <span 
1303class="cmsy-10">&#x2264;</span> <span 
1304class="cmmi-10">num</span>_<span 
1305class="cmmi-10">resolve</span>_<span 
1306class="cmmi-10">at</span>_<span 
1307class="cmmi-10">root</span> <span 
1308class="cmmi-10">&#x003C;</span> +<span 
1309class="cmmi-10">inf</span> and its default value is 0.
1310<a 
1311 id="section*.68"></a>
1312<!--l. 1527--><p class="noindent" ><span class="paragraphHead"><a 
1313 id="x1-810000.13"></a><span 
1314class="cmbx-10">second</span><span 
1315class="cmbx-10">_perc</span><span 
1316class="cmbx-10">_for</span><span 
1317class="cmbx-10">_cutoff</span><span 
1318class="cmbx-10">_decr:</span></span> The percentage used when, the coeff of
1319variance is greater than the threshold, to compute the cutoff_decr dynamically.
1320<br class="newline" />The percentage used when, the coeff of variance is greater than the threshold, to
1321compute the cutoff_decr dynamically. The valid range for this real option
1322is <span 
1323class="cmsy-10">-</span><span 
1324class="cmmi-10">inf</span> <span 
1325class="cmmi-10">&#x003C;</span> <span 
1326class="cmmi-10">second</span>_<span 
1327class="cmmi-10">perc</span>_<span 
1328class="cmmi-10">for</span>_<span 
1329class="cmmi-10">cutoff</span>_<span 
1330class="cmmi-10">decr</span> <span 
1331class="cmmi-10">&#x003C;</span> +<span 
1332class="cmmi-10">inf</span> and its default value is
1333<span 
1334class="cmsy-10">-</span>0<span 
1335class="cmmi-10">.</span>05.
1336   <a 
1337 id="subsection.0.14"></a>
1338   <h4 class="subsectionHead"><span class="titlemark">0.14   </span> <a 
1339 id="x1-820000.14"></a>Outer Approximation cuts generation</h4>
1340<a 
1341 id="section*.69"></a>
1342<!--l. 1537--><p class="noindent" ><span class="paragraphHead"><a 
1343 id="x1-830000.14"></a><span 
1344class="cmbx-10">add</span><span 
1345class="cmbx-10">_only</span><span 
1346class="cmbx-10">_violated</span><span 
1347class="cmbx-10">_oa:</span></span> Do we add all OA cuts or only the ones violated by current
1348point?
1349<br class="newline" />
1350   The default value for this string option is &#8221;no&#8221;.
1351<br class="newline" />Possible values:
1352     <ul class="itemize1">
1353     <li class="itemize">no: Add all cuts
1354     </li>
1355     <li class="itemize">yes: Add only violated Cuts</li></ul>
1356<a 
1357 id="section*.70"></a>
1358<!--l. 1547--><p class="noindent" ><span class="paragraphHead"><a 
1359 id="x1-840000.14"></a><span 
1360class="cmbx-10">oa</span><span 
1361class="cmbx-10">_cuts</span><span 
1362class="cmbx-10">_log</span><span 
1363class="cmbx-10">_level:</span></span> level of log when generating OA cuts.
1364<br class="newline" />0: outputs nothing, 1: when a cut is generated, its violation and index of row
1365from which it originates, 2: always output violation of the cut. 3: output
1366generated cuts incidence vectors. The valid range for this integer option is
13670 <span 
1368class="cmsy-10">&#x2264;</span> <span 
1369class="cmmi-10">oa</span>_<span 
1370class="cmmi-10">cuts</span>_<span 
1371class="cmmi-10">log</span>_<span 
1372class="cmmi-10">level</span> <span 
1373class="cmmi-10">&#x003C;</span> +<span 
1374class="cmmi-10">inf</span> and its default value is 0.
1375<a 
1376 id="section*.71"></a>
1377<!--l. 1559--><p class="noindent" ><span class="paragraphHead"><a 
1378 id="x1-850000.14"></a><span 
1379class="cmbx-10">oa</span><span 
1380class="cmbx-10">_cuts</span><span 
1381class="cmbx-10">_scope:</span></span> Specify if OA cuts added are to be set globally or locally valid
1382<br class="newline" />
1383   The default value for this string option is &#8221;global&#8221;.
1384<br class="newline" />Possible values:
1385
1386     <ul class="itemize1">
1387     <li class="itemize">local: Cuts are treated as globally valid
1388     </li>
1389     <li class="itemize">global: Cuts are treated as locally valid</li></ul>
1390<a 
1391 id="section*.72"></a>
1392<!--l. 1569--><p class="noindent" ><span class="paragraphHead"><a 
1393 id="x1-860000.14"></a><span 
1394class="cmbx-10">tiny</span><span 
1395class="cmbx-10">_element:</span></span> Value for tiny element in OA cut
1396<br class="newline" />We will remove &#8221;cleanly&#8221; (by relaxing cut) an element lower than this. The valid
1397range for this real option is <span 
1398class="cmsy-10">-</span>0 <span 
1399class="cmsy-10">&#x2264;</span> <span 
1400class="cmmi-10">tiny</span>_<span 
1401class="cmmi-10">element</span> <span 
1402class="cmmi-10">&#x003C;</span> +<span 
1403class="cmmi-10">inf</span> and its default value is
14041 <span 
1405class="cmsy-10">&#x22C5; </span>10<sup><span 
1406class="cmsy-7">-</span><span 
1407class="cmr-7">08</span></sup>.
1408<a 
1409 id="section*.73"></a>
1410<!--l. 1576--><p class="noindent" ><span class="paragraphHead"><a 
1411 id="x1-870000.14"></a><span 
1412class="cmbx-10">very</span><span 
1413class="cmbx-10">_tiny</span><span 
1414class="cmbx-10">_element:</span></span> Value for very tiny element in OA cut
1415<br class="newline" />Algorithm will take the risk of neglecting an element lower than this. The valid range
1416for this real option is <span 
1417class="cmsy-10">-</span>0 <span 
1418class="cmsy-10">&#x2264;</span> <span 
1419class="cmmi-10">very</span>_<span 
1420class="cmmi-10">tiny</span>_<span 
1421class="cmmi-10">element</span> <span 
1422class="cmmi-10">&#x003C;</span> +<span 
1423class="cmmi-10">inf</span> and its default value is
14241 <span 
1425class="cmsy-10">&#x22C5; </span>10<sup><span 
1426class="cmsy-7">-</span><span 
1427class="cmr-7">17</span></sup>.
1428   <a 
1429 id="subsection.0.15"></a>
1430   <h4 class="subsectionHead"><span class="titlemark">0.15   </span> <a 
1431 id="x1-880000.15"></a>Output ond log-levels options</h4>
1432<a 
1433 id="section*.74"></a>
1434<!--l. 1585--><p class="noindent" ><span class="paragraphHead"><a 
1435 id="x1-890000.15"></a><span 
1436class="cmbx-10">bb</span><span 
1437class="cmbx-10">_log</span><span 
1438class="cmbx-10">_interval:</span></span> Interval at which node level output is printed.
1439<br class="newline" />Set the interval (in terms of number of nodes) at which a log on node resolutions
1440(consisting of lower and upper bounds) is given. The valid range for this integer
1441option is 0 <span 
1442class="cmsy-10">&#x2264;</span> <span 
1443class="cmmi-10">bb</span>_<span 
1444class="cmmi-10">log</span>_<span 
1445class="cmmi-10">interval</span> <span 
1446class="cmmi-10">&#x003C;</span> +<span 
1447class="cmmi-10">inf</span> and its default value is 100.
1448<a 
1449 id="section*.75"></a>
1450<!--l. 1593--><p class="noindent" ><span class="paragraphHead"><a 
1451 id="x1-900000.15"></a><span 
1452class="cmbx-10">bb</span><span 
1453class="cmbx-10">_log</span><span 
1454class="cmbx-10">_level:</span></span> specify main branch-and-bound log level.
1455<br class="newline" />Set the level of output of the branch-and-bound : 0 - none, 1 - minimal, 2 - normal
1456low, 3 - normal high The valid range for this integer option is 0 <span 
1457class="cmsy-10">&#x2264;</span> <span 
1458class="cmmi-10">bb</span>_<span 
1459class="cmmi-10">log</span>_<span 
1460class="cmmi-10">level</span> <span 
1461class="cmsy-10">&#x2264; </span>5
1462and its default value is 1.
1463<a 
1464 id="section*.76"></a>
1465<!--l. 1601--><p class="noindent" ><span class="paragraphHead"><a 
1466 id="x1-910000.15"></a><span 
1467class="cmbx-10">lp</span><span 
1468class="cmbx-10">_log</span><span 
1469class="cmbx-10">_level:</span></span> specify LP log level.
1470<br class="newline" />Set the level of output of the linear programming sub-solver in B-Hyb or B-QG : 0 -
1471none, 1 - minimal, 2 - normal low, 3 - normal high, 4 - verbose The valid
1472range for this integer option is 0 <span 
1473class="cmsy-10">&#x2264;</span> <span 
1474class="cmmi-10">lp</span>_<span 
1475class="cmmi-10">log</span>_<span 
1476class="cmmi-10">level</span> <span 
1477class="cmsy-10">&#x2264; </span>4 and its default value is
14780.
1479<a 
1480 id="section*.77"></a>
1481<!--l. 1610--><p class="noindent" ><span class="paragraphHead"><a 
1482 id="x1-920000.15"></a><span 
1483class="cmbx-10">nlp</span><span 
1484class="cmbx-10">_log</span><span 
1485class="cmbx-10">_at</span><span 
1486class="cmbx-10">_root:</span></span> Specify a different log level for root relaxtion.
1487<br class="newline" />The valid range for this integer option is 0 <span 
1488class="cmsy-10">&#x2264;</span> <span 
1489class="cmmi-10">nlp</span>_<span 
1490class="cmmi-10">log</span>_<span 
1491class="cmmi-10">at</span>_<span 
1492class="cmmi-10">root</span> <span 
1493class="cmsy-10">&#x2264; </span>12 and its default
1494value is 0.
1495
1496   <a 
1497 id="subsection.0.16"></a>
1498   <h4 class="subsectionHead"><span class="titlemark">0.16   </span> <a 
1499 id="x1-930000.16"></a>Strong branching setup</h4>
1500<a 
1501 id="section*.78"></a>
1502<!--l. 1618--><p class="noindent" ><span class="paragraphHead"><a 
1503 id="x1-940000.16"></a><span 
1504class="cmbx-10">candidate</span><span 
1505class="cmbx-10">_sort</span><span 
1506class="cmbx-10">_criterion:</span></span> Choice of the criterion to choose candidates in
1507strong-branching
1508<br class="newline" />
1509   The default value for this string option is &#8221;best-ps-cost&#8221;.
1510<br class="newline" />Possible values:
1511     <ul class="itemize1">
1512     <li class="itemize">best-ps-cost: Sort by decreasing pseudo-cost
1513     </li>
1514     <li class="itemize">worst-ps-cost: Sort by increasing pseudo-cost
1515     </li>
1516     <li class="itemize">most-fractional: Sort by decreasing integer infeasibility
1517     </li>
1518     <li class="itemize">least-fractional: Sort by increasing integer infeasibility</li></ul>
1519<a 
1520 id="section*.79"></a>
1521<!--l. 1630--><p class="noindent" ><span class="paragraphHead"><a 
1522 id="x1-950000.16"></a><span 
1523class="cmbx-10">maxmin</span><span 
1524class="cmbx-10">_crit</span><span 
1525class="cmbx-10">_have</span><span 
1526class="cmbx-10">_sol:</span></span> Weight towards minimum in of lower and upper branching
1527estimates when a solution has been found.
1528<br class="newline" />The valid range for this real option is 0 <span 
1529class="cmsy-10">&#x2264;</span> <span 
1530class="cmmi-10">maxmin</span>_<span 
1531class="cmmi-10">crit</span>_<span 
1532class="cmmi-10">have</span>_<span 
1533class="cmmi-10">sol</span> <span 
1534class="cmsy-10">&#x2264; </span>1 and its default
1535value is 0<span 
1536class="cmmi-10">.</span>1.
1537<a 
1538 id="section*.80"></a>
1539<!--l. 1636--><p class="noindent" ><span class="paragraphHead"><a 
1540 id="x1-960000.16"></a><span 
1541class="cmbx-10">maxmin</span><span 
1542class="cmbx-10">_crit</span><span 
1543class="cmbx-10">_no</span><span 
1544class="cmbx-10">_sol:</span></span> Weight towards minimum in of lower and upper branching
1545estimates when no solution has been found yet.
1546<br class="newline" />The valid range for this real option is 0 <span 
1547class="cmsy-10">&#x2264;</span> <span 
1548class="cmmi-10">maxmin</span>_<span 
1549class="cmmi-10">crit</span>_<span 
1550class="cmmi-10">no</span>_<span 
1551class="cmmi-10">sol</span> <span 
1552class="cmsy-10">&#x2264; </span>1 and its default
1553value is 0<span 
1554class="cmmi-10">.</span>7.
1555<a 
1556 id="section*.81"></a>
1557<!--l. 1642--><p class="noindent" ><span class="paragraphHead"><a 
1558 id="x1-970000.16"></a><span 
1559class="cmbx-10">min</span><span 
1560class="cmbx-10">_number</span><span 
1561class="cmbx-10">_strong</span><span 
1562class="cmbx-10">_branch:</span></span> Sets minimum number of variables for strong
1563branching (overriding trust)
1564<br class="newline" />The valid range for this integer option is 0 <span 
1565class="cmsy-10">&#x2264;</span> <span 
1566class="cmmi-10">min</span>_<span 
1567class="cmmi-10">number</span>_<span 
1568class="cmmi-10">strong</span>_<span 
1569class="cmmi-10">branch</span> <span 
1570class="cmmi-10">&#x003C;</span> +<span 
1571class="cmmi-10">inf</span>
1572and its default value is 0.
1573<a 
1574 id="section*.82"></a>
1575<!--l. 1648--><p class="noindent" ><span class="paragraphHead"><a 
1576 id="x1-980000.16"></a><span 
1577class="cmbx-10">number</span><span 
1578class="cmbx-10">_before</span><span 
1579class="cmbx-10">_trust</span><span 
1580class="cmbx-10">_list:</span></span> Set the number of branches on a variable before its
1581pseudo costs are to be believed during setup of strong branching candidate list.
1582<br class="newline" />The default value is that of &#8221;number_before_trust&#8221; The valid range for this integer
1583
1584option is <span 
1585class="cmsy-10">-</span>1 <span 
1586class="cmsy-10">&#x2264;</span> <span 
1587class="cmmi-10">number</span>_<span 
1588class="cmmi-10">before</span>_<span 
1589class="cmmi-10">trust</span>_<span 
1590class="cmmi-10">list</span> <span 
1591class="cmmi-10">&#x003C;</span> +<span 
1592class="cmmi-10">inf</span> and its default value is
15930.
1594<a 
1595 id="section*.83"></a>
1596<!--l. 1655--><p class="noindent" ><span class="paragraphHead"><a 
1597 id="x1-990000.16"></a><span 
1598class="cmbx-10">number</span><span 
1599class="cmbx-10">_look</span><span 
1600class="cmbx-10">_ahead:</span></span> Sets limit of look-ahead strong-branching trials
1601<br class="newline" />The valid range for this integer option is 0 <span 
1602class="cmsy-10">&#x2264;</span> <span 
1603class="cmmi-10">number</span>_<span 
1604class="cmmi-10">look</span>_<span 
1605class="cmmi-10">ahead</span> <span 
1606class="cmmi-10">&#x003C;</span> +<span 
1607class="cmmi-10">inf</span> and its
1608default value is 0.
1609<a 
1610 id="section*.84"></a>
1611<!--l. 1661--><p class="noindent" ><span class="paragraphHead"><a 
1612 id="x1-1000000.16"></a><span 
1613class="cmbx-10">number</span><span 
1614class="cmbx-10">_strong</span><span 
1615class="cmbx-10">_branch</span><span 
1616class="cmbx-10">_root:</span></span> Maximum number of variables considered for
1617strong branching in root node.
1618<br class="newline" />The valid range for this integer option is 0 <span 
1619class="cmsy-10">&#x2264;</span> <span 
1620class="cmmi-10">number</span>_<span 
1621class="cmmi-10">strong</span>_<span 
1622class="cmmi-10">branch</span>_<span 
1623class="cmmi-10">root</span> <span 
1624class="cmmi-10">&#x003C;</span> +<span 
1625class="cmmi-10">inf</span>
1626and its default value is 2147483647.
1627<a 
1628 id="section*.85"></a>
1629<!--l. 1667--><p class="noindent" ><span class="paragraphHead"><a 
1630 id="x1-1010000.16"></a><span 
1631class="cmbx-10">setup</span><span 
1632class="cmbx-10">_pseudo</span><span 
1633class="cmbx-10">_frac:</span></span> Proportion of strong branching list that has to be taken from
1634most-integer-infeasible list.
1635<br class="newline" />The valid range for this real option is 0 <span 
1636class="cmsy-10">&#x2264;</span> <span 
1637class="cmmi-10">setup</span>_<span 
1638class="cmmi-10">pseudo</span>_<span 
1639class="cmmi-10">frac</span> <span 
1640class="cmsy-10">&#x2264; </span>1 and its default
1641value is 0<span 
1642class="cmmi-10">.</span>5.
1643<a 
1644 id="section*.86"></a>
1645<!--l. 1673--><p class="noindent" ><span class="paragraphHead"><a 
1646 id="x1-1020000.16"></a><span 
1647class="cmbx-10">trust</span><span 
1648class="cmbx-10">_strong</span><span 
1649class="cmbx-10">_branching</span><span 
1650class="cmbx-10">_for</span><span 
1651class="cmbx-10">_pseudo</span><span 
1652class="cmbx-10">_cost:</span></span> Whether or not to trust strong
1653branching results for updating pseudo costs.
1654<br class="newline" />
1655   The default value for this string option is &#8221;yes&#8221;.
1656<br class="newline" />Possible values:
1657     <ul class="itemize1">
1658     <li class="itemize">no:
1659     </li>
1660     <li class="itemize">yes:</li></ul>
1661   <a 
1662 id="subsection.0.17"></a>
1663   <h4 class="subsectionHead"><span class="titlemark">0.17   </span> <a 
1664 id="x1-1030000.17"></a>nlp interface option</h4>
1665<a 
1666 id="section*.87"></a>
1667<!--l. 1685--><p class="noindent" ><span class="paragraphHead"><a 
1668 id="x1-1040000.17"></a><span 
1669class="cmbx-10">file</span><span 
1670class="cmbx-10">_solution:</span></span> Write a file bonmin.sol with the solution
1671<br class="newline" />
1672   The default value for this string option is &#8221;no&#8221;.
1673<br class="newline" />Possible values:
1674     <ul class="itemize1">
1675     <li class="itemize">yes:
1676
1677     </li>
1678     <li class="itemize">no:</li></ul>
1679<a 
1680 id="section*.88"></a>
1681<!--l. 1695--><p class="noindent" ><span class="paragraphHead"><a 
1682 id="x1-1050000.17"></a><span 
1683class="cmbx-10">nlp</span><span 
1684class="cmbx-10">_log</span><span 
1685class="cmbx-10">_level:</span></span> specify NLP solver interface log level (independent from ipopt
1686print_level).
1687<br class="newline" />Set the level of output of the OsiTMINLPInterface : 0 - none, 1 - normal, 2 - verbose
1688The valid range for this integer option is 0 <span 
1689class="cmsy-10">&#x2264;</span> <span 
1690class="cmmi-10">nlp</span>_<span 
1691class="cmmi-10">log</span>_<span 
1692class="cmmi-10">level</span> <span 
1693class="cmsy-10">&#x2264; </span>2 and its default value
1694is 1.
1695<a 
1696 id="section*.89"></a>
1697<!--l. 1702--><p class="noindent" ><span class="paragraphHead"><a 
1698 id="x1-1060000.17"></a><span 
1699class="cmbx-10">nlp</span><span 
1700class="cmbx-10">_solver:</span></span> Choice of the solver for local optima of continuous nlp&#8217;s
1701<br class="newline" />Note that option will work only if the specified solver has been installed. Ipopt
1702will usualy be installed with Bonmin by default. For FilterSQP please see
1703http://www-unix.mcs.anl.gov/&#x00A0;leyffer/solvers.html on how to obtain it and
1704https://projects.coin-or.org/Bonmin/wiki/HintTric- ks on how to configure Bonmin
1705to use it. The default value for this string option is &#8221;Ipopt&#8221;.
1706<br class="newline" />Possible values:
1707     <ul class="itemize1">
1708     <li class="itemize">Ipopt: Interior Point OPTimizer (https://projects.coin-or.org/Ipopt)
1709     </li>
1710     <li class="itemize">filterSQP:  Sequential  quadratic  programming  trust  region  algorithm
1711     (http://www-unix.mcs.anl.gov/&#x00A0;leyffer/solvers.h- tml)
1712     </li>
1713     <li class="itemize">all: run all available solvers at each node</li></ul>
1714<a 
1715 id="section*.90"></a>
1716<!--l. 1724--><p class="noindent" ><span class="paragraphHead"><a 
1717 id="x1-1070000.17"></a><span 
1718class="cmbx-10">warm</span><span 
1719class="cmbx-10">_start:</span></span> Select the warm start method
1720<br class="newline" />This will affect the function getWarmStart(), and as a consequence the warm
1721starting in the various algorithms. The default value for this string option is
1722&#8221;none&#8221;.
1723<br class="newline" />Possible values:
1724     <ul class="itemize1">
1725     <li class="itemize">none: No warm start
1726     </li>
1727     <li class="itemize">optimum: Warm start with direct parent optimum
1728     </li>
1729     <li class="itemize">interior_point: Warm start with an interior point of direct parent</li></ul>
1730   
1731</body></html> 
1732
1733
1734
Note: See TracBrowser for help on using the repository browser.