Changeset 1589


Ignore:
Timestamp:
Jan 23, 2010 6:54:45 PM (10 years ago)
Author:
pbonami
Message:

update to options pages

Location:
html
Files:
7 edited

Legend:

Unmodified
Added
Removed
  • html/Install.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:46:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
     
    3030class="cmtt-10">BONMIN</span>&#x00A0;on Mac
    3131OSX</a>  </p> </div>     </div> </div>
    32  </div> <div id="content"> <div class="feature"> <h3> Installing <span
    33 class="cmtt-10">BONMIN </span></h3> The build process for <span
    34 class="cmtt-10">BONMIN</span>&#x00A0;should be fairly automatic as it
    35 uses <a
     32 </div> <div id="content"> <div class="feature"> <h3> <a id="sec:install">Installing <span
     33class="cmtt-10">BONMIN</span></a> </h3> The build process for <span
     34class="cmtt-10">BONMIN</span>&#x00A0;should be fairly automatic
     35as it uses <a
    3636href="http://sources.redhat.com/autobook/autobook/" >GNU autotools</a>. It has been successfully compiled and run on the following
    3737platforms:
     
    8787class="cmtt-10">BuildTools </span><a
    8888href="https://projects.coin-or.org/BuildTools" >trac page</a>.
    89 <!--l. 60--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:cplex&#x02D9;install&#8221; ></a> Specifying the location of <span
    90 class="cmtt-10">Cplex </span>libraries  </h3>   If you have <span
     89<!--l. 60--><p class="indent" >    </div> <div class="story"><h3><a id="sec:cplex&#x02D9;install">Specifying the location of <span
     90class="cmtt-10">Cplex </span>libraries</a></h3>   If you have <span
    9191class="cmtt-10">Cplex</span>
    9292installed on your machine, you may want to use it as the Mixed Integer Linear
     
    155155<span
    156156class="cmtt-10">coin-Bonmin</span>.)
    157 <!--l. 102--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:vpath&#8221; ></a> Compiling <span
    158 class="cmtt-10">BONMIN</span>&#x00A0;in a external directory  </h3>   It is recommended to
     157<!--l. 102--><p class="indent" >    </div> <div class="story"><h3><a id="sec:vpath">Compiling <span
     158class="cmtt-10">BONMIN</span>&#x00A0;in a external directory</a></h3>   It is recommended to
    159159compile <span
    160160class="cmtt-10">BONMIN</span>&#x00A0;in a directory different from the source directory (<span
     
    187187class="cmtt-10">make install </span>(in <span
    188188class="cmtt-10">Bonmin-build</span>).
    189 <!--l. 124--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:ref&#x02D9;man&#8221; ></a> Building the documentation  </h3>   The documentation for
    190 <span
    191 class="cmtt-10">BONMIN</span>&#x00A0;consists of a users&#8217; manual (this document) and a reference manual.
    192 You can build a local copy of the reference manual provided that you have
    193 Latex and Doxygen installed on your machine. Issue the command <span
    194 class="cmtt-10">make</span>
    195 <span
    196 class="cmtt-10">doxydoc </span>in <span
    197 class="cmtt-10">coin-Bonmin</span>. It calls Doxygen to build a copy of the reference
    198 manual. An html version of the reference manual can then be accessed in
    199 <span
     189<!--l. 124--><p class="indent" >    </div> <div class="story"><h3><a id="sec:ref&#x02D9;man">Building the documentation</a></h3>   The documentation for <span
     190class="cmtt-10">BONMIN</span>&#x00A0;consists
     191of a users&#8217; manual (this document) and a reference manual. You can build a local
     192copy of the reference manual provided that you have Latex and Doxygen installed on
     193your machine. Issue the command <span
     194class="cmtt-10">make doxydoc </span>in <span
     195class="cmtt-10">coin-Bonmin</span>. It calls Doxygen
     196to build a copy of the reference manual. An html version of the reference manual can
     197then be accessed in <span
    200198class="cmtt-10">doc/html/index.html</span>.
    201 <!--l. 136--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:test&#8221; ></a> Running the test programs  </h3>   By issuing the command <span
    202 class="cmtt-10">make test</span>&#x00A0;,
    203 you build and run the automatic test program for <span
     199<!--l. 136--><p class="indent" >    </div> <div class="story"><h3><a id="sec:test">Running the test programs</a></h3>   By issuing the command <span
     200class="cmtt-10">make test</span>&#x00A0;, you
     201build and run the automatic test program for <span
    204202class="cmtt-10">BONMIN</span>.
    205203   
  • html/Intro.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:49:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
    1313>
    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"> Introduction  </h2>  <a href="#MathBack " > Types of problems
     14<!--l. 26--><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"> Introduction  </h2>  <a href="#MathBack " > Types of problems
    1515solved  </a> / <a href="#Algos " > Algorithms  </a> / <a href="#ThirdP " > Required third party code  </a> / <a href="#Support " >
    1616Supported platforms  </a> /   </div>
    17 <!--l. 17--><p class="noindent" > <div id="rightPanel"> <div id="headlines"> <h4>References </h4>    <div id="refer"> <p>  1 <a
     17<!--l. 26--><p class="noindent" > <div id="rightPanel"> <div id="headlines"> <h4>References </h4>    <div id="refer"> <p>  1 <a
    1818href="http://domino.research.ibm.com/library/cyberdig.nsf/1e4115aea78b6e7c85256b360066f0d4/fdb4630e33bd2876852570b20062af37?OpenDocument" >An algorithmic framework for convex MINLP. Bonami et.al.</a>  </p> </div>       <div id="refer"> <p>  2 <a
    1919href="http://hal.archives-ouvertes.fr/hal-00423416/en/" >Algorithms
     
    3030branched and bound algorithm for convex MINLP optimization problems. I.
    3131Quesada and I.E. Grossmann. Computers and Chemical Engineering.</a>  </p> </div>    </div> </div>
    32 <!--l. 28--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <span
    33 class="cmtt-10">BONMIN </span></h3> <span
    34 class="cmtt-10">BONMIN</span>&#x00A0;(Basic Open-source Nonlinear Mixed INteger programming) is
    35 an open-source code for solving general MINLP (Mixed Integer NonLinear
    36 Programming) problems. It is distributed on <a
    37 href="http://www.coin-or.org" >COIN-OR</a> under the CPL (Common
    38 Public License). The CPL is a license approved by the <a
    39 href="http://www.opensource.org" >OSI</a>, (Open Source Initiative),
    40 thus <span
    41 class="cmtt-10">BONMIN</span>&#x00A0;is OSI Certified Open Source Software.
     32<!--l. 28--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:Intro"><span
     33class="cmtt-10">BONMIN</span></a> </h3>  <span
     34class="cmtt-10">BONMIN</span>&#x00A0;(Basic Open-source Nonlinear Mixed INteger
     35programming) is an open-source code for solving general MINLP (Mixed Integer
     36NonLinear Programming) problems. It is distributed on <a
     37href="http://www.coin-or.org" >COIN-OR</a> under
     38the CPL (Common Public License). The CPL is a license approved by the
     39<a
     40href="http://www.opensource.org" >OSI</a>, (Open Source Initiative), thus <span
     41class="cmtt-10">BONMIN</span>&#x00A0;is OSI Certified Open Source
     42Software.
    4243<!--l. 42--><p class="indent" >   There are several algorithmic choices that can be selected with <span
    4344class="cmtt-10">BONMIN</span>. <span
     
    7475the MILP solver and FilterSQP as the NLP solver.
    7576<!--l. 63--><p class="indent" >   Additional documentation can be found on the <span
    76 class="cmtt-10">Bonmin  </span><a
     77class="cmtt-10">Bonmin</span>
     78<!--l. 76--><p class="indent" >   <a
    7779href="http://www.coin-or.org/Bonmin" >homepage</a> and <a
    78 href="https://projects.coin-or.org/Bonmin" >wiki</a>.     </div> <div class="story"> <h3><a name=
    79 &#8221;MathBack&#8221; ></a> Types of problems solved  </h3>   <span
    80 class="cmtt-10">BONMIN</span>&#x00A0;solves MINLPs of the
    81 form
    82 <!--l. 79--><p class="indent" >
     80href="https://projects.coin-or.org/Bonmin" >wiki</a>.
     81<!--l. 78--><p class="indent" >    </div> <div class="story"><h3><a id="MathBack">Types of problems solved</a></h3>   <span
     82class="cmtt-10">BONMIN</span>&#x00A0;solves MINLPs of the form
     83<!--l. 82--><p class="indent" >
    8384
    8485<table
     
    203204cast in <span
    204205class="cmti-10">minimization </span>form.
    205 <!--l. 96--><p class="indent" >   The different methods that <span
     206<!--l. 99--><p class="indent" >   The different methods that <span
    206207class="cmtt-10">BONMIN</span>&#x00A0;implements are exact algorithms when the
    207208functions <span
     
    212213class="cmti-10">global </span>optimizer).
    213214<br class="newline" />
    214 <!--l. 99--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;Algos&#8221; ></a> Algorithms  </h3>   <span
     215<!--l. 102--><p class="indent" >    </div> <div class="story"><h3><a id="Algos">Algorithms</a></h3>   <span
    215216class="cmtt-10">BONMIN</span>&#x00A0;implements six different algorithms for solving
    216217MINLPs:
     
    249250href="http://dx.doi.org/10.1007/s10107-008-0212-2" >[Bonami Cornuéjols Lodi
    250251     Margot 2009]</a>  .</li></ul>
    251 <!--l. 122--><p class="indent" >   In this manual, we will not go into a further description of these algorithms.
     252<!--l. 125--><p class="indent" >   In this manual, we will not go into a further description of these algorithms.
    252253Mathematical details of these algorithms and some details of their implementations
    253254can be found in  <a
     
    257258src="cmr10-10.png" alt="i" class="10x-x-10" />c Linderoth 2009]</a>
    258259.
    259 <!--l. 126--><p class="indent" >   Whether or not you are interested in the details of the algorithms, you certainly
     260<!--l. 129--><p class="indent" >   Whether or not you are interested in the details of the algorithms, you certainly
    260261want to know which one of these six algorithms you should choose to solve your
    261262particular problem. For convex MINLPs, experiments we have made on a reasonably
     
    285286<span
    286287class="cmtt-10">BONMIN</span>.
    287 <!--l. 139--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;ThirdP&#8221; ></a> Required third party code  </h3>   In order to run <span
    288 class="cmtt-10">BONMIN</span>, you have to
    289 download other external libraries (and pay attention to their licenses!):
     288<!--l. 142--><p class="indent" >    </div> <div class="story"><h3><a id="ThirdP">Required third party code</a></h3>   In order to run <span
     289class="cmtt-10">BONMIN</span>, you have to download
     290other external libraries (and pay attention to their licenses!):
    290291     <ul class="itemize1">
    291292     <li class="itemize"><a
     
    298299href="http://www.cse.clrc.ac.uk/nag/hsl/contents.shtml" >HSL</a>
    299300     (Harwell Subroutine Library), MUMPS, or Pardiso.</li></ul>
    300 <!--l. 152--><p class="indent" >   Note that Lapack and the Blas are free for commercial use from the <a
     301<!--l. 155--><p class="indent" >   Note that Lapack and the Blas are free for commercial use from the <a
    301302href="http://www.netlib.org" >Netlib
    302303Repository</a>, but they are not OSI Certified Open Source Software. The linear solver
    303304MA27 is freely available for noncommercial use.
    304 <!--l. 157--><p class="indent" >   The above software is sufficient to run <span
     305<!--l. 160--><p class="indent" >   The above software is sufficient to run <span
    305306class="cmtt-10">BONMIN</span>&#x00A0;as a stand-alone C++ code, but it
    306307does not provide a modeling language. For functionality from a modeling language,
     
    313314class="cmtt-10">ASL </span>(Ampl Solver
    314315Library) which is obtainable from the Netlib.
    315 <!--l. 164--><p class="indent" >   <span
     316<!--l. 167--><p class="indent" >   <span
    316317class="cmtt-10">BONMIN</span>&#x00A0;can use FilterSQP  <a
    317318href="http://www.mcs.anl.gov/~leyffer/solvers.html" >[FletcherLeyffer1998]</a>   as an alternative to <a
     
    319320class="cmtt-10">Ipopt</span></a>&#x00A0;for
    320321solving NLPs.
    321 <!--l. 166--><p class="indent" >   Also, in the outer approximation methods <span
     322<!--l. 169--><p class="indent" >   Also, in the outer approximation methods <span
    322323class="cmtt-10">B-OA </span>and <span
    323324class="cmtt-10">B-iFP</span>, some MILP problems
     
    331332href="http://www.ilog.com/products/cplex/product/mip.cfm" ><span
    332333class="cmtt-10">Cplex</span></a></a>.
    333 <!--l. 170--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;Support&#8221; ></a> Tested platforms  </h3>   <span
     334<!--l. 173--><p class="indent" >    </div> <div class="story"><h3><a id="Support">Tested platforms</a></h3>   <span
    334335class="cmtt-10">BONMIN</span>&#x00A0;has been installed on the following
    335336systems:
  • html/Obtain.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:46:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
     
    2727href="http://mumps.enseeiht.fr/" >Mumps</a>  </p> </div>       <div id="refer"> <p>  8 <a
    2828href="http://www.ampl.com" >Ampl Solver Library</a>  </p> </div>     </div> </div>
    29 <!--l. 18--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> Obtaining <span
    30 class="cmtt-10">BONMIN </span></h3>
     29<!--l. 18--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:obtain">Obtaining <span
     30class="cmtt-10">BONMIN</span></a> </h3>
    3131<!--l. 22--><p class="indent" >   The <span
    3232class="cmtt-10">BONMIN</span>&#x00A0;package consists of the source code for the <span
     
    106106<a
    107107href="http://www.coin-or.org/faqs.html#q4" >COIN-OR</a>.
    108 <!--l. 67--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:obtain&#x02D9;3rd&#8221; ></a> Obtaining required third party code  </h3>   <span
    109 class="cmtt-10">BONMIN</span>&#x00A0;needs a few
    110 external packages which are not included in the <span
     108<!--l. 67--><p class="indent" >    </div> <div class="story"><h3><a id="sec:obtain&#x02D9;3rd">Obtaining required third party code</a></h3>   <span
     109class="cmtt-10">BONMIN</span>&#x00A0;needs a few external
     110packages which are not included in the <span
    111111class="cmtt-10">BONMIN</span>&#x00A0;package.
    112112     <ul class="itemize1">
  • html/bib.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:46:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
     
    2929  [2]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    3030 id="cite.Betal"></a><a
    31  id="XBetal"></a>P.&#x00A0;Bonami,  A.&#x00A0;Wächter,  L.T.&#x00A0;Biegler,  A.R.&#x00A0;Conn,  G.&#x00A0;Cornuéjols,
     31 id="XBetal"></a>P.&#x00A0;Bonami,   A.&#x00A0;W&auml;chter,   L.T.&#x00A0;Biegler,   A.R.&#x00A0;Conn,   G.&#x00A0;Cornu&eacute;jols,
    3232    I.E.&#x00A0;Grossmann, C.D.&#x00A0;Laird, J.&#x00A0;Lee, A.&#x00A0;Lodi, F.&#x00A0;Margot and N.&#x00A0;Sawaya.
    3333    An algorithmic framework for convex mixed integer nonlinear programs.
     
    3838  [3]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    3939 id="cite.bonami.etal:06"></a><a
    40  id="Xbonami.etal:06"></a>P.&#x00A0;Bonami,  G.&#x00A0;Cornuéjols,  A.&#x00A0;Lodi,  and  F.&#x00A0;Margot.  A  feasibility
    41     pump for mixed integer nonlinear programs. <span
    42 class="cmti-10">Mathematical Programming</span>,
    43     119 (2009), pp.&#x00A0;331&#8211;352.
     40 id="Xbonami.etal:06"></a>P.&#x00A0;Bonami, G.&#x00A0;Cornu&eacute;jols, A.&#x00A0;Lodi, and F.&#x00A0;Margot. A feasibility pump
     41    for  mixed  integer  nonlinear  programs. <span
     42class="cmti-10">Mathematical  Programming</span>,  119
     43    (2009), pp.&#x00A0;331&#8211;352.
    4444    </p>
    4545    <p class="bibitem" ><span class="biblabel">
  • html/options_list.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:49:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
    1313>
    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
     14<a
     15 id="x1-1doc"></a>
     16<!--l. 12--><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
    1517class="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>
     18<!--l. 1042--><p class="noindent" > <table border="1"> <tr> <td>Option </td> <td> type </td> <td> B-BB</td> <td> B-OA</td> <td> B-QG</td> <td> B-Hyb</td> <td> B-Ecp</td> <td> B-iFP</td> <td> Cbc_D</td> </tr> <tr> <th colspan=9> <a href="#sec:Algorithm_choice">Algorithm choice</a> </th> </tr> <tr> <td> <a href="#sec:algorithm">algorithm</a> </td> <td>S</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=9> <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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="#sec:cutoff">cutoff</a> </td> <td>F</td> <td> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> -</td> <td>-</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>-</td> <td>-</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=9> <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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>-</td> </tr> <tr> <th colspan=9> <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> +</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>-</td> </tr> <tr> <th colspan=9> <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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>-</td> <td>-</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> -</td> <td>-</td> <td>-</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> -</td> <td>-</td> <td>-</td> <td>+</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>-</td> <td>-</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> -</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>+</td> </tr> <tr> <th colspan=9> <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> -</td> <td>-</td> <td>+</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</td> <td>+</td> <td>+</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</td> <td>+</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</td> <td>+</td> <td>+</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>-</td> <td>+</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> -</td> <td>-</td> <td>+</td> <td>+</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</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> +</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <th colspan=9> <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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <th colspan=9> <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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> -</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>-</td> </tr> <tr> <th colspan=9> <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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>+</td> <td>-</td> </tr> <tr> <th colspan=9> <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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>+</td> <td>+</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> +</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> <td>-</td> </tr> </tr> </table>     </div> <div class="story"><h3><a id="sec:Algorithm&#x02D9;choice">Algorithm choice</a></h3>   <a id="sec:algorithm"></a>
    2119<a
    2220 id="section*.1"></a>
    23 <!--l. 863--><p class="noindent" ><span class="paragraphHead"><a
    24  id="x1-20000.1"></a><span
    25 class="cmbx-10">algorithm:</span></span> Choice of the algorithm.
     21<!--l. 1045--><p class="noindent" ><span class="paragraphHead"><a
     22 id="x1-1000"></a><span
     23class="cmbx-10">algorithm:</span></span><a
     24 id="x1-1000doc"></a> Choice of the algorithm.
    2625<br class="newline" />This will preset some of the options of bonmin depending on the algorithm choice.
    2726The default value for this string option is &#8221;B-BB&#8221;.
     
    3938     </li>
    4039     <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>
     40<!--l. 1060--><p class="indent" >    </div> <div class="story"><h3><a id="sec:Branch-and-bound&#x02D9;options">Branch-and-bound options</a></h3>   <a id="sec:allowable_fraction_gap"></a>
    4541<a
    4642 id="section*.2"></a>
    47 <!--l. 880--><p class="noindent" ><span class="paragraphHead"><a
    48  id="x1-40000.2"></a><span
     43<!--l. 1062--><p class="noindent" ><span class="paragraphHead"><a
     44 id="x1-2000"></a><span
    4945class="cmbx-10">allowable</span><span
    5046class="cmbx-10">_fraction</span><span
    51 class="cmbx-10">_gap:</span></span> Specify the value of relative gap under which the
     47class="cmbx-10">_gap:</span></span><a
     48 id="x1-2000doc"></a> Specify the value of relative gap under which the
    5249algorithm stops.
    5350<br class="newline" />Stop the tree search when the gap between the objective value of the best known
     
    6663class="cmr-7">+20</span></sup> and its default value is
    67640.
    68 
     65   <a id="sec:allowable_gap"></a>
    6966<a
    7067 id="section*.3"></a>
    71 <!--l. 890--><p class="noindent" ><span class="paragraphHead"><a
    72  id="x1-50000.2"></a><span
     68<!--l. 1073--><p class="noindent" ><span class="paragraphHead"><a
     69 id="x1-3000"></a><span
    7370class="cmbx-10">allowable</span><span
    74 class="cmbx-10">_gap:</span></span> Specify the value of absolute gap under which the algorithm stops.
     71class="cmbx-10">_gap:</span></span><a
     72 id="x1-3000doc"></a> Specify the value of absolute gap under which the algorithm stops.
    7573<br class="newline" />Stop the tree search when the gap between the objective value of the best known
    7674solution and the best bound on the objective of any solution is less than this. The
     
    8684class="cmr-7">+20</span></sup> and its
    8785default value is 0.
     86
     87   <a id="sec:cutoff"></a>
    8888<a
    8989 id="section*.4"></a>
    90 <!--l. 899--><p class="noindent" ><span class="paragraphHead"><a
    91  id="x1-60000.2"></a><span
    92 class="cmbx-10">cutoff:</span></span> Specify cutoff value.
     90<!--l. 1083--><p class="noindent" ><span class="paragraphHead"><a
     91 id="x1-4000"></a><span
     92class="cmbx-10">cutoff:</span></span><a
     93 id="x1-4000doc"></a> Specify cutoff value.
    9394<br class="newline" />cutoff should be the value of a feasible solution known by the user (if any). The
    9495algorithm will only look for solutions better than cutoof. The valid range for
     
    105106class="cmsy-10">&#x22C5; </span>10<sup><span
    106107class="cmr-7">+100</span></sup>.
     108   <a id="sec:cutoff_decr"></a>
    107109<a
    108110 id="section*.5"></a>
    109 <!--l. 907--><p class="noindent" ><span class="paragraphHead"><a
    110  id="x1-70000.2"></a><span
     111<!--l. 1092--><p class="noindent" ><span class="paragraphHead"><a
     112 id="x1-5000"></a><span
    111113class="cmbx-10">cutoff</span><span
    112 class="cmbx-10">_decr:</span></span> Specify cutoff decrement.
     114class="cmbx-10">_decr:</span></span><a
     115 id="x1-5000doc"></a> Specify cutoff decrement.
    113116<br class="newline" />Specify the amount by which cutoff is decremented below a new best upper-bound
    114117(usually a small positive value but in non-convex problems it may be a negative
     
    127130class="cmsy-7">-</span><span
    128131class="cmr-7">05</span></sup>.
     132   <a id="sec:enable_dynamic_nlp"></a>
    129133<a
    130134 id="section*.6"></a>
    131 <!--l. 916--><p class="noindent" ><span class="paragraphHead"><a
    132  id="x1-80000.2"></a><span
     135<!--l. 1102--><p class="noindent" ><span class="paragraphHead"><a
     136 id="x1-6000"></a><span
    133137class="cmbx-10">enable</span><span
    134138class="cmbx-10">_dynamic</span><span
    135 class="cmbx-10">_nlp:</span></span> Enable dynamic linear and quadratic rows addition in nlp
     139class="cmbx-10">_nlp:</span></span><a
     140 id="x1-6000doc"></a> Enable dynamic linear and quadratic rows addition in nlp
    136141<br class="newline" />
    137142   The default value for this string option is &#8221;no&#8221;.
     
    141146     </li>
    142147     <li class="itemize">yes:</li></ul>
     148<!--l. 1112--><p class="indent" >   <a id="sec:integer_tolerance"></a>
    143149<a
    144150 id="section*.7"></a>
    145 <!--l. 926--><p class="noindent" ><span class="paragraphHead"><a
    146  id="x1-90000.2"></a><span
     151<!--l. 1113--><p class="noindent" ><span class="paragraphHead"><a
     152 id="x1-7000"></a><span
    147153class="cmbx-10">integer</span><span
    148 class="cmbx-10">_tolerance:</span></span> Set integer tolerance.
     154class="cmbx-10">_tolerance:</span></span><a
     155 id="x1-7000doc"></a> Set integer tolerance.
    149156<br class="newline" />Any number within that value of an integer is considered integer. The valid range for
    150157this real option is 0 <span
     
    158165class="cmsy-7">-</span><span
    159166class="cmr-7">06</span></sup>.
     167   <a id="sec:iteration_limit"></a>
    160168<a
    161169 id="section*.8"></a>
    162 <!--l. 933--><p class="noindent" ><span class="paragraphHead"><a
    163  id="x1-100000.2"></a><span
     170<!--l. 1121--><p class="noindent" ><span class="paragraphHead"><a
     171 id="x1-8000"></a><span
    164172class="cmbx-10">iteration</span><span
    165 class="cmbx-10">_limit:</span></span> Set the cumulated maximum number of iteration in the
     173class="cmbx-10">_limit:</span></span><a
     174 id="x1-8000doc"></a> Set the cumulated maximum number of iteration in the
    166175algorithm used to process nodes continuous relaxations in the branch-and-bound.
    167176<br class="newline" />value 0 deactivates option. The valid range for this integer option is
    168 
    1691770 <span
    170178class="cmsy-10">&#x2264;</span> <span
     
    173181class="cmmi-10">&#x003C;</span> +<span
    174182class="cmmi-10">inf</span> and its default value is 2147483647.
     183   <a id="sec:nlp_failure_behavior"></a>
     184
    175185<a
    176186 id="section*.9"></a>
    177 <!--l. 939--><p class="noindent" ><span class="paragraphHead"><a
    178  id="x1-110000.2"></a><span
     187<!--l. 1128--><p class="noindent" ><span class="paragraphHead"><a
     188 id="x1-9000"></a><span
    179189class="cmbx-10">nlp</span><span
    180190class="cmbx-10">_failure</span><span
    181 class="cmbx-10">_behavior:</span></span> Set the behavior when an NLP or a series of NLP are
     191class="cmbx-10">_behavior:</span></span><a
     192 id="x1-9000doc"></a> Set the behavior when an NLP or a series of NLP are
    182193unsolved by Ipopt (we call unsolved an NLP for which Ipopt is not able to guarantee
    183194optimality within the specified tolerances).
     
    192203     </li>
    193204     <li class="itemize">fathom: Continue when failure happens.</li></ul>
     205<!--l. 1143--><p class="indent" >   <a id="sec:node_comparison"></a>
    194206<a
    195207 id="section*.10"></a>
    196 <!--l. 954--><p class="noindent" ><span class="paragraphHead"><a
    197  id="x1-120000.2"></a><span
     208<!--l. 1144--><p class="noindent" ><span class="paragraphHead"><a
     209 id="x1-10000"></a><span
    198210class="cmbx-10">node</span><span
    199 class="cmbx-10">_comparison:</span></span> Choose the node selection strategy.
     211class="cmbx-10">_comparison:</span></span><a
     212 id="x1-10000doc"></a> Choose the node selection strategy.
    200213<br class="newline" />Choose the strategy for selecting the next node to be processed. The default value for
    201214this string option is &#8221;best-bound&#8221;.
     
    212225     </li>
    213226     <li class="itemize">best-guess: choose node with smallest guessed integer solution</li></ul>
     227<!--l. 1161--><p class="indent" >   <a id="sec:node_limit"></a>
    214228<a
    215229 id="section*.11"></a>
    216 <!--l. 971--><p class="noindent" ><span class="paragraphHead"><a
    217  id="x1-130000.2"></a><span
     230<!--l. 1162--><p class="noindent" ><span class="paragraphHead"><a
     231 id="x1-11000"></a><span
    218232class="cmbx-10">node</span><span
    219 class="cmbx-10">_limit:</span></span> Set the maximum number of nodes explored in the branch-and-bound
     233class="cmbx-10">_limit:</span></span><a
     234 id="x1-11000doc"></a> Set the maximum number of nodes explored in the branch-and-bound
    220235search.
    221236<br class="newline" />The valid range for this integer option is 0 <span
     
    226241class="cmmi-10">inf</span> and its default
    227242value is 2147483647.
     243   <a id="sec:num_cut_passes"></a>
    228244
    229245<a
    230246 id="section*.12"></a>
    231 <!--l. 977--><p class="noindent" ><span class="paragraphHead"><a
    232  id="x1-140000.2"></a><span
     247<!--l. 1169--><p class="noindent" ><span class="paragraphHead"><a
     248 id="x1-12000"></a><span
    233249class="cmbx-10">num</span><span
    234250class="cmbx-10">_cut</span><span
    235 class="cmbx-10">_passes:</span></span> Set the maximum number of cut passes at regular nodes of the
     251class="cmbx-10">_passes:</span></span><a
     252 id="x1-12000doc"></a> Set the maximum number of cut passes at regular nodes of the
    236253branch-and-cut.
    237254<br class="newline" />The valid range for this integer option is 0 <span
     
    243260class="cmmi-10">inf</span> and its default
    244261value is 1.
     262   <a id="sec:num_cut_passes_at_root"></a>
    245263<a
    246264 id="section*.13"></a>
    247 <!--l. 983--><p class="noindent" ><span class="paragraphHead"><a
    248  id="x1-150000.2"></a><span
     265<!--l. 1176--><p class="noindent" ><span class="paragraphHead"><a
     266 id="x1-13000"></a><span
    249267class="cmbx-10">num</span><span
    250268class="cmbx-10">_cut</span><span
    251269class="cmbx-10">_passes</span><span
    252270class="cmbx-10">_at</span><span
    253 class="cmbx-10">_root:</span></span> Set the maximum number of cut passes at regular
     271class="cmbx-10">_root:</span></span><a
     272 id="x1-13000doc"></a> Set the maximum number of cut passes at regular
    254273nodes of the branch-and-cut.
    255274<br class="newline" />The valid range for this integer option is 0 <span
     
    263282class="cmmi-10">inf</span> and
    264283its default value is 20.
     284   <a id="sec:number_before_trust"></a>
    265285<a
    266286 id="section*.14"></a>
    267 <!--l. 989--><p class="noindent" ><span class="paragraphHead"><a
    268  id="x1-160000.2"></a><span
     287<!--l. 1183--><p class="noindent" ><span class="paragraphHead"><a
     288 id="x1-14000"></a><span
    269289class="cmbx-10">number</span><span
    270290class="cmbx-10">_before</span><span
    271 class="cmbx-10">_trust:</span></span> Set the number of branches on a variable before its pseudo
     291class="cmbx-10">_trust:</span></span><a
     292 id="x1-14000doc"></a> Set the number of branches on a variable before its pseudo
    272293costs are to be believed in dynamic strong branching.
    273294<br class="newline" />A value of 0 disables pseudo costs. The valid range for this integer option is
     
    279300class="cmmi-10">&#x003C;</span> +<span
    280301class="cmmi-10">inf</span> and its default value is 8.
     302   <a id="sec:number_strong_branch"></a>
    281303<a
    282304 id="section*.15"></a>
    283 <!--l. 995--><p class="noindent" ><span class="paragraphHead"><a
    284  id="x1-170000.2"></a><span
     305<!--l. 1190--><p class="noindent" ><span class="paragraphHead"><a
     306 id="x1-15000"></a><span
    285307class="cmbx-10">number</span><span
    286308class="cmbx-10">_strong</span><span
    287 class="cmbx-10">_branch:</span></span> Choose the maximum number of variables considered for
     309class="cmbx-10">_branch:</span></span><a
     310 id="x1-15000doc"></a> Choose the maximum number of variables considered for
    288311strong branching.
    289312<br class="newline" />Set the number of variables on which to do strong branching. The valid range for this
     
    296319class="cmmi-10">inf</span> and its default value is
    29732020.
     321   <a id="sec:solution_limit"></a>
    298322<a
    299323 id="section*.16"></a>
    300 <!--l. 1002--><p class="noindent" ><span class="paragraphHead"><a
    301  id="x1-180000.2"></a><span
     324<!--l. 1198--><p class="noindent" ><span class="paragraphHead"><a
     325 id="x1-16000"></a><span
    302326class="cmbx-10">solution</span><span
    303 class="cmbx-10">_limit:</span></span> Abort after that much integer feasible solution have been found by
     327class="cmbx-10">_limit:</span></span><a
     328 id="x1-16000doc"></a> Abort after that much integer feasible solution have been found by
    304329algorithm
    305330<br class="newline" />value 0 deactivates option The valid range for this integer option is
     
    310335class="cmmi-10">&#x003C;</span> +<span
    311336class="cmmi-10">inf</span> and its default value is 2147483647.
     337   <a id="sec:sos_constraints"></a>
    312338<a
    313339 id="section*.17"></a>
    314 <!--l. 1008--><p class="noindent" ><span class="paragraphHead"><a
    315  id="x1-190000.2"></a><span
     340<!--l. 1205--><p class="noindent" ><span class="paragraphHead"><a
     341 id="x1-17000"></a><span
    316342class="cmbx-10">sos</span><span
    317 class="cmbx-10">_constraints:</span></span> Wether or not to activate SOS constraints.
     343class="cmbx-10">_constraints:</span></span><a
     344 id="x1-17000doc"></a> Wether or not to activate SOS constraints.
    318345<br class="newline" />(only type 1 SOS are supported at the moment) The default value for this string
    319346option is &#8221;enable&#8221;.
     
    321348     <ul class="itemize1">
    322349     <li class="itemize">enable:
     350
    323351     </li>
    324352     <li class="itemize">disable:</li></ul>
    325 
     353<!--l. 1215--><p class="indent" >   <a id="sec:time_limit"></a>
    326354<a
    327355 id="section*.18"></a>
    328 <!--l. 1018--><p class="noindent" ><span class="paragraphHead"><a
    329  id="x1-200000.2"></a><span
     356<!--l. 1216--><p class="noindent" ><span class="paragraphHead"><a
     357 id="x1-18000"></a><span
    330358class="cmbx-10">time</span><span
    331 class="cmbx-10">_limit:</span></span> Set the global maximum computation time (in secs) for the algorithm.
     359class="cmbx-10">_limit:</span></span><a
     360 id="x1-18000doc"></a> Set the global maximum computation time (in secs) for the algorithm.
    332361<br class="newline" />The valid range for this real option is 0 <span
    333362class="cmsy-10">&#x2264;</span> <span
     
    339368class="cmsy-10">&#x22C5; </span>10<sup><span
    340369class="cmr-7">+10</span></sup>.
     370   <a id="sec:tree_search_strategy"></a>
    341371<a
    342372 id="section*.19"></a>
    343 <!--l. 1024--><p class="noindent" ><span class="paragraphHead"><a
    344  id="x1-210000.2"></a><span
     373<!--l. 1223--><p class="noindent" ><span class="paragraphHead"><a
     374 id="x1-19000"></a><span
    345375class="cmbx-10">tree</span><span
    346376class="cmbx-10">_search</span><span
    347 class="cmbx-10">_strategy:</span></span> Pick a strategy for traversing the tree
     377class="cmbx-10">_strategy:</span></span><a
     378 id="x1-19000doc"></a> Pick a strategy for traversing the tree
    348379<br class="newline" />All strategies can be used in conjunction with any of the node comparison functions.
    349380Options which affect dfs-dive are max-backtracks-in-dive and max-dive-depth. The
     
    369400     <li class="itemize">dfs-dive-dynamic: Same as dfs-dive but once enough solution are found
    370401     switch to best-bound and if too many nodes switch to depth-first.</li></ul>
     402<!--l. 1253--><p class="indent" >   <a id="sec:variable_selection"></a>
     403
    371404<a
    372405 id="section*.20"></a>
    373 <!--l. 1054--><p class="noindent" ><span class="paragraphHead"><a
    374  id="x1-220000.2"></a><span
     406<!--l. 1254--><p class="noindent" ><span class="paragraphHead"><a
     407 id="x1-20000"></a><span
    375408class="cmbx-10">variable</span><span
    376 class="cmbx-10">_selection:</span></span> Chooses variable selection strategy
     409class="cmbx-10">_selection:</span></span><a
     410 id="x1-20000doc"></a> Chooses variable selection strategy
    377411<br class="newline" />
    378412   The default value for this string option is &#8221;strong-branching&#8221;.
     
    382416     </li>
    383417     <li class="itemize">strong-branching: Perform strong branching
    384 
    385418     </li>
    386419     <li class="itemize">reliability-branching: Use reliability branching
     
    399432     </li>
    400433     <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>
     434<!--l. 1273--><p class="indent" >    </div> <div class="story"><h3><a id="sec:MILP&#x02D9;cutting&#x02D9;planes&#x02D9;in&#x02D9;hybrid">MILP cutting planes in hybrid</a></h3>   <a id="sec:2mir_cuts"></a>
    405435<a
    406436 id="section*.21"></a>
    407 <!--l. 1075--><p class="noindent" ><span class="paragraphHead"><a
    408  id="x1-240000.3"></a><span
     437<!--l. 1275--><p class="noindent" ><span class="paragraphHead"><a
     438 id="x1-21000"></a><span
    409439class="cmbx-10">2mir</span><span
    410 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating 2-MIR cuts in
     440class="cmbx-10">_cuts:</span></span><a
     441 id="x1-21000doc"></a> Frequency (in terms of nodes) for generating 2-MIR cuts in
    411442branch-and-cut
    412443<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
     
    421452class="cmmi-10">inf</span> and its
    422453default value is 0.
     454   <a id="sec:Gomory_cuts"></a>
     455
    423456<a
    424457 id="section*.22"></a>
    425 <!--l. 1086--><p class="noindent" ><span class="paragraphHead"><a
    426  id="x1-250000.3"></a><span
     458<!--l. 1287--><p class="noindent" ><span class="paragraphHead"><a
     459 id="x1-22000"></a><span
    427460class="cmbx-10">Gomory</span><span
    428 class="cmbx-10">_cuts:</span></span> Frequency k (in terms of nodes) for generating Gomory cuts in
     461class="cmbx-10">_cuts:</span></span><a
     462 id="x1-22000doc"></a> Frequency k (in terms of nodes) for generating Gomory cuts in
    429463branch-and-cut.
    430464<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
     
    440474default value is <span
    441475class="cmsy-10">-</span>5.
    442 
     476   <a id="sec:clique_cuts"></a>
    443477<a
    444478 id="section*.23"></a>
    445 <!--l. 1097--><p class="noindent" ><span class="paragraphHead"><a
    446  id="x1-260000.3"></a><span
     479<!--l. 1299--><p class="noindent" ><span class="paragraphHead"><a
     480 id="x1-23000"></a><span
    447481class="cmbx-10">clique</span><span
    448 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating clique cuts in
     482class="cmbx-10">_cuts:</span></span><a
     483 id="x1-23000doc"></a> Frequency (in terms of nodes) for generating clique cuts in
    449484branch-and-cut
    450485<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
     
    460495default value is <span
    461496class="cmsy-10">-</span>5.
     497   <a id="sec:cover_cuts"></a>
    462498<a
    463499 id="section*.24"></a>
    464 <!--l. 1108--><p class="noindent" ><span class="paragraphHead"><a
    465  id="x1-270000.3"></a><span
     500<!--l. 1311--><p class="noindent" ><span class="paragraphHead"><a
     501 id="x1-24000"></a><span
    466502class="cmbx-10">cover</span><span
    467 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating cover cuts in
     503class="cmbx-10">_cuts:</span></span><a
     504 id="x1-24000doc"></a> Frequency (in terms of nodes) for generating cover cuts in
    468505branch-and-cut
    469506<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
     
    479516default value is <span
    480517class="cmsy-10">-</span>5.
     518   <a id="sec:flow_cover_cuts"></a>
    481519<a
    482520 id="section*.25"></a>
    483 <!--l. 1119--><p class="noindent" ><span class="paragraphHead"><a
    484  id="x1-280000.3"></a><span
     521<!--l. 1323--><p class="noindent" ><span class="paragraphHead"><a
     522 id="x1-25000"></a><span
    485523class="cmbx-10">flow</span><span
    486524class="cmbx-10">_cover</span><span
    487 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating flow cover cuts in
     525class="cmbx-10">_cuts:</span></span><a
     526 id="x1-25000doc"></a> Frequency (in terms of nodes) for generating flow cover cuts in
    488527branch-and-cut
    489528<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
     
    500539its default value is <span
    501540class="cmsy-10">-</span>5.
     541   <a id="sec:lift_and_project_cuts"></a>
    502542<a
    503543 id="section*.26"></a>
    504 <!--l. 1130--><p class="noindent" ><span class="paragraphHead"><a
    505  id="x1-290000.3"></a><span
     544<!--l. 1335--><p class="noindent" ><span class="paragraphHead"><a
     545 id="x1-26000"></a><span
    506546class="cmbx-10">lift</span><span
    507547class="cmbx-10">_and</span><span
    508548class="cmbx-10">_project</span><span
    509 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating lift-and-project
     549class="cmbx-10">_cuts:</span></span><a
     550 id="x1-26000doc"></a> Frequency (in terms of nodes) for generating lift-and-project
    510551cuts in branch-and-cut
    511552<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every
    512553-k nodes but Cbc may decide to stop generating cuts, if not enough are
     554
    513555generated at the root node, if k=-99 generate cuts only at the root node, if
    514556k=0 or 100 do not generate cuts. The valid range for this integer option is
     
    522564class="cmmi-10">&#x003C;</span> +<span
    523565class="cmmi-10">inf</span> and its default value is 0.
     566   <a id="sec:mir_cuts"></a>
    524567<a
    525568 id="section*.27"></a>
    526 <!--l. 1141--><p class="noindent" ><span class="paragraphHead"><a
    527  id="x1-300000.3"></a><span
     569<!--l. 1347--><p class="noindent" ><span class="paragraphHead"><a
     570 id="x1-27000"></a><span
    528571class="cmbx-10">mir</span><span
    529 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating MIR cuts in branch-and-cut
     572class="cmbx-10">_cuts:</span></span><a
     573 id="x1-27000doc"></a> Frequency (in terms of nodes) for generating MIR cuts in branch-and-cut
    530574<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every -k
    531575nodes but Cbc may decide to stop generating cuts, if not enough are generated at the
     
    540584default value is <span
    541585class="cmsy-10">-</span>5.
    542 
     586   <a id="sec:reduce_and_split_cuts"></a>
    543587<a
    544588 id="section*.28"></a>
    545 <!--l. 1152--><p class="noindent" ><span class="paragraphHead"><a
    546  id="x1-310000.3"></a><span
     589<!--l. 1359--><p class="noindent" ><span class="paragraphHead"><a
     590 id="x1-28000"></a><span
    547591class="cmbx-10">reduce</span><span
    548592class="cmbx-10">_and</span><span
    549593class="cmbx-10">_split</span><span
    550 class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating
     594class="cmbx-10">_cuts:</span></span><a
     595 id="x1-28000doc"></a> Frequency (in terms of nodes) for generating
    551596reduce-and-split cuts in branch-and-cut
    552597<br class="newline" />If k ¿ 0, cuts are generated every k nodes, if -99 ¡ k ¡ 0 cuts are generated every
     
    563608class="cmmi-10">&#x003C;</span> +<span
    564609class="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>
     610    </div> <div class="story"><h3><a id="sec:MINLP&#x02D9;Heuristics">MINLP Heuristics</a></h3>   <a id="sec:feasibility_pump_objective_norm"></a>
    569611<a
    570612 id="section*.29"></a>
    571 <!--l. 1165--><p class="noindent" ><span class="paragraphHead"><a
    572  id="x1-330000.4"></a><span
     613<!--l. 1372--><p class="noindent" ><span class="paragraphHead"><a
     614 id="x1-29000"></a><span
    573615class="cmbx-10">feasibility</span><span
    574616class="cmbx-10">_pump</span><span
    575617class="cmbx-10">_objective</span><span
    576 class="cmbx-10">_norm:</span></span> Norm of feasibility pump objective function
     618class="cmbx-10">_norm:</span></span><a
     619 id="x1-29000doc"></a> Norm of feasibility pump objective function
    577620<br class="newline" />The valid range for this integer option is 1 <span
    578621class="cmsy-10">&#x2264;</span> <span
     
    583626class="cmsy-10">&#x2264; </span>2
    584627and its default value is 1.
     628   <a id="sec:heuristic_RINS"></a>
    585629<a
    586630 id="section*.30"></a>
    587 <!--l. 1171--><p class="noindent" ><span class="paragraphHead"><a
    588  id="x1-340000.4"></a><span
     631<!--l. 1379--><p class="noindent" ><span class="paragraphHead"><a
     632 id="x1-30000"></a><span
    589633class="cmbx-10">heuristic</span><span
    590 class="cmbx-10">_RINS:</span></span> if yes runs the RINS heuristic
     634class="cmbx-10">_RINS:</span></span><a
     635 id="x1-30000doc"></a> if yes runs the RINS heuristic
    591636<br class="newline" />
    592637   The default value for this string option is &#8221;no&#8221;.
     
    596641     </li>
    597642     <li class="itemize">yes: runs the heuristic</li></ul>
     643<!--l. 1389--><p class="indent" >   <a id="sec:heuristic_dive_MIP_vectorLength"></a>
     644
    598645<a
    599646 id="section*.31"></a>
    600 <!--l. 1181--><p class="noindent" ><span class="paragraphHead"><a
    601  id="x1-350000.4"></a><span
     647<!--l. 1390--><p class="noindent" ><span class="paragraphHead"><a
     648 id="x1-31000"></a><span
    602649class="cmbx-10">heuristic</span><span
    603650class="cmbx-10">_dive</span><span
    604651class="cmbx-10">_MIP</span><span
    605 class="cmbx-10">_vectorLength:</span></span> if yes runs the Dive MIP VectorLength
     652class="cmbx-10">_vectorLength:</span></span><a
     653 id="x1-31000doc"></a> if yes runs the Dive MIP VectorLength
    606654heuristic
    607655<br class="newline" />
     
    612660     </li>
    613661     <li class="itemize">yes: runs the heuristic</li></ul>
    614 
     662<!--l. 1400--><p class="indent" >   <a id="sec:heuristic_dive_fractional"></a>
    615663<a
    616664 id="section*.32"></a>
    617 <!--l. 1191--><p class="noindent" ><span class="paragraphHead"><a
    618  id="x1-360000.4"></a><span
     665<!--l. 1401--><p class="noindent" ><span class="paragraphHead"><a
     666 id="x1-32000"></a><span
    619667class="cmbx-10">heuristic</span><span
    620668class="cmbx-10">_dive</span><span
    621 class="cmbx-10">_fractional:</span></span> if yes runs the Dive Fractional heuristic
     669class="cmbx-10">_fractional:</span></span><a
     670 id="x1-32000doc"></a> if yes runs the Dive Fractional heuristic
    622671<br class="newline" />
    623672   The default value for this string option is &#8221;no&#8221;.
     
    627676     </li>
    628677     <li class="itemize">yes: runs the heuristic</li></ul>
     678<!--l. 1411--><p class="indent" >   <a id="sec:heuristic_dive_vectorLength"></a>
    629679<a
    630680 id="section*.33"></a>
    631 <!--l. 1201--><p class="noindent" ><span class="paragraphHead"><a
    632  id="x1-370000.4"></a><span
     681<!--l. 1412--><p class="noindent" ><span class="paragraphHead"><a
     682 id="x1-33000"></a><span
    633683class="cmbx-10">heuristic</span><span
    634684class="cmbx-10">_dive</span><span
    635 class="cmbx-10">_vectorLength:</span></span> if yes runs the Dive VectorLength heuristic
     685class="cmbx-10">_vectorLength:</span></span><a
     686 id="x1-33000doc"></a> if yes runs the Dive VectorLength heuristic
    636687<br class="newline" />
    637688   The default value for this string option is &#8221;no&#8221;.
     
    641692     </li>
    642693     <li class="itemize">yes: runs the heuristic</li></ul>
     694<!--l. 1422--><p class="indent" >   <a id="sec:heuristic_feasibility_pump"></a>
    643695<a
    644696 id="section*.34"></a>
    645 <!--l. 1211--><p class="noindent" ><span class="paragraphHead"><a
    646  id="x1-380000.4"></a><span
     697<!--l. 1423--><p class="noindent" ><span class="paragraphHead"><a
     698 id="x1-34000"></a><span
    647699class="cmbx-10">heuristic</span><span
    648700class="cmbx-10">_feasibility</span><span
    649 class="cmbx-10">_pump:</span></span> whether the heuristic feasibility pump should be used
     701class="cmbx-10">_pump:</span></span><a
     702 id="x1-34000doc"></a> whether the heuristic feasibility pump should be used
    650703<br class="newline" />
    651704   The default value for this string option is &#8221;no&#8221;.
    652705<br class="newline" />Possible values:
     706
    653707     <ul class="itemize1">
    654708     <li class="itemize">no: don&#8217;t use it
    655709     </li>
    656710     <li class="itemize">yes: use it</li></ul>
     711<!--l. 1433--><p class="indent" >   <a id="sec:pump_for_minlp"></a>
    657712<a
    658713 id="section*.35"></a>
    659 <!--l. 1221--><p class="noindent" ><span class="paragraphHead"><a
    660  id="x1-390000.4"></a><span
     714<!--l. 1434--><p class="noindent" ><span class="paragraphHead"><a
     715 id="x1-35000"></a><span
    661716class="cmbx-10">pump</span><span
    662717class="cmbx-10">_for</span><span
    663 class="cmbx-10">_minlp:</span></span> if yes runs FP for MINLP
     718class="cmbx-10">_minlp:</span></span><a
     719 id="x1-35000doc"></a> if yes runs FP for MINLP
    664720<br class="newline" />
    665721   The default value for this string option is &#8221;no&#8221;.
     
    669725     </li>
    670726     <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>
     727<!--l. 1444--><p class="indent" >    </div> <div class="story"><h3><a id="sec:MINLP&#x02D9;heuristics">MINLP heuristics</a></h3>   <a id="sec:heuristic_dive_MIP_fractional"></a>
    676728<a
    677729 id="section*.36"></a>
    678 <!--l. 1233--><p class="noindent" ><span class="paragraphHead"><a
    679  id="x1-410000.5"></a><span
     730<!--l. 1446--><p class="noindent" ><span class="paragraphHead"><a
     731 id="x1-36000"></a><span
    680732class="cmbx-10">heuristic</span><span
    681733class="cmbx-10">_dive</span><span
    682734class="cmbx-10">_MIP</span><span
    683 class="cmbx-10">_fractional:</span></span> if yes runs the Dive MIP Fractional heuristic
     735class="cmbx-10">_fractional:</span></span><a
     736 id="x1-36000doc"></a> if yes runs the Dive MIP Fractional heuristic
    684737<br class="newline" />
    685738   The default value for this string option is &#8221;no&#8221;.
     
    689742     </li>
    690743     <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>
     744<!--l. 1456--><p class="indent" >    </div> <div class="story"><h3><a id="sec:Nlp&#x02D9;solution&#x02D9;robustness">Nlp solution robustness</a></h3>   <a id="sec:max_consecutive_failures"></a>
    695745<a
    696746 id="section*.37"></a>
    697 <!--l. 1245--><p class="noindent" ><span class="paragraphHead"><a
    698  id="x1-430000.6"></a><span
     747<!--l. 1458--><p class="noindent" ><span class="paragraphHead"><a
     748 id="x1-37000"></a><span
    699749class="cmbx-10">max</span><span
    700750class="cmbx-10">_consecutive</span><span
    701 class="cmbx-10">_failures:</span></span> (temporarily removed) Number <span
     751class="cmbx-10">_failures:</span></span><a
     752 id="x1-37000doc"></a> (temporarily removed) Number <span
    702753class="cmmi-10">n </span>of consecutive
    703754unsolved problems before aborting a branch of the tree.
     
    715766class="cmmi-10">inf</span> and its default value is
    71676710.
     768   <a id="sec:max_random_point_radius"></a>
     769
    717770<a
    718771 id="section*.38"></a>
    719 <!--l. 1255--><p class="noindent" ><span class="paragraphHead"><a
    720  id="x1-440000.6"></a><span
     772<!--l. 1469--><p class="noindent" ><span class="paragraphHead"><a
     773 id="x1-38000"></a><span
    721774class="cmbx-10">max</span><span
    722775class="cmbx-10">_random</span><span
    723776class="cmbx-10">_point</span><span
    724 class="cmbx-10">_radius:</span></span> Set max value r for coordinate of a random point.
     777class="cmbx-10">_radius:</span></span><a
     778 id="x1-38000doc"></a> Set max value r for coordinate of a random point.
    725779<br class="newline" />When picking a random point coordinate i will be in the interval [min(max(l,-r),u-r),
    726780max(min(u,r),l+r)] (where l is the lower bound for the variable and u is its upper bound)
     
    734788class="cmmi-10">inf</span> and
    735789its default value is 100000.
     790   <a id="sec:num_iterations_suspect"></a>
    736791<a
    737792 id="section*.39"></a>
    738 <!--l. 1264--><p class="noindent" ><span class="paragraphHead"><a
    739  id="x1-450000.6"></a><span
     793<!--l. 1479--><p class="noindent" ><span class="paragraphHead"><a
     794 id="x1-39000"></a><span
    740795class="cmbx-10">num</span><span
    741796class="cmbx-10">_iterations</span><span
    742 class="cmbx-10">_suspect:</span></span> Number of iterations over which a node is considered
     797class="cmbx-10">_suspect:</span></span><a
     798 id="x1-39000doc"></a> Number of iterations over which a node is considered
    743799&#8221;suspect&#8221; (for debugging purposes only, see detailed documentation).
    744800<br class="newline" />When the number of iterations to solve a node is above this number, the
     
    754810class="cmmi-10">inf</span> and its default value is <span
    755811class="cmsy-10">-</span>1.
    756 
     812   <a id="sec:num_retry_unsolved_random_point"></a>
    757813<a
    758814 id="section*.40"></a>
    759 <!--l. 1273--><p class="noindent" ><span class="paragraphHead"><a
    760  id="x1-460000.6"></a><span
     815<!--l. 1489--><p class="noindent" ><span class="paragraphHead"><a
     816 id="x1-40000"></a><span
    761817class="cmbx-10">num</span><span
    762818class="cmbx-10">_retry</span><span
    763819class="cmbx-10">_unsolved</span><span
    764820class="cmbx-10">_random</span><span
    765 class="cmbx-10">_point:</span></span> Number <span
     821class="cmbx-10">_point:</span></span><a
     822 id="x1-40000doc"></a> Number <span
    766823class="cmmi-10">k </span>of times that the algorithm will
    767824try to resolve an unsolved NLP with a random starting point (we call unsolved an
     
    783840class="cmmi-10">inf</span> and its default value is
    7848410.
     842   <a id="sec:random_point_perturbation_interval"></a>
    785843<a
    786844 id="section*.41"></a>
    787 <!--l. 1283--><p class="noindent" ><span class="paragraphHead"><a
    788  id="x1-470000.6"></a><span
     845<!--l. 1500--><p class="noindent" ><span class="paragraphHead"><a
     846 id="x1-41000"></a><span
    789847class="cmbx-10">random</span><span
    790848class="cmbx-10">_point</span><span
    791849class="cmbx-10">_perturbation</span><span
    792 class="cmbx-10">_interval:</span></span> Amount by which starting point is
     850class="cmbx-10">_interval:</span></span><a
     851 id="x1-41000doc"></a> Amount by which starting point is
    793852perturbed when choosing to pick random point by perturbating starting point
    794853<br class="newline" />The valid range for this real option is 0 <span
     
    801860class="cmmi-10">inf</span>
    802861and its default value is 1.
     862   <a id="sec:random_point_type"></a>
    803863<a
    804864 id="section*.42"></a>
    805 <!--l. 1289--><p class="noindent" ><span class="paragraphHead"><a
    806  id="x1-480000.6"></a><span
     865<!--l. 1507--><p class="noindent" ><span class="paragraphHead"><a
     866 id="x1-42000"></a><span
    807867class="cmbx-10">random</span><span
    808868class="cmbx-10">_point</span><span
    809 class="cmbx-10">_type:</span></span> method to choose a random starting point
     869class="cmbx-10">_type:</span></span><a
     870 id="x1-42000doc"></a> method to choose a random starting point
    810871<br class="newline" />
    811872   The default value for this string option is &#8221;Jon&#8221;.
     
    813874     <ul class="itemize1">
    814875     <li class="itemize">Jon: Choose random point uniformly between the bounds
     876
    815877     </li>
    816878     <li class="itemize">Andreas: perturb the starting point of the problem within a prescribed
     
    819881     <li class="itemize">Claudia: perturb the starting point using the perturbation radius suffix
    820882     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>
     883<!--l. 1520--><p class="indent" >    </div> <div class="story"><h3><a id="sec:Nlp&#x02D9;solve&#x02D9;options&#x02D9;in&#x02D9;B-Hyb">Nlp solve options in B-Hyb</a></h3>   <a id="sec:nlp_solve_frequency"></a>
    825884<a
    826885 id="section*.43"></a>
    827 <!--l. 1304--><p class="noindent" ><span class="paragraphHead"><a
    828  id="x1-500000.7"></a><span
     886<!--l. 1522--><p class="noindent" ><span class="paragraphHead"><a
     887 id="x1-43000"></a><span
    829888class="cmbx-10">nlp</span><span
    830889class="cmbx-10">_solve</span><span
    831 class="cmbx-10">_frequency:</span></span> Specify the frequency (in terms of nodes) at which NLP
     890class="cmbx-10">_frequency:</span></span><a
     891 id="x1-43000doc"></a> Specify the frequency (in terms of nodes) at which NLP
    832892relaxations are solved in B-Hyb.
    833893<br class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
     
    840900class="cmmi-10">inf</span> and its default value is
    84190110.
    842 
     902   <a id="sec:nlp_solve_max_depth"></a>
    843903<a
    844904 id="section*.44"></a>
    845 <!--l. 1311--><p class="noindent" ><span class="paragraphHead"><a
    846  id="x1-510000.7"></a><span
     905<!--l. 1530--><p class="noindent" ><span class="paragraphHead"><a
     906 id="x1-44000"></a><span
    847907class="cmbx-10">nlp</span><span
    848908class="cmbx-10">_solve</span><span
    849909class="cmbx-10">_max</span><span
    850 class="cmbx-10">_depth:</span></span> Set maximum depth in the tree at which NLP relaxations
     910class="cmbx-10">_depth:</span></span><a
     911 id="x1-44000doc"></a> Set maximum depth in the tree at which NLP relaxations
    851912are solved in B-Hyb.
    852913<br class="newline" />A depth of 0 amounts to to never solve the NLP relaxation. The valid range for this
     
    860921class="cmmi-10">inf</span> and its default value is
    86192210.
     923   <a id="sec:nlp_solves_per_depth"></a>
    862924<a
    863925 id="section*.45"></a>
    864 <!--l. 1318--><p class="noindent" ><span class="paragraphHead"><a
    865  id="x1-520000.7"></a><span
     926<!--l. 1538--><p class="noindent" ><span class="paragraphHead"><a
     927 id="x1-45000"></a><span
    866928class="cmbx-10">nlp</span><span
    867929class="cmbx-10">_solves</span><span
    868930class="cmbx-10">_per</span><span
    869 class="cmbx-10">_depth:</span></span> Set average number of nodes in the tree at which NLP
     931class="cmbx-10">_depth:</span></span><a
     932 id="x1-45000doc"></a> Set average number of nodes in the tree at which NLP
    870933relaxations are solved in B-Hyb for each depth.
    871934<br class="newline" />The valid range for this real option is 0 <span
     
    880943class="cmsy-10">&#x22C5; </span>10<sup><span
    881944class="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>
     945    </div> <div class="story"><h3><a id="sec:Options&#x02D9;for&#x02D9;MILP&#x02D9;solver">Options for MILP solver</a></h3>   <a id="sec:milp_log_level"></a>
    886946<a
    887947 id="section*.46"></a>
    888 <!--l. 1326--><p class="noindent" ><span class="paragraphHead"><a
    889  id="x1-540000.8"></a><span
     948<!--l. 1546--><p class="noindent" ><span class="paragraphHead"><a
     949 id="x1-46000"></a><span
    890950class="cmbx-10">milp</span><span
    891951class="cmbx-10">_log</span><span
    892 class="cmbx-10">_level:</span></span> specify MILP solver log level.
     952class="cmbx-10">_level:</span></span><a
     953 id="x1-46000doc"></a> specify MILP solver log level.
    893954<br class="newline" />Set the level of output of the MILP subsolver in OA : 0 - none, 1 - minimal,
    8949552 - normal low, 3 - normal high The valid range for this integer option is
     
    899960class="cmmi-10">level</span> <span
    900961class="cmsy-10">&#x2264; </span>3 and its default value is 0.
     962   <a id="sec:milp_solver"></a>
    901963<a
    902964 id="section*.47"></a>
    903 <!--l. 1334--><p class="noindent" ><span class="paragraphHead"><a
    904  id="x1-550000.8"></a><span
     965<!--l. 1555--><p class="noindent" ><span class="paragraphHead"><a
     966 id="x1-47000"></a><span
    905967class="cmbx-10">milp</span><span
    906 class="cmbx-10">_solver:</span></span> Choose the subsolver to solve MILP sub-problems in OA
     968class="cmbx-10">_solver:</span></span><a
     969 id="x1-47000doc"></a> Choose the subsolver to solve MILP sub-problems in OA
    907970decompositions.
    908971<br class="newline" />To use Cplex, a valid license is required and you should have compiled OsiCpx in
    909972COIN-OR (see Osi documentation). The default value for this string option is
    910973&#8221;Cbc_D&#8221;.
     974
    911975<br class="newline" />Possible values:
    912976     <ul class="itemize1">
     
    916980     </li>
    917981     <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 
     982<!--l. 1568--><p class="indent" >    </div> <div class="story"><h3><a id="sec:Options&#x02D9;for&#x02D9;OA&#x02D9;decomposition">Options for OA decomposition</a></h3>
     983<a id="sec:oa_decomposition"></a>
    923984<a
    924985 id="section*.48"></a>
    925 <!--l. 1349--><p class="noindent" ><span class="paragraphHead"><a
    926  id="x1-570000.9"></a><span
     986<!--l. 1570--><p class="noindent" ><span class="paragraphHead"><a
     987 id="x1-48000"></a><span
    927988class="cmbx-10">oa</span><span
    928 class="cmbx-10">_decomposition:</span></span> If yes do initial OA decomposition
     989class="cmbx-10">_decomposition:</span></span><a
     990 id="x1-48000doc"></a> If yes do initial OA decomposition
    929991<br class="newline" />
    930992   The default value for this string option is &#8221;no&#8221;.
     
    934996     </li>
    935997     <li class="itemize">yes:</li></ul>
     998<!--l. 1580--><p class="indent" >   <a id="sec:oa_log_frequency"></a>
    936999<a
    9371000 id="section*.49"></a>
    938 <!--l. 1359--><p class="noindent" ><span class="paragraphHead"><a
    939  id="x1-580000.9"></a><span
     1001<!--l. 1581--><p class="noindent" ><span class="paragraphHead"><a
     1002 id="x1-49000"></a><span
    9401003class="cmbx-10">oa</span><span
    9411004class="cmbx-10">_log</span><span
    942 class="cmbx-10">_frequency:</span></span> display an update on lower and upper bounds in OA every n
     1005class="cmbx-10">_frequency:</span></span><a
     1006 id="x1-49000doc"></a> display an update on lower and upper bounds in OA every n
    9431007seconds
    9441008<br class="newline" />The valid range for this real option is 0 <span
     
    9501014class="cmmi-10">inf</span> and its default
    9511015value is 100.
     1016   <a id="sec:oa_log_level"></a>
    9521017<a
    9531018 id="section*.50"></a>
    954 <!--l. 1365--><p class="noindent" ><span class="paragraphHead"><a
    955  id="x1-590000.9"></a><span
     1019<!--l. 1588--><p class="noindent" ><span class="paragraphHead"><a
     1020 id="x1-50000"></a><span
    9561021class="cmbx-10">oa</span><span
    9571022class="cmbx-10">_log</span><span
    958 class="cmbx-10">_level:</span></span> specify OA iterations log level.
     1023class="cmbx-10">_level:</span></span><a
     1024 id="x1-50000doc"></a> specify OA iterations log level.
    9591025<br class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
    9601026The valid range for this integer option is 0 <span
     
    9651031class="cmsy-10">&#x2264; </span>2 and its default value is
    96610321.
    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>
     1033    </div> <div class="story"><h3><a id="sec:Options&#x02D9;for&#x02D9;ecp&#x02D9;cuts&#x02D9;generation">Options for ecp cuts generation</a></h3>
     1034<a id="sec:ecp_abs_tol"></a>
    9711035<a
    9721036 id="section*.51"></a>
    973 <!--l. 1374--><p class="noindent" ><span class="paragraphHead"><a
    974  id="x1-610000.10"></a><span
     1037<!--l. 1597--><p class="noindent" ><span class="paragraphHead"><a
     1038 id="x1-51000"></a><span
    9751039class="cmbx-10">ecp</span><span
    9761040class="cmbx-10">_abs</span><span
    977 class="cmbx-10">_tol:</span></span> Set the absolute termination tolerance for ECP rounds.
     1041class="cmbx-10">_tol:</span></span><a
     1042 id="x1-51000doc"></a> Set the absolute termination tolerance for ECP rounds.
    9781043<br class="newline" />The valid range for this real option is 0 <span
    9791044class="cmsy-10">&#x2264;</span> <span
     
    9871052class="cmsy-7">-</span><span
    9881053class="cmr-7">06</span></sup>.
     1054   <a id="sec:ecp_max_rounds"></a>
     1055
    9891056<a
    9901057 id="section*.52"></a>
    991 <!--l. 1380--><p class="noindent" ><span class="paragraphHead"><a
    992  id="x1-620000.10"></a><span
     1058<!--l. 1604--><p class="noindent" ><span class="paragraphHead"><a
     1059 id="x1-52000"></a><span
    9931060class="cmbx-10">ecp</span><span
    9941061class="cmbx-10">_max</span><span
    995 class="cmbx-10">_rounds:</span></span> Set the maximal number of rounds of ECP cuts.
     1062class="cmbx-10">_rounds:</span></span><a
     1063 id="x1-52000doc"></a> Set the maximal number of rounds of ECP cuts.
    9961064<br class="newline" />The valid range for this integer option is 0 <span
    9971065class="cmsy-10">&#x2264;</span> <span
     
    10021070class="cmmi-10">inf</span> and its
    10031071default value is 5.
     1072   <a id="sec:ecp_propability_factor"></a>
    10041073<a
    10051074 id="section*.53"></a>
    1006 <!--l. 1386--><p class="noindent" ><span class="paragraphHead"><a
    1007  id="x1-630000.10"></a><span
     1075<!--l. 1611--><p class="noindent" ><span class="paragraphHead"><a
     1076 id="x1-53000"></a><span
    10081077class="cmbx-10">ecp</span><span
    10091078class="cmbx-10">_propability</span><span
    1010 class="cmbx-10">_factor:</span></span> Factor appearing in formula for skipping ECP cuts.
     1079class="cmbx-10">_factor:</span></span><a
     1080 id="x1-53000doc"></a> Factor appearing in formula for skipping ECP cuts.
    10111081<br class="newline" />Choosing -1 disables the skipping. The valid range for this real option is
    10121082<span
     
    10191089class="cmmi-10">&#x003C;</span> +<span
    10201090class="cmmi-10">inf</span> and its default value is 10.
    1021 
     1091   <a id="sec:ecp_rel_tol"></a>
    10221092<a
    10231093 id="section*.54"></a>
    1024 <!--l. 1392--><p class="noindent" ><span class="paragraphHead"><a
    1025  id="x1-640000.10"></a><span
     1094<!--l. 1618--><p class="noindent" ><span class="paragraphHead"><a
     1095 id="x1-54000"></a><span
    10261096class="cmbx-10">ecp</span><span
    10271097class="cmbx-10">_rel</span><span
    1028 class="cmbx-10">_tol:</span></span> Set the relative termination tolerance for ECP rounds.
     1098class="cmbx-10">_tol:</span></span><a
     1099 id="x1-54000doc"></a> Set the relative termination tolerance for ECP rounds.
    10291100<br class="newline" />The valid range for this real option is 0 <span
    10301101class="cmsy-10">&#x2264;</span> <span
     
    10351106class="cmmi-10">inf</span> and its default value is
    103611070.
     1108   <a id="sec:filmint_ecp_cuts"></a>
    10371109<a
    10381110 id="section*.55"></a>
    1039 <!--l. 1398--><p class="noindent" ><span class="paragraphHead"><a
    1040  id="x1-650000.10"></a><span
     1111<!--l. 1625--><p class="noindent" ><span class="paragraphHead"><a
     1112 id="x1-55000"></a><span
    10411113class="cmbx-10">filmint</span><span
    10421114class="cmbx-10">_ecp</span><span
    1043 class="cmbx-10">_cuts:</span></span> Specify the frequency (in terms of nodes) at which some a la
     1115class="cmbx-10">_cuts:</span></span><a
     1116 id="x1-55000doc"></a> Specify the frequency (in terms of nodes) at which some a la
    10441117filmint ecp cuts are generated.
    10451118<br class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
     
    10521125class="cmmi-10">inf</span> and its default value is
    105311260.
    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>
     1127    </div> <div class="story"><h3><a id="sec:Options&#x02D9;for&#x02D9;feasibility&#x02D9;checker&#x02D9;using&#x02D9;OA&#x02D9;cuts">Options for feasibility checker
     1128using OA cuts</a></h3>   <a id="sec:feas_check_cut_types"></a>
    10581129<a
    10591130 id="section*.56"></a>
    1060 <!--l. 1407--><p class="noindent" ><span class="paragraphHead"><a
    1061  id="x1-670000.11"></a><span
     1131<!--l. 1634--><p class="noindent" ><span class="paragraphHead"><a
     1132 id="x1-56000"></a><span
    10621133class="cmbx-10">feas</span><span
    10631134class="cmbx-10">_check</span><span
    10641135class="cmbx-10">_cut</span><span
    1065 class="cmbx-10">_types:</span></span> Choose the type of cuts generated when an integer feasible
     1136class="cmbx-10">_types:</span></span><a
     1137 id="x1-56000doc"></a> Choose the type of cuts generated when an integer feasible
    10661138solution is found
    10671139<br class="newline" />If it seems too much memory is used should try Benders to use less The default value
    1068 for 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.
     1140for this string option is &#8221;outer-approximations&#8221;.
     1141<br class="newline" />Possible values:
     1142     <ul class="itemize1">
     1143     <li class="itemize">outer-approximations: Generate a set of Outer Approximations cuts.
    10721144     </li>
    10731145     <li class="itemize">Benders: Generate a single Benders cut.</li></ul>
     1146<!--l. 1645--><p class="indent" >   <a id="sec:feas_check_discard_policy"></a>
     1147
    10741148<a
    10751149 id="section*.57"></a>
    1076 <!--l. 1418--><p class="noindent" ><span class="paragraphHead"><a
    1077  id="x1-680000.11"></a><span
     1150<!--l. 1646--><p class="noindent" ><span class="paragraphHead"><a
     1151 id="x1-57000"></a><span
    10781152class="cmbx-10">feas</span><span
    10791153class="cmbx-10">_check</span><span
    10801154class="cmbx-10">_discard</span><span
    1081 class="cmbx-10">_policy:</span></span> How cuts from feasibility checker are discarded
     1155class="cmbx-10">_policy:</span></span><a
     1156 id="x1-57000doc"></a> How cuts from feasibility checker are discarded
    10821157<br class="newline" />Normally to avoid cycle cuts from feasibility checker should not be discarded in the
    10831158node where they are generated. However Cbc sometimes does it if no care
     
    10931168     <li class="itemize">detect-cycles: Detect if a cycle occurs and only in this case force not to
    10941169     discard.
    1095 
    10961170     </li>
    10971171     <li class="itemize">keep-all: Force cuts from feasibility checker not to be discarded (memory
     
    11001174     <li class="itemize">treated-as-normal: Cuts from memory checker can be discarded as any
    11011175     other cuts (code may cycle then)</li></ul>
     1176<!--l. 1671--><p class="indent" >   <a id="sec:generate_benders_after_so_many_oa"></a>
    11021177<a
    11031178 id="section*.58"></a>
    1104 <!--l. 1443--><p class="noindent" ><span class="paragraphHead"><a
    1105  id="x1-690000.11"></a><span
     1179<!--l. 1672--><p class="noindent" ><span class="paragraphHead"><a
     1180 id="x1-58000"></a><span
    11061181class="cmbx-10">generate</span><span
    11071182class="cmbx-10">_benders</span><span
     
    11091184class="cmbx-10">_so</span><span
    11101185class="cmbx-10">_many</span><span
    1111 class="cmbx-10">_oa:</span></span> Specify that after so many oa cuts have
     1186class="cmbx-10">_oa:</span></span><a
     1187 id="x1-58000doc"></a> Specify that after so many oa cuts have
    11121188been generated Benders cuts should be generated instead.
    11131189<br class="newline" />It seems that sometimes generating too many oa cuts slows down the optimization
     
    11251201class="cmmi-10">inf</span>
    11261202and 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>
     1203    </div> <div class="story"><h3><a id="sec:Options&#x02D9;for&#x02D9;feasibility&#x02D9;pump">Options for feasibility pump</a></h3>   <a id="sec:fp_log_frequency"></a>
    11311204<a
    11321205 id="section*.59"></a>
    1133 <!--l. 1455--><p class="noindent" ><span class="paragraphHead"><a
    1134  id="x1-710000.12"></a><span
     1206<!--l. 1684--><p class="noindent" ><span class="paragraphHead"><a
     1207 id="x1-59000"></a><span
    11351208class="cmbx-10">fp</span><span
    11361209class="cmbx-10">_log</span><span
    1137 class="cmbx-10">_frequency:</span></span> display an update on lower and upper bounds in FP every n
     1210class="cmbx-10">_frequency:</span></span><a
     1211 id="x1-59000doc"></a> display an update on lower and upper bounds in FP every n
    11381212seconds
    11391213<br class="newline" />The valid range for this real option is 0 <span
     
    11451219class="cmmi-10">inf</span> and its default
    11461220value is 100.
     1221   <a id="sec:fp_log_level"></a>
     1222
    11471223<a
    11481224 id="section*.60"></a>
    1149 <!--l. 1461--><p class="noindent" ><span class="paragraphHead"><a
    1150  id="x1-720000.12"></a><span
     1225<!--l. 1691--><p class="noindent" ><span class="paragraphHead"><a
     1226 id="x1-60000"></a><span
    11511227class="cmbx-10">fp</span><span
    11521228class="cmbx-10">_log</span><span
    1153 class="cmbx-10">_level:</span></span> specify FP iterations log level.
     1229class="cmbx-10">_level:</span></span><a
     1230 id="x1-60000doc"></a> specify FP iterations log level.
    11541231<br class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
    11551232The valid range for this integer option is 0 <span
     
    11601237class="cmsy-10">&#x2264; </span>2 and its default value is
    116112381.
    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>
     1239    </div> <div class="story"><h3><a id="sec:Options&#x02D9;for&#x02D9;non-convex&#x02D9;problems">Options for non-convex problems</a></h3>
     1240<a id="sec:coeff_var_threshold"></a>
    11661241<a
    11671242 id="section*.61"></a>
    1168 <!--l. 1470--><p class="noindent" ><span class="paragraphHead"><a
    1169  id="x1-740000.13"></a><span
     1243<!--l. 1700--><p class="noindent" ><span class="paragraphHead"><a
     1244 id="x1-61000"></a><span
    11701245class="cmbx-10">coeff</span><span
    11711246class="cmbx-10">_var</span><span
    1172 class="cmbx-10">_threshold:</span></span> Coefficient of variation threshold (for dynamic definition of
     1247class="cmbx-10">_threshold:</span></span><a
     1248 id="x1-61000doc"></a> Coefficient of variation threshold (for dynamic definition of
    11731249cutoff_decr).
    11741250<br class="newline" />Coefficient of variation threshold (for dynamic definition of cutoff_decr). The valid
     
    118212580<span
    11831259class="cmmi-10">.</span>1.
    1184 
     1260   <a id="sec:dynamic_def_cutoff_decr"></a>
    11851261<a
    11861262 id="section*.62"></a>
    1187 <!--l. 1477--><p class="noindent" ><span class="paragraphHead"><a
    1188  id="x1-750000.13"></a><span
     1263<!--l. 1708--><p class="noindent" ><span class="paragraphHead"><a
     1264 id="x1-62000"></a><span
    11891265class="cmbx-10">dynamic</span><span
    11901266class="cmbx-10">_def</span><span
    11911267class="cmbx-10">_cutoff</span><span
    1192 class="cmbx-10">_decr:</span></span> Do you want to define the parameter cutoff_decr
     1268class="cmbx-10">_decr:</span></span><a
     1269 id="x1-62000doc"></a> Do you want to define the parameter cutoff_decr
    11931270dynamically?
    11941271<br class="newline" />
     
    11991276     </li>
    12001277     <li class="itemize">yes: Yes, define it dynamically</li></ul>
     1278<!--l. 1718--><p class="indent" >   <a id="sec:first_perc_for_cutoff_decr"></a>
    12011279<a
    12021280 id="section*.63"></a>
    1203 <!--l. 1487--><p class="noindent" ><span class="paragraphHead"><a
    1204  id="x1-760000.13"></a><span
     1281<!--l. 1719--><p class="noindent" ><span class="paragraphHead"><a
     1282 id="x1-63000"></a><span
    12051283class="cmbx-10">first</span><span
    12061284class="cmbx-10">_perc</span><span
    12071285class="cmbx-10">_for</span><span
    12081286class="cmbx-10">_cutoff</span><span
    1209 class="cmbx-10">_decr:</span></span> The percentage used when, the coeff of variance is
     1287class="cmbx-10">_decr:</span></span><a
     1288 id="x1-63000doc"></a> The percentage used when, the coeff of variance is
    12101289smaller than the threshold, to compute the cutoff_decr dynamically.
    12111290<br class="newline" />The percentage used when, the coeff of variance is smaller than the threshold, to
     
    12251304class="cmsy-10">-</span>0<span
    12261305class="cmmi-10">.</span>02.
     1306   <a id="sec:max_consecutive_infeasible"></a>
    12271307<a
    12281308 id="section*.64"></a>
    1229 <!--l. 1495--><p class="noindent" ><span class="paragraphHead"><a
    1230  id="x1-770000.13"></a><span
     1309<!--l. 1728--><p class="noindent" ><span class="paragraphHead"><a
     1310 id="x1-64000"></a><span
    12311311class="cmbx-10">max</span><span
    12321312class="cmbx-10">_consecutive</span><span
    1233 class="cmbx-10">_infeasible:</span></span> Number of consecutive infeasible subproblems before
     1313class="cmbx-10">_infeasible:</span></span><a
     1314 id="x1-64000doc"></a> Number of consecutive infeasible subproblems before
    12341315aborting a branch.
    12351316<br class="newline" />Will continue exploring a branch of the tree until &#8221;max_consecutive_infeasible&#8221;consecutive
     
    12431324class="cmmi-10">inf</span> and its default value is
    124413250.
     1326
     1327   <a id="sec:num_resolve_at_infeasibles"></a>
    12451328<a
    12461329 id="section*.65"></a>
    1247 <!--l. 1503--><p class="noindent" ><span class="paragraphHead"><a
    1248  id="x1-780000.13"></a><span
     1330<!--l. 1737--><p class="noindent" ><span class="paragraphHead"><a
     1331 id="x1-65000"></a><span
    12491332class="cmbx-10">num</span><span
    12501333class="cmbx-10">_resolve</span><span
    12511334class="cmbx-10">_at</span><span
    1252 class="cmbx-10">_infeasibles:</span></span> Number <span
     1335class="cmbx-10">_infeasibles:</span></span><a
     1336 id="x1-65000doc"></a> Number <span
    12531337class="cmmi-10">k </span>of tries to resolve an infeasible node
    12541338(other than the root) of the tree with different starting point.
     
    12651349class="cmmi-10">inf</span> and its default value is
    126613500.
     1351   <a id="sec:num_resolve_at_node"></a>
    12671352<a
    12681353 id="section*.66"></a>
    1269 <!--l. 1511--><p class="noindent" ><span class="paragraphHead"><a
    1270  id="x1-790000.13"></a><span
     1354<!--l. 1746--><p class="noindent" ><span class="paragraphHead"><a
     1355 id="x1-66000"></a><span
    12711356class="cmbx-10">num</span><span
    12721357class="cmbx-10">_resolve</span><span
    12731358class="cmbx-10">_at</span><span
    1274 class="cmbx-10">_node:</span></span> Number <span
     1359class="cmbx-10">_node:</span></span><a
     1360 id="x1-66000doc"></a> Number <span
    12751361class="cmmi-10">k </span>of tries to resolve a node (other than the root)
    12761362of the tree with different starting point.
     
    12861372class="cmmi-10">&#x003C;</span> +<span
    12871373class="cmmi-10">inf</span> and its default value is 0.
    1288 
     1374   <a id="sec:num_resolve_at_root"></a>
    12891375<a
    12901376 id="section*.67"></a>
    1291 <!--l. 1519--><p class="noindent" ><span class="paragraphHead"><a
    1292  id="x1-800000.13"></a><span
     1377<!--l. 1755--><p class="noindent" ><span class="paragraphHead"><a
     1378 id="x1-67000"></a><span
    12931379class="cmbx-10">num</span><span
    12941380class="cmbx-10">_resolve</span><span
    12951381class="cmbx-10">_at</span><span
    1296 class="cmbx-10">_root:</span></span> Number <span
     1382class="cmbx-10">_root:</span></span><a
     1383 id="x1-67000doc"></a> Number <span
    12971384class="cmmi-10">k </span>of tries to resolve the root node with different
    12981385starting points.
     
    13081395class="cmmi-10">&#x003C;</span> +<span
    13091396class="cmmi-10">inf</span> and its default value is 0.
     1397   <a id="sec:second_perc_for_cutoff_decr"></a>
    13101398<a
    13111399 id="section*.68"></a>
    1312 <!--l. 1527--><p class="noindent" ><span class="paragraphHead"><a
    1313  id="x1-810000.13"></a><span
     1400<!--l. 1764--><p class="noindent" ><span class="paragraphHead"><a
     1401 id="x1-68000"></a><span
    13141402class="cmbx-10">second</span><span
    13151403class="cmbx-10">_perc</span><span
    13161404class="cmbx-10">_for</span><span
    13171405class="cmbx-10">_cutoff</span><span
    1318 class="cmbx-10">_decr:</span></span> The percentage used when, the coeff of
     1406class="cmbx-10">_decr:</span></span><a
     1407 id="x1-68000doc"></a> The percentage used when, the coeff of
    13191408variance is greater than the threshold, to compute the cutoff_decr dynamically.
    13201409<br class="newline" />The percentage used when, the coeff of variance is greater than the threshold, to
     
    13341423class="cmsy-10">-</span>0<span
    13351424class="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>
     1425    </div> <div class="story"><h3><a id="sec:Outer&#x02D9;Approximation&#x02D9;cuts&#x02D9;generation">Outer Approximation cuts generation</a></h3>
     1426<a id="sec:add_only_violated_oa"></a>
    13401427<a
    13411428 id="section*.69"></a>
    1342 <!--l. 1537--><p class="noindent" ><span class="paragraphHead"><a
    1343  id="x1-830000.14"></a><span
     1429<!--l. 1774--><p class="noindent" ><span class="paragraphHead"><a
     1430 id="x1-69000"></a><span
    13441431class="cmbx-10">add</span><span
    13451432class="cmbx-10">_only</span><span
    13461433class="cmbx-10">_violated</span><span
    1347 class="cmbx-10">_oa:</span></span> Do we add all OA cuts or only the ones violated by current
     1434class="cmbx-10">_oa:</span></span><a
     1435 id="x1-69000doc"></a> Do we add all OA cuts or only the ones violated by current
    13481436point?
    13491437<br class="newline" />
    13501438   The default value for this string option is &#8221;no&#8221;.
    13511439<br class="newline" />Possible values:
     1440
    13521441     <ul class="itemize1">
    13531442     <li class="itemize">no: Add all cuts
    13541443     </li>
    13551444     <li class="itemize">yes: Add only violated Cuts</li></ul>
     1445<!--l. 1784--><p class="indent" >   <a id="sec:oa_cuts_log_level"></a>
    13561446<a
    13571447 id="section*.70"></a>
    1358 <!--l. 1547--><p class="noindent" ><span class="paragraphHead"><a
    1359  id="x1-840000.14"></a><span
     1448<!--l. 1785--><p class="noindent" ><span class="paragraphHead"><a
     1449 id="x1-70000"></a><span
    13601450class="cmbx-10">oa</span><span
    13611451class="cmbx-10">_cuts</span><span
    13621452class="cmbx-10">_log</span><span
    1363 class="cmbx-10">_level:</span></span> level of log when generating OA cuts.
     1453class="cmbx-10">_level:</span></span><a
     1454 id="x1-70000doc"></a> level of log when generating OA cuts.
    13641455<br class="newline" />0: outputs nothing, 1: when a cut is generated, its violation and index of row
    13651456from which it originates, 2: always output violation of the cut. 3: output
     
    13731464class="cmmi-10">&#x003C;</span> +<span
    13741465class="cmmi-10">inf</span> and its default value is 0.
     1466   <a id="sec:oa_cuts_scope"></a>
    13751467<a
    13761468 id="section*.71"></a>
    1377 <!--l. 1559--><p class="noindent" ><span class="paragraphHead"><a
    1378  id="x1-850000.14"></a><span
     1469<!--l. 1798--><p class="noindent" ><span class="paragraphHead"><a
     1470 id="x1-71000"></a><span
    13791471class="cmbx-10">oa</span><span
    13801472class="cmbx-10">_cuts</span><span
    1381 class="cmbx-10">_scope:</span></span> Specify if OA cuts added are to be set globally or locally valid
     1473class="cmbx-10">_scope:</span></span><a
     1474 id="x1-71000doc"></a> Specify if OA cuts added are to be set globally or locally valid
    13821475<br class="newline" />
    13831476   The default value for this string option is &#8221;global&#8221;.
    13841477<br class="newline" />Possible values:
    1385 
    13861478     <ul class="itemize1">
    13871479     <li class="itemize">local: Cuts are treated as globally valid
    13881480     </li>
    13891481     <li class="itemize">global: Cuts are treated as locally valid</li></ul>
     1482<!--l. 1808--><p class="indent" >   <a id="sec:tiny_element"></a>
    13901483<a
    13911484 id="section*.72"></a>
    1392 <!--l. 1569--><p class="noindent" ><span class="paragraphHead"><a
    1393  id="x1-860000.14"></a><span
     1485<!--l. 1809--><p class="noindent" ><span class="paragraphHead"><a
     1486 id="x1-72000"></a><span
    13941487class="cmbx-10">tiny</span><span
    1395 class="cmbx-10">_element:</span></span> Value for tiny element in OA cut
     1488class="cmbx-10">_element:</span></span><a
     1489 id="x1-72000doc"></a> Value for tiny element in OA cut
    13961490<br class="newline" />We will remove &#8221;cleanly&#8221; (by relaxing cut) an element lower than this. The valid
    13971491range for this real option is <span
     
    14061500class="cmsy-7">-</span><span
    14071501class="cmr-7">08</span></sup>.
     1502   <a id="sec:very_tiny_element"></a>
    14081503<a
    14091504 id="section*.73"></a>
    1410 <!--l. 1576--><p class="noindent" ><span class="paragraphHead"><a
    1411  id="x1-870000.14"></a><span
     1505<!--l. 1817--><p class="noindent" ><span class="paragraphHead"><a
     1506 id="x1-73000"></a><span
    14121507class="cmbx-10">very</span><span
    14131508class="cmbx-10">_tiny</span><span
    1414 class="cmbx-10">_element:</span></span> Value for very tiny element in OA cut
     1509class="cmbx-10">_element:</span></span><a
     1510 id="x1-73000doc"></a> Value for very tiny element in OA cut
    14151511<br class="newline" />Algorithm will take the risk of neglecting an element lower than this. The valid range
    14161512for this real option is <span
     
    14261522class="cmsy-7">-</span><span
    14271523class="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>
     1524    </div> <div class="story"><h3><a id="sec:Output&#x02D9;ond&#x02D9;log-levels&#x02D9;options">Output ond log-levels options</a></h3>   <a id="sec:bb_log_interval"></a>
     1525
    14321526<a
    14331527 id="section*.74"></a>
    1434 <!--l. 1585--><p class="noindent" ><span class="paragraphHead"><a
    1435  id="x1-890000.15"></a><span
     1528<!--l. 1826--><p class="noindent" ><span class="paragraphHead"><a
     1529 id="x1-74000"></a><span
    14361530class="cmbx-10">bb</span><span
    14371531class="cmbx-10">_log</span><span
    1438 class="cmbx-10">_interval:</span></span> Interval at which node level output is printed.
     1532class="cmbx-10">_interval:</span></span><a
     1533 id="x1-74000doc"></a> Interval at which node level output is printed.
    14391534<br class="newline" />Set the interval (in terms of number of nodes) at which a log on node resolutions
    14401535(consisting of lower and upper bounds) is given. The valid range for this integer
     
    14461541class="cmmi-10">&#x003C;</span> +<span
    14471542class="cmmi-10">inf</span> and its default value is 100.
     1543   <a id="sec:bb_log_level"></a>
    14481544<a
    14491545 id="section*.75"></a>
    1450 <!--l. 1593--><p class="noindent" ><span class="paragraphHead"><a
    1451  id="x1-900000.15"></a><span
     1546<!--l. 1835--><p class="noindent" ><span class="paragraphHead"><a
     1547 id="x1-75000"></a><span
    14521548class="cmbx-10">bb</span><span
    14531549class="cmbx-10">_log</span><span
    1454 class="cmbx-10">_level:</span></span> specify main branch-and-bound log level.
     1550class="cmbx-10">_level:</span></span><a
     1551 id="x1-75000doc"></a> specify main branch-and-bound log level.
    14551552<br class="newline" />Set the level of output of the branch-and-bound : 0 - none, 1 - minimal, 2 - normal
    14561553low, 3 - normal high The valid range for this integer option is 0 <span
     
    14611558class="cmsy-10">&#x2264; </span>5
    14621559and its default value is 1.
     1560   <a id="sec:lp_log_level"></a>
    14631561<a
    14641562 id="section*.76"></a>
    1465 <!--l. 1601--><p class="noindent" ><span class="paragraphHead"><a
    1466  id="x1-910000.15"></a><span
     1563<!--l. 1844--><p class="noindent" ><span class="paragraphHead"><a
     1564 id="x1-76000"></a><span
    14671565class="cmbx-10">lp</span><span
    14681566class="cmbx-10">_log</span><span
    1469 class="cmbx-10">_level:</span></span> specify LP log level.
     1567class="cmbx-10">_level:</span></span><a
     1568 id="x1-76000doc"></a> specify LP log level.
    14701569<br class="newline" />Set the level of output of the linear programming sub-solver in B-Hyb or B-QG : 0 -
    14711570none, 1 - minimal, 2 - normal low, 3 - normal high, 4 - verbose The valid
     
    14771576class="cmsy-10">&#x2264; </span>4 and its default value is
    147815770.
     1578   <a id="sec:nlp_log_at_root"></a>
    14791579<a
    14801580 id="section*.77"></a>
    1481 <!--l. 1610--><p class="noindent" ><span class="paragraphHead"><a
    1482  id="x1-920000.15"></a><span
     1581<!--l. 1854--><p class="noindent" ><span class="paragraphHead"><a
     1582 id="x1-77000"></a><span
    14831583class="cmbx-10">nlp</span><span
    14841584class="cmbx-10">_log</span><span
    14851585class="cmbx-10">_at</span><span
    1486 class="cmbx-10">_root:</span></span> Specify a different log level for root relaxtion.
     1586class="cmbx-10">_root:</span></span><a
     1587 id="x1-77000doc"></a> Specify a different log level for root relaxtion.
    14871588<br class="newline" />The valid range for this integer option is 0 <span
    14881589class="cmsy-10">&#x2264;</span> <span
     
    14931594class="cmsy-10">&#x2264; </span>12 and its default
    14941595value 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>
     1596    </div> <div class="story"><h3><a id="sec:Strong&#x02D9;branching&#x02D9;setup">Strong branching setup</a></h3>   <a id="sec:candidate_sort_criterion"></a>
    15001597<a
    15011598 id="section*.78"></a>
    1502 <!--l. 1618--><p class="noindent" ><span class="paragraphHead"><a
    1503  id="x1-940000.16"></a><span
     1599<!--l. 1862--><p class="noindent" ><span class="paragraphHead"><a
     1600 id="x1-78000"></a><span
    15041601class="cmbx-10">candidate</span><span
    15051602class="cmbx-10">_sort</span><span
    1506 class="cmbx-10">_criterion:</span></span> Choice of the criterion to choose candidates in
     1603class="cmbx-10">_criterion:</span></span><a
     1604 id="x1-78000doc"></a> Choice of the criterion to choose candidates in
    15071605strong-branching
    15081606<br class="newline" />
     
    15171615     </li>
    15181616     <li class="itemize">least-fractional: Sort by increasing integer infeasibility</li></ul>
     1617<!--l. 1874--><p class="indent" >   <a id="sec:maxmin_crit_have_sol"></a>
     1618
    15191619<a
    15201620 id="section*.79"></a>
    1521 <!--l. 1630--><p class="noindent" ><span class="paragraphHead"><a
    1522  id="x1-950000.16"></a><span
     1621<!--l. 1875--><p class="noindent" ><span class="paragraphHead"><a
     1622 id="x1-79000"></a><span
    15231623class="cmbx-10">maxmin</span><span
    15241624class="cmbx-10">_crit</span><span
    15251625class="cmbx-10">_have</span><span
    1526 class="cmbx-10">_sol:</span></span> Weight towards minimum in of lower and upper branching
     1626class="cmbx-10">_sol:</span></span><a
     1627 id="x1-79000doc"></a> Weight towards minimum in of lower and upper branching
    15271628estimates when a solution has been found.
    15281629<br class="newline" />The valid range for this real option is 0 <span
     
    15351636value is 0<span
    15361637class="cmmi-10">.</span>1.
     1638   <a id="sec:maxmin_crit_no_sol"></a>
    15371639<a
    15381640 id="section*.80"></a>
    1539 <!--l. 1636--><p class="noindent" ><span class="paragraphHead"><a
    1540  id="x1-960000.16"></a><span
     1641<!--l. 1882--><p class="noindent" ><span class="paragraphHead"><a
     1642 id="x1-80000"></a><span
    15411643class="cmbx-10">maxmin</span><span
    15421644class="cmbx-10">_crit</span><span
    15431645class="cmbx-10">_no</span><span
    1544 class="cmbx-10">_sol:</span></span> Weight towards minimum in of lower and upper branching
     1646class="cmbx-10">_sol:</span></span><a
     1647 id="x1-80000doc"></a> Weight towards minimum in of lower and upper branching
    15451648estimates when no solution has been found yet.
    15461649<br class="newline" />The valid range for this real option is 0 <span
     
    15531656value is 0<span
    15541657class="cmmi-10">.</span>7.
     1658   <a id="sec:min_number_strong_branch"></a>
    15551659<a
    15561660 id="section*.81"></a>
    1557 <!--l. 1642--><p class="noindent" ><span class="paragraphHead"><a
    1558  id="x1-970000.16"></a><span
     1661<!--l. 1889--><p class="noindent" ><span class="paragraphHead"><a
     1662 id="x1-81000"></a><span
    15591663class="cmbx-10">min</span><span
    15601664class="cmbx-10">_number</span><span
    15611665class="cmbx-10">_strong</span><span
    1562 class="cmbx-10">_branch:</span></span> Sets minimum number of variables for strong
     1666class="cmbx-10">_branch:</span></span><a
     1667 id="x1-81000doc"></a> Sets minimum number of variables for strong
    15631668branching (overriding trust)
    15641669<br class="newline" />The valid range for this integer option is 0 <span
     
    15711676class="cmmi-10">inf</span>
    15721677and its default value is 0.
     1678   <a id="sec:number_before_trust_list"></a>
    15731679<a
    15741680 id="section*.82"></a>
    1575 <!--l. 1648--><p class="noindent" ><span class="paragraphHead"><a
    1576  id="x1-980000.16"></a><span
     1681<!--l. 1896--><p class="noindent" ><span class="paragraphHead"><a
     1682 id="x1-82000"></a><span
    15771683class="cmbx-10">number</span><span
    15781684class="cmbx-10">_before</span><span
    15791685class="cmbx-10">_trust</span><span
    1580 class="cmbx-10">_list:</span></span> Set the number of branches on a variable before its
     1686class="cmbx-10">_list:</span></span><a
     1687 id="x1-82000doc"></a> Set the number of branches on a variable before its
    15811688pseudo costs are to be believed during setup of strong branching candidate list.
    15821689<br class="newline" />The default value is that of &#8221;number_before_trust&#8221; The valid range for this integer
    1583 
    15841690option is <span
    15851691class="cmsy-10">-</span>1 <span
     
    15921698class="cmmi-10">inf</span> and its default value is
    159316990.
     1700   <a id="sec:number_look_ahead"></a>
    15941701<a
    15951702 id="section*.83"></a>
    1596 <!--l. 1655--><p class="noindent" ><span class="paragraphHead"><a
    1597  id="x1-990000.16"></a><span
     1703<!--l. 1904--><p class="noindent" ><span class="paragraphHead"><a
     1704 id="x1-83000"></a><span
    15981705class="cmbx-10">number</span><span
    15991706class="cmbx-10">_look</span><span
    1600 class="cmbx-10">_ahead:</span></span> Sets limit of look-ahead strong-branching trials
     1707class="cmbx-10">_ahead:</span></span><a
     1708 id="x1-83000doc"></a> Sets limit of look-ahead strong-branching trials
    16011709<br class="newline" />The valid range for this integer option is 0 <span
    16021710class="cmsy-10">&#x2264;</span> <span
     
    16071715class="cmmi-10">inf</span> and its
    16081716default value is 0.
     1717   <a id="sec:number_strong_branch_root"></a>
    16091718<a
    16101719 id="section*.84"></a>
    1611 <!--l. 1661--><p class="noindent" ><span class="paragraphHead"><a
    1612  id="x1-1000000.16"></a><span
     1720<!--l. 1911--><p class="noindent" ><span class="paragraphHead"><a
     1721 id="x1-84000"></a><span
    16131722class="cmbx-10">number</span><span
    16141723class="cmbx-10">_strong</span><span
    16151724class="cmbx-10">_branch</span><span
    1616 class="cmbx-10">_root:</span></span> Maximum number of variables considered for
     1725class="cmbx-10">_root:</span></span><a
     1726 id="x1-84000doc"></a> Maximum number of variables considered for
    16171727strong branching in root node.
    16181728<br class="newline" />The valid range for this integer option is 0 <span
     
    16251735class="cmmi-10">inf</span>
    16261736and its default value is 2147483647.
     1737   <a id="sec:setup_pseudo_frac"></a>
     1738
    16271739<a
    16281740 id="section*.85"></a>
    1629 <!--l. 1667--><p class="noindent" ><span class="paragraphHead"><a
    1630  id="x1-1010000.16"></a><span
     1741<!--l. 1918--><p class="noindent" ><span class="paragraphHead"><a
     1742 id="x1-85000"></a><span
    16311743class="cmbx-10">setup</span><span
    16321744class="cmbx-10">_pseudo</span><span
    1633 class="cmbx-10">_frac:</span></span> Proportion of strong branching list that has to be taken from
     1745class="cmbx-10">_frac:</span></span><a
     1746 id="x1-85000doc"></a> Proportion of strong branching list that has to be taken from
    16341747most-integer-infeasible list.
    16351748<br class="newline" />The valid range for this real option is 0 <span
     
    16411754value is 0<span
    16421755class="cmmi-10">.</span>5.
     1756   <a id="sec:trust_strong_branching_for_pseudo_cost"></a>
    16431757<a
    16441758 id="section*.86"></a>
    1645 <!--l. 1673--><p class="noindent" ><span class="paragraphHead"><a
    1646  id="x1-1020000.16"></a><span
     1759<!--l. 1925--><p class="noindent" ><span class="paragraphHead"><a
     1760 id="x1-86000"></a><span
    16471761class="cmbx-10">trust</span><span
    16481762class="cmbx-10">_strong</span><span
     
    16501764class="cmbx-10">_for</span><span
    16511765class="cmbx-10">_pseudo</span><span
    1652 class="cmbx-10">_cost:</span></span> Whether or not to trust strong
     1766class="cmbx-10">_cost:</span></span><a
     1767 id="x1-86000doc"></a> Whether or not to trust strong
    16531768branching results for updating pseudo costs.
    16541769<br class="newline" />
     
    16591774     </li>
    16601775     <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>
     1776<!--l. 1935--><p class="indent" >    </div> <div class="story"><h3><a id="sec:nlp&#x02D9;interface&#x02D9;option">nlp interface option</a></h3>   <a id="sec:file_solution"></a>
    16651777<a
    16661778 id="section*.87"></a>
    1667 <!--l. 1685--><p class="noindent" ><span class="paragraphHead"><a
    1668  id="x1-1040000.17"></a><span
     1779<!--l. 1937--><p class="noindent" ><span class="paragraphHead"><a
     1780 id="x1-87000"></a><span
    16691781class="cmbx-10">file</span><span
    1670 class="cmbx-10">_solution:</span></span> Write a file bonmin.sol with the solution
     1782class="cmbx-10">_solution:</span></span><a
     1783 id="x1-87000doc"></a> Write a file bonmin.sol with the solution
    16711784<br class="newline" />
    16721785   The default value for this string option is &#8221;no&#8221;.
     
    16741787     <ul class="itemize1">
    16751788     <li class="itemize">yes:
    1676 
    16771789     </li>
    16781790     <li class="itemize">no:</li></ul>
     1791<!--l. 1947--><p class="indent" >   <a id="sec:nlp_log_level"></a>
    16791792<a
    16801793 id="section*.88"></a>
    1681 <!--l. 1695--><p class="noindent" ><span class="paragraphHead"><a
    1682  id="x1-1050000.17"></a><span
     1794<!--l. 1948--><p class="noindent" ><span class="paragraphHead"><a
     1795 id="x1-88000"></a><span
    16831796class="cmbx-10">nlp</span><span
    16841797class="cmbx-10">_log</span><span
    1685 class="cmbx-10">_level:</span></span> specify NLP solver interface log level (independent from ipopt
     1798class="cmbx-10">_level:</span></span><a
     1799 id="x1-88000doc"></a> specify NLP solver interface log level (independent from ipopt
    16861800print_level).
    16871801<br class="newline" />Set the level of output of the OsiTMINLPInterface : 0 - none, 1 - normal, 2 - verbose
     
    16931807class="cmsy-10">&#x2264; </span>2 and its default value
    16941808is 1.
     1809   <a id="sec:nlp_solver"></a>
     1810
    16951811<a
    16961812 id="section*.89"></a>
    1697 <!--l. 1702--><p class="noindent" ><span class="paragraphHead"><a
    1698  id="x1-1060000.17"></a><span
     1813<!--l. 1956--><p class="noindent" ><span class="paragraphHead"><a
     1814 id="x1-89000"></a><span
    16991815class="cmbx-10">nlp</span><span
    1700 class="cmbx-10">_solver:</span></span> Choice of the solver for local optima of continuous nlp&#8217;s
     1816class="cmbx-10">_solver:</span></span><a
     1817 id="x1-89000doc"></a> Choice of the solver for local optima of continuous nlp&#8217;s
    17011818<br class="newline" />Note that option will work only if the specified solver has been installed. Ipopt
    17021819will usualy be installed with Bonmin by default. For FilterSQP please see
     
    17121829     </li>
    17131830     <li class="itemize">all: run all available solvers at each node</li></ul>
     1831<!--l. 1978--><p class="indent" >   <a id="sec:warm_start"></a>
    17141832<a
    17151833 id="section*.90"></a>
    1716 <!--l. 1724--><p class="noindent" ><span class="paragraphHead"><a
    1717  id="x1-1070000.17"></a><span
     1834<!--l. 1979--><p class="noindent" ><span class="paragraphHead"><a
     1835 id="x1-90000"></a><span
    17181836class="cmbx-10">warm</span><span
    1719 class="cmbx-10">_start:</span></span> Select the warm start method
     1837class="cmbx-10">_start:</span></span><a
     1838 id="x1-90000doc"></a> Select the warm start method
    17201839<br class="newline" />This will affect the function getWarmStart(), and as a consequence the warm
    17211840starting in the various algorithms. The default value for this string option is
  • html/options_set.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:46:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
     
    1818href="https://projects.coin-or.org/Ipopt" ><span
    1919class="cmtt-10">Ipopt</span></a>&#x00A0;options  </a> /   </div>
    20 <!--l. 11--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> Options </h3>      </div> <div class="story"> <h3><a name=  &#8221;sec:opt&#x02D9;opt&#8221; ></a> Passing options to <span
    21 class="cmtt-10">BONMIN </span> </h3>  Options in <span
     20<!--l. 11--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:opt">Options</a> </h3>       </div> <div class="story"><h3><a id="sec:opt&#x02D9;opt">Passing options to <span
     21class="cmtt-10">BONMIN</span></a></h3>  Options in <span
    2222class="cmtt-10">BONMIN</span>&#x00A0;can be
    2323set in several different ways.
     
    142142specifically designed for nonconvex problems.
    143143<br class="newline" />
    144 <!--l. 95--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:sub&#x02D9;solvers&#8221; ></a> Passing options to local search based heuristics and oa
    145 generators  </h3>   <a
     144<!--l. 95--><p class="indent" >    </div> <div class="story"><h3><a id="sec:sub&#x02D9;solvers">Passing options to local search based heuristics and oa generators</a></h3>
     145<a
    146146 id="x1-1doc"></a>Several parts of the algorithms in <span
    147 class="cmtt-10">BONMIN</span>&#x00A0;are based on solving a
    148 simplified version of the problem with another instance of <span
    149 class="cmtt-10">BONMIN</span>: Outer
    150 Approximation Decomposition (called in <span
    151 class="cmtt-10">B-Hyb </span>at the root node) and Feasibility
    152 Pump for MINLP (called in B-Hyb or B-BB at the root node), RINS, RENS, Local
     147class="cmtt-10">BONMIN</span>&#x00A0;are based on solving a simplified
     148version of the problem with another instance of <span
     149class="cmtt-10">BONMIN</span>: Outer Approximation
     150Decomposition (called in <span
     151class="cmtt-10">B-Hyb </span>at the root node) and Feasibility Pump for
     152MINLP (called in B-Hyb or B-BB at the root node), RINS, RENS, Local
    153153Branching.
    154154<!--l. 101--><p class="indent" >   In all these cases, one can pass options to the sub-algorithm used through the
     
    238238Table <span
    239239class="cmbx-10">??</span>).
    240 <!--l. 150--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:opt&#x02D9;nonconv&#8221; ></a> Getting good solutions to nonconvex problems  </h3>   To solve a
     240<!--l. 150--><p class="indent" >    </div> <div class="story"><h3><a id="sec:opt&#x02D9;nonconv">Getting good solutions to nonconvex problems</a></h3>   To solve a
    241241problem with non-convex constraints, one should only use the branch-and-bound
    242242algorithm <span
     
    289289class="cmtt-10">_decr </span>to negative
    290290values.
    291 <!--l. 184--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:opt&#x02D9;ipopt&#8221; ></a> Notes on <span
    292 class="cmtt-10">Ipopt </span>options  </h3>   <a
    293 href="https://projects.coin-or.org/Ipopt" ><span
    294 class="cmtt-10">Ipopt</span></a>&#x00A0;has a very large number
    295 of options, to get a complete description of them, you should refer to the
    296 <a
    297 href="https://projects.coin-or.org/Ipopt" ><span
    298 class="cmtt-10">Ipopt</span></a>&#x00A0;manual. Here we only mention and explain some of the options that have been
    299 more important to us, so far, in developing and using <span
     291<!--l. 184--><p class="indent" >    </div> <div class="story"><h3><a id="sec:opt&#x02D9;ipopt">Notes on <span
     292class="cmtt-10">Ipopt </span>options</a></h3>   <a
     293href="https://projects.coin-or.org/Ipopt" ><span
     294class="cmtt-10">Ipopt</span></a>&#x00A0;has a very large number of options,
     295to get a complete description of them, you should refer to the <a
     296href="https://projects.coin-or.org/Ipopt" ><span
     297class="cmtt-10">Ipopt</span></a>&#x00A0;manual. Here
     298we only mention and explain some of the options that have been more important to
     299us, so far, in developing and using <span
    300300class="cmtt-10">BONMIN</span>.
    301301   <a
  • html/use.html

    r1588 r1589  
    88<!-- html -->
    99<meta name="src" content="tmp.tex">
    10 <meta name="date" content="2010-01-23 16:52:00">
     10<meta name="date" content="2010-01-24 00:46:00">
    1111<link rel="stylesheet" type="text/css" href="bonmin.css">
    1212</head><body
     
    2222Mathematical Programming, Second Edition, Duxbury Press Brooks Cole
    2323Publishing Co., 2003. R.&#x00A0;Fourer and D.M.&#x00A0;Gay and B.W.&#x00A0;Kernighan.</a>  </p> </div>     </div> </div>
    24 <!--l. 18--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> Running <span
    25 class="cmtt-10">BONMIN </span></h3> <span
     24<!--l. 18--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:run">Running <span
     25class="cmtt-10">BONMIN</span></a> </h3> <span
    2626class="cmtt-10">BONMIN</span>&#x00A0;can be run
    2727     <ul class="itemize1">
     
    4444<!--l. 30--><p class="indent" >   In this page, we give some details about the various ways to run <span
    4545class="cmtt-10">BONMIN</span>.
    46 <!--l. 33--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:run&#x02D9;nl&#8221; ></a> On a <span
    47 class="cmtt-10">.nl </span>file  </h3>   <span
     46<!--l. 33--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;nl">On a <span
     47class="cmtt-10">.nl </span>file</a></h3>   <span
    4848class="cmtt-10">BONMIN</span>&#x00A0;can read a <span
    49 class="cmtt-10">.nl </span>file which could be
    50 generated by <span
     49class="cmtt-10">.nl </span>file which could be generated by
     50<span
    5151class="cmtt-10">Ampl </span>(for example <span
    5252class="cmtt-10">mytoy.nl </span>in the <span
    53 class="cmtt-10">Bonmin-dist/Bonmin/test</span>
    54 subdirectory). The command line takes just one argument which is the name of the
    55 <span
    56 class="cmtt-10">.nl </span>file to be processed.
     53class="cmtt-10">Bonmin-dist/Bonmin/test </span>subdirectory). The
     54command line takes just one argument which is the name of the <span
     55class="cmtt-10">.nl </span>file to be
     56processed.
    5757<!--l. 40--><p class="indent" >   For example, if you want to solve <span
    5858class="cmtt-10">mytoy.nl</span>, from the <span
     
    6969</td></tr></table>
    7070<!--l. 48--><p class="nopar" > </div>
    71 <!--l. 51--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:run&#x02D9;ampl&#8221; ></a> From <span
    72 class="cmtt-10">Ampl </span> </h3>  To use <span
     71<!--l. 51--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;ampl">From <span
     72class="cmtt-10">Ampl</span></a></h3>  To use <span
    7373class="cmtt-10">BONMIN</span>&#x00A0;from <span
    74 class="cmtt-10">Ampl </span>you just need to have
    75 the directory where the <span
     74class="cmtt-10">Ampl </span>you just need to have the
     75directory where the <span
    7676class="cmtt-10">bonmin </span>executable is in your <span
    7777class="cmtt-10">$PATH </span>and to issue the
     
    9999available in Cygwin).
    100100<br class="newline" />
    101 <!--l. 71--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;A&#8221; ></a> Example <span
    102 class="cmtt-10">Ampl </span>model  </h3>   simple <span
     101<!--l. 71--><p class="indent" >    </div> <div class="story"><h3><a id="A">Example <span
     102class="cmtt-10">Ampl </span>model</a></h3>   simple <span
    103103class="cmtt-10">Ampl </span>example model follows:
    104104<!--l. 73--><p class="indent" >   <div id="verbatim">
     
    136136of the <span
    137137class="cmtt-10">BONMIN</span>&#x00A0;package.)
    138 <!--l. 104--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sub&#x02D9;sec:prio&#8221; ></a> Setting up branching priorities, directions and declaring SOS1
    139 constraints in ampl  </h3>   Branching priorities, branching directions and pseudo-costs can
     138<!--l. 104--><p class="indent" >    </div> <div class="story"><h3><a id="sub&#x02D9;sec:prio">Setting up branching priorities, directions and declaring SOS1
     139constraints in ampl</a></h3>   Branching priorities, branching directions and pseudo-costs can
    140140be passed using <span
    141141class="cmtt-10">Ampl </span>suffixes. The suffix for branching priorities is <span
     
    232232</td></tr></table>
    233233<!--l. 173--><p class="nopar" > </div>
    234 <!--l. 176--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:run&#x02D9;gams&#8221; ></a> From <span
    235 class="cmtt-10">Gams </span> </h3>  Thanks to the <a
    236 href="http://projects.coin-or.org/GAMSlinks" >GAMSlinks</a> project, Bonmin is
    237 available in <span
     234<!--l. 176--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;gams">From <span
     235class="cmtt-10">Gams</span></a></h3>  Thanks to the <a
     236href="http://projects.coin-or.org/GAMSlinks" >GAMSlinks</a> project, Bonmin is available
     237in <span
    238238class="cmtt-10">Gams </span>since release 22.5 of the <a
    239239href="http://www.gams.com/" ><span
    240 class="cmtt-10">GAMS</span></a> modeling system. The system is
    241 available for <a
    242 href="http://download.gams-software.com/" >download from GAMS</a>. Without buying a license it works as a demo
    243 with limited capabilities. Documentation for using <span
     240class="cmtt-10">GAMS</span></a> modeling system. The system is available for
     241<a
     242href="http://download.gams-software.com/" >download from GAMS</a>. Without buying a license it works as a demo with
     243limited capabilities. Documentation for using <span
    244244class="cmtt-10">BONMIN</span>&#x00A0;in <span
    245245class="cmtt-10">GAMS </span>is available
    246246<a
    247247href="http://www.gams.com/solvers/coin.pdf" >here</a>.
    248 <!--l. 187--><p class="indent" >    </div> <div class="story"> <h3><a name=  &#8221;sec:run&#x02D9;cpp&#8221; ></a> From a C/C++ program  </h3>   <span
     248<!--l. 187--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;cpp">From a C/C++ program</a></h3>   <span
    249249class="cmtt-10">BONMIN</span>&#x00A0;can also be run from within a
    250250C/C++ program if the user codes the functions to compute first- and second-order
Note: See TracChangeset for help on using the changeset viewer.