Changeset 1993


Ignore:
Timestamp:
Jun 4, 2012 8:32:06 AM (7 years ago)
Author:
pbonami
Message:

Updates html doc

Location:
html
Files:
7 edited

Legend:

Unmodified
Added
Removed
  • html/Install.html

    r1955 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 14:39:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
    1613>
    17 <!--l. 1--><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"> Installation  </h2>  <a href="#sec:install " > Installing <span
     14<!--l. 1--><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"> Installation  </h2>  <a href="#sec:install " > Installing <span
    1815class="cmtt-10">BONMIN </span> </a> /
    1916<a href="#sec:cplex&#x02D9;install " > Configuring <span
     
    2118class="cmtt-10">BONMIN</span>&#x00A0;in a external
    2219directory  </a> / <a href="#sec:ref&#x02D9;man " > Building documentation  </a> / <a href="#sec:test " > Running test program  </a> /   </div>
    23 <!--l. 10--><p class="noindent" > <div id="rightPanel"> <div id="headlines"> <h4>References </h4>    <div id="refer"> <p>  1 <a
     20<!--l. 10--><p class="noindent"> <div id="rightPanel"> <div id="headlines"> <h4>References </h4>    <div id="refer"> <p>  1 <a
    2421href="https://projects.coin-or.org/BuildTools" >Generic Coin Installation on Coin BuildTools web page</a>  </p> </div>       <div id="refer"> <p>  2 <a
    2522href="https://projects.coin-or.org/BuildTools" >Known issues for
     
    4542     </li>
    4643     <li class="itemize">Mac OS X using gcc 4.5</li></ul>
    47 <!--l. 27--><p class="noindent" >For Cygwin and OS X some specific setup has to be done prior to instalation.
     44<!--l. 27--><p class="noindent">For Cygwin and OS X some specific setup has to be done prior to instalation.
    4845These step are described on the wiki pages of <span
    4946class="cmtt-10">Bonmin </span><a
     
    5148<a
    5249href="https://projects.coin-or.org/Bonmin/wiki/OsxInstall" >OsxInstall</a>.
    53 <!--l. 30--><p class="indent" >   <span
     50<!--l. 30--><p class="indent">   <span
    5451class="cmtt-10">BONMIN</span>&#x00A0;is compiled and installed using the commands: <div id="verbatim">
    5552
    56 <a
    57  id="page.2"></a>
    58    <div class="verbatim" id="verbatim-1">
     53   <table
     54class="verbatim"><tr class="verbatim"><td
     55class="verbatim"><div class="verbatim">
    5956&#x00A0;<br />./configure&#x00A0;-C
    6057&#x00A0;<br />make
     
    6259&#x00A0;<br />
    6360</div>
    64 <!--l. 38--><p class="nopar" > </div>
    65 <!--l. 41--><p class="indent" >   This installs the executable <span
     61</td></tr></table>
     62<!--l. 38--><p class="nopar"> </div>
     63<!--l. 41--><p class="indent">   This installs the executable <span
    6664class="cmtt-10">bonmin </span>in <span
    67 class="cmtt-10">Bonmin-1.5/bin</span>. In what follows, we
     65class="cmtt-10">Bonmin-1.6/bin</span>. In what follows, we
    6866assume that you have put the executable <span
    6967class="cmtt-10">bonmin </span>on your path.
    70 <!--l. 44--><p class="indent" >   The <span
     68<!--l. 44--><p class="indent">   The <span
    7169class="cmtt-10">configure </span>script attempts to find all of the machine specific settings
    7270(compiler, libraries,...) necessary to compile and run the code. Although <span
     
    7573settings. The options for the configure script can be found by issuing the
    7674command
    77 <!--l. 49--><p class="indent" >   <div id="verbatim">
    78 
    79 <a
    80  id="page.3"></a>
    81    <div class="verbatim" id="verbatim-2">
     75<!--l. 49--><p class="indent">   <div id="verbatim">
     76
     77   <table
     78class="verbatim"><tr class="verbatim"><td
     79class="verbatim"><div class="verbatim">
    8280&#x00A0;<br />./configure&#x00A0;--help
    8381&#x00A0;<br />
    8482</div>
    85 <!--l. 54--><p class="nopar" > </div>
    86 <!--l. 57--><p class="indent" >   For a more in depth description of these options, the reader is invited to refer to
     83</td></tr></table>
     84<!--l. 54--><p class="nopar"> </div>
     85<!--l. 57--><p class="indent">   For a more in depth description of these options, the reader is invited to refer to
    8786the COIN-OR <span
    8887class="cmtt-10">BuildTools </span><a
    8988href="https://projects.coin-or.org/BuildTools" >trac page</a>.
    90 <!--l. 60--><p class="indent" >    </div> <div class="story"><h3><a id="sec:cplex&#x02D9;install">Specifying the location of <span
     89<!--l. 60--><p class="indent">    </div> <div class="story"><h3><a id="sec:cplex&#x02D9;install">Specifying the location of <span
    9190class="cmtt-10">Cplex </span>libraries</a></h3>   If you have <span
    9291class="cmtt-10">Cplex</span>
     
    9998header files directory by passing it as an argument to the configure script or by
    10099writing it into a <span
    101 class="cmtt-10">config.site</span>.<br
    102 class="newline" />
    103 <!--l. 68--><p class="indent" >   In the former case, specify the location of the <span
     100class="cmtt-10">config.site</span>.
     101<br class="newline" />
     102<!--l. 68--><p class="indent">   In the former case, specify the location of the <span
    104103class="cmtt-10">Cplex </span>header files by using the
    105104argument <span
     
    109108class="cmtt-10">--with-cplexlib </span>(note that on the Linux platform you will also need to add
    110109<span
    111 class="cmtt-10">-lpthread </span>as an argument to <span
    112 class="cmtt-10">--with-cplexlib</span>).<br
    113 class="newline" />
    114 <!--l. 73--><p class="indent" >   For example, on a Linux machine if <span
     110class="cmtt-10">-lpthread -lm </span>as an argument to <span
     111class="cmtt-10">--with-cplexlib</span>).
     112<br class="newline" />
     113<!--l. 73--><p class="indent">   For example, on a Linux machine if <span
    115114class="cmtt-10">Cplex </span>is installed in <span
    116115class="cmtt-10">/usr/ilog</span>&#x00A0;, you would
    117116invoke configure with the arguments as follows:
    118 <!--l. 76--><p class="indent" >   <div id="verbatim">
    119 
    120 <a
    121  id="page.4"></a>
    122    <div class="verbatim" id="verbatim-3">
     117<!--l. 76--><p class="indent">   <div id="verbatim">
     118
     119   <table
     120class="verbatim"><tr class="verbatim"><td
     121class="verbatim"><div class="verbatim">
    123122&#x00A0;<br />./configure&#x00A0;--with-cplex-incdir=/usr/ilog/cplex/include/ilcplex&#x00A0;\
    124 &#x00A0;<br />&#x00A0;&#x00A0;--with-cplex-lib="-L/usr/ilog/cplex/lib&#x00A0;&#x00A0;-lcplex&#x00A0;-lpthread"
     123&#x00A0;<br />&#x00A0;&#x00A0;--with-cplex-lib="-L/usr/ilog/cplex/lib&#x00A0;-lcplex&#x00A0;-lpthread&#x00A0;-lm"
    125124&#x00A0;<br />&#x00A0;
    126125</div>
    127 <!--l. 81--><p class="nopar" > </div>
    128 <!--l. 84--><p class="indent" >   In the latter case, put a file called <span
     126</td></tr></table>
     127<!--l. 81--><p class="nopar"> </div>
     128<!--l. 84--><p class="indent">   In the latter case, put a file called <span
    129129class="cmtt-10">config.site </span>in a subdirectory named <span
    130130class="cmtt-10">share </span>of
     
    138138class="cmtt-10">Cplex</span>&#x00A0;, insert the following lines in the <span
    139139class="cmtt-10">config.site </span>file:
    140 <!--l. 91--><p class="indent" >   <div id="verbatim">
    141 
    142 <a
    143  id="page.5"></a>
    144    <div class="verbatim" id="verbatim-4">
    145 &#x00A0;<br />&#x00A0;with_cplex_lib="-L/usr/ilog/cplex/lib&#x00A0;-lcplex&#x00A0;-lpthread"
     140<!--l. 91--><p class="indent">   <div id="verbatim">
     141
     142   <table
     143class="verbatim"><tr class="verbatim"><td
     144class="verbatim"><div class="verbatim">
     145&#x00A0;<br />&#x00A0;with_cplex_lib="-L/usr/ilog/cplex/lib/&#x00A0;-lcplex&#x00A0;-lpthread&#x00A0;-lm"
    146146&#x00A0;<br />&#x00A0;with_cplex_incdir="/usr/ilog/cplex/include/ilcplex"
    147147&#x00A0;<br />
    148148&#x00A0;<br />&#x00A0;
    149149</div>
    150 <!--l. 97--><p class="nopar" > </div>
    151 <!--l. 100--><p class="indent" >   (You will find a <span
     150</td></tr></table>
     151<!--l. 97--><p class="nopar"> </div>
     152<!--l. 100--><p class="indent">   (You will find a <span
    152153class="cmtt-10">config.site </span>example in the subdirectory <span
    153154class="cmtt-10">BuildTools </span>of
    154155<span
    155156class="cmtt-10">coin-Bonmin</span>.)
    156 <!--l. 102--><p class="indent" >    </div> <div class="story"><h3><a id="sec:vpath">Compiling <span
     157<!--l. 102--><p class="indent">    </div> <div class="story"><h3><a id="sec:vpath">Compiling <span
    157158class="cmtt-10">BONMIN</span>&#x00A0;in a external directory</a></h3>   It is recommended to
    158159compile <span
    159160class="cmtt-10">BONMIN</span>&#x00A0;in a directory different from the source directory (<span
    160 class="cmtt-10">Bonmin-1.5 </span>in our
     161class="cmtt-10">Bonmin-1.6 </span>in our
    161162case). This is convenient if you want to have several executables compiled for
    162163different architectures or have several executables compiled with different options
    163164(debugging and production, shared and static libraries) but also because you don&#8217;t
    164 modify the directory where the sources are.<br
    165 class="newline" />
    166 <!--l. 108--><p class="indent" >   To do this just create a new directory, for example <span
     165modify the directory where the sources are.
     166<br class="newline" />
     167<!--l. 108--><p class="indent">   To do this just create a new directory, for example <span
    167168class="cmtt-10">Bonmin-build </span>in
    168169the parent directory of <span
     
    170171<span
    171172class="cmtt-10">Bonmin-build</span>:
    172 <!--l. 112--><p class="indent" >   <div id="verbatim">
    173 
    174 <a
    175  id="page.6"></a>
    176    <div class="verbatim" id="verbatim-5">
     173<!--l. 112--><p class="indent">   <div id="verbatim">
     174
     175   <table
     176class="verbatim"><tr class="verbatim"><td
     177class="verbatim"><div class="verbatim">
    177178&#x00A0;<br />../Bonmin-\stableVersion/configure&#x00A0;-C
    178179&#x00A0;<br />
    179180</div>
    180 <!--l. 117--><p class="nopar" > </div>
    181 <!--l. 120--><p class="indent" >   This will create the makefiles in <span
     181</td></tr></table>
     182<!--l. 117--><p class="nopar"> </div>
     183<!--l. 120--><p class="indent">   This will create the makefiles in <span
    182184class="cmtt-10">Bonmin-build</span>, and you can then compile with
    183185the usual <span
     
    185187class="cmtt-10">make install </span>(in <span
    186188class="cmtt-10">Bonmin-build</span>).
    187 <!--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
     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
    188190class="cmtt-10">BONMIN</span>&#x00A0;consists
    189191of a users&#8217; manual (this document) and a reference manual. You can build a local
     
    195197then be accessed in <span
    196198class="cmtt-10">doc/html/index.html</span>.
    197 <!--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
     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
    198200class="cmtt-10">make test</span>&#x00A0;, you
    199201build and run the automatic test program for <span
  • html/Intro.html

    r1947 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 11:54:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
    1613>
    17 <!--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
     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
    1815solved  </a> / <a href="#Algos " > Algorithms  </a> / <a href="#ThirdP " > Required third party code  </a> / <a href="#Support " >
    1916Supported platforms  </a> /   </div>
    20 <!--l. 26--><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
    2118href="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
    2219href="http://hal.archives-ouvertes.fr/hal-00423416/en/" >Algorithms
     
    3330branched and bound algorithm for convex MINLP optimization problems. I.
    3431Quesada and I.E. Grossmann. Computers and Chemical Engineering.</a>  </p> </div>    </div> </div>
    35 <!--l. 28--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:Intro"><span
     32<!--l. 28--><p class="noindent"> </div> <div id="content"> <div class="feature"> <h3> <a id="sec:Intro"><span
    3633class="cmtt-10">BONMIN</span></a> </h3>  <span
    3734class="cmtt-10">BONMIN</span>&#x00A0;(Basic Open-source Nonlinear Mixed INteger
     
    4441class="cmtt-10">BONMIN</span>&#x00A0;is OSI Certified Open Source
    4542Software.
    46 <!--l. 42--><p class="indent" >   There are several algorithmic choices that can be selected with <span
     43<!--l. 42--><p class="indent">   There are several algorithmic choices that can be selected with <span
    4744class="cmtt-10">BONMIN</span>. <span
    4845class="cmtt-10">B-BB </span>is a
     
    5956class="cmtt-10">B-QG </span>based on adding additional ECP
    6057cuts.
    61 <!--l. 53--><p class="indent" >   Some of the algorithmic choices require the ability to solve MILP (Mixed Integer
     58<!--l. 53--><p class="indent">   Some of the algorithmic choices require the ability to solve MILP (Mixed Integer
    6259Linear Programming) problems and NLP (NonLinear Programming) problems. The
    6360default solvers for these are, respectively, the COIN-OR codes <a
     
    7774class="cmtt-10">Cplex</span></a>&#x00A0;as
    7875the MILP solver and FilterSQP as the NLP solver.
    79 <!--l. 63--><p class="indent" >   Additional documentation can be found on the <span
     76<!--l. 63--><p class="indent">   Additional documentation can be found on the <span
    8077class="cmtt-10">Bonmin</span>
    81 <!--l. 76--><p class="indent" >   <a
     78<!--l. 76--><p class="indent">   <a
    8279href="http://www.coin-or.org/Bonmin" >homepage</a> and <a
    8380href="https://projects.coin-or.org/Bonmin" >wiki</a>.
    84 <!--l. 78--><p class="indent" >    </div> <div class="story"><h3><a id="MathBack">Types of problems solved</a></h3>   <span
     81<!--l. 78--><p class="indent">    </div> <div class="story"><h3><a id="MathBack">Types of problems solved</a></h3>   <span
    8582class="cmtt-10">BONMIN</span>&#x00A0;solves MINLPs of the form
    86 <!--l. 82--><p class="indent" >
    87 
    88 <a
    89  id="page.2"></a>
     83<!--l. 82--><p class="indent">
     84
    9085<table
    9186class="align-star">
     
    9489class="align-even">min<span
    9590class="cmmi-10">f</span>(<span
    96 class="cmmi-10">x</span>)</td>                                  <td
     91class="cmmi-10">x</span>)</td>                                   <td
    9792class="align-label"></td>                        <td
    9893class="align-label">
     
    10095class="align-odd"></td>                        <td
    10196class="align-even"><span
    102 class="cmmi-10">s.t.</span></td>                                       <td
     97class="cmmi-10">s.t.</span></td>                                        <td
    10398class="align-label"></td>                        <td
    10499class="align-label">
     
    114109class="cmmi-10">g</span><sup><span
    115110class="cmmi-7">U</span></sup><span
    116 class="cmmi-10">,</span></td>                            <td
     111class="cmmi-10">,</span></td>                             <td
    117112class="align-label"></td>                        <td
    118113class="align-label">
     
    134129class="align-even"><span
    135130class="cmmi-10">x </span><span
    136 class="cmsy-10">&#x2208; </span><span
    137 class="msbm-10">&#x211D;</span><sup><span
     131class="cmsy-10"><img
     132src="cmsy10-32.png" alt="&#x2208;" class="10x-x-32" /> </span><span
     133class="msbm-10"><img
     134src="msbm10-52.png" alt="&#x211D;" class="10x-x-52" /></span><sup><span
    138135class="cmmi-7">n</span></sup><span
    139 class="cmmi-10">,</span><span style="margin-left:2.77695pt" class="tmspace"></span><span
    140 class="cmmi-10">x</span><sub>
     136class="cmmi-10">, x</span><sub>
    141137<span
    142138class="cmmi-7">i</span></sub> <span
    143 class="cmsy-10">&#x2208; </span><span
    144 class="msbm-10">&#x2124;</span><span style="margin-left:2.77695pt" class="tmspace"></span><span
     139class="cmsy-10"><img
     140src="cmsy10-32.png" alt="&#x2208;" class="10x-x-32" /> </span><span
     141class="msbm-10">&#x2124; </span><span
    145142class="cmsy-10">&#x2200;</span><span
    146143class="cmmi-10">i </span><span
    147 class="cmsy-10">&#x2208; </span><span
     144class="cmsy-10"><img
     145src="cmsy10-32.png" alt="&#x2208;" class="10x-x-32" /> </span><span
    148146class="cmmi-10">I,</span></td>                        <td
    149147class="align-label"></td>                        <td
     
    154152class="cmsy-10">{</span><span
    155153class="cmmi-10">x </span><span
    156 class="cmsy-10">&#x2208; </span><span
    157 class="msbm-10">&#x211D;</span><sup><span
     154class="cmsy-10"><img
     155src="cmsy10-32.png" alt="&#x2208;" class="10x-x-32" /> </span><span
     156class="msbm-10"><img
     157src="msbm10-52.png" alt="&#x211D;" class="10x-x-52" /></span><sup><span
    158158class="cmmi-7">n</span></sup> : <span
    159159class="cmmi-10">x</span><sup><span
     
    168168class="cmsy-10">&#x2192;</span> <span
    169169class="cmmi-10">&#x00A0;</span><span
    170 class="msbm-10">&#x211D; </span>and
     170class="msbm-10"><img
     171src="msbm10-52.png" alt="&#x211D;" class="10x-x-52" /> </span>and
    171172<span
    172173class="cmmi-10">g </span>: <span
     
    174175class="cmsy-10">{</span><span
    175176class="cmmi-10">x </span><span
    176 class="cmsy-10">&#x2208; </span><span
    177 class="msbm-10">&#x211D;</span><sup><span
     177class="cmsy-10"><img
     178src="cmsy10-32.png" alt="&#x2208;" class="10x-x-32" /> </span><span
     179class="msbm-10"><img
     180src="msbm10-52.png" alt="&#x211D;" class="10x-x-52" /></span><sup><span
    178181class="cmmi-7">n</span></sup> : <span
    179182class="cmmi-10">x</span><sup><span
     
    188191class="cmsy-10">&#x2192;</span> <span
    189192class="cmmi-10">&#x00A0;</span><span
    190 class="msbm-10">&#x211D;</span><sup><span
     193class="msbm-10"><img
     194src="msbm10-52.png" alt="&#x211D;" class="10x-x-52" /></span><sup><span
    191195class="cmmi-7">m</span></sup> are assumed to be twice continuously
    192196differentiable, and <span
     
    200204cast in <span
    201205class="cmti-10">minimization </span>form.
    202 <!--l. 99--><p class="indent" >   The different methods that <span
     206<!--l. 99--><p class="indent">   The different methods that <span
    203207class="cmtt-10">BONMIN</span>&#x00A0;implements are exact algorithms when the
    204208functions <span
     
    207211<span
    208212class="cmtt-10">BONMIN</span>&#x00A0;is not a <span
    209 class="cmti-10">global </span>optimizer).<br
    210 class="newline" />
    211 <!--l. 102--><p class="indent" >    </div> <div class="story"><h3><a id="Algos">Algorithms</a></h3>   <span
     213class="cmti-10">global </span>optimizer).
     214<br class="newline" />
     215<!--l. 102--><p class="indent">    </div> <div class="story"><h3><a id="Algos">Algorithms</a></h3>   <span
    212216class="cmtt-10">BONMIN</span>&#x00A0;implements six different algorithms for solving
    213217MINLPs:
     
    241245href="http://wiki.mcs.anl.gov/leyffer/index.php/Sven_Leyffer's_Publications" >[Abhishek Leyffer Linderoth 2006]</a>
    242246
    243 <a
    244  id="page.3"></a>
    245247     </li>
    246248     <li class="itemize"><span
     
    248250href="http://dx.doi.org/10.1007/s10107-008-0212-2" >[Bonami Cornu&eacute;jols Lodi
    249251     Margot 2009]</a>  .</li></ul>
    250 <!--l. 125--><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.
    251253Mathematical details of these algorithms and some details of their implementations
    252254can be found in  <a
     
    256258src="cmr10-10.png" alt="i" class="10x-x-10" />c Linderoth 2009]</a>
    257259.
    258 <!--l. 129--><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
    259261want to know which one of these six algorithms you should choose to solve your
    260262particular problem. For convex MINLPs, experiments we have made on a reasonably
     
    284286<span
    285287class="cmtt-10">BONMIN</span>.
    286 <!--l. 142--><p class="indent" >    </div> <div class="story"><h3><a id="ThirdP">Required third party code</a></h3>   In order to run <span
     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
    287289class="cmtt-10">BONMIN</span>, you have to download
    288290other external libraries (and pay attention to their licenses!):
     
    297299href="http://www.cse.clrc.ac.uk/nag/hsl/contents.shtml" >HSL</a>
    298300     (Harwell Subroutine Library), MUMPS, or Pardiso.</li></ul>
    299 <!--l. 155--><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
    300302href="http://www.netlib.org" >Netlib
    301303Repository</a>, but they are not OSI Certified Open Source Software. The linear solver
    302304MA27 is freely available for noncommercial use.
    303 <!--l. 160--><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
    304306class="cmtt-10">BONMIN</span>&#x00A0;as a stand-alone C++ code, but it
    305307does not provide a modeling language. For functionality from a modeling language,
     
    312314class="cmtt-10">ASL </span>(Ampl Solver
    313315Library) which is obtainable from the Netlib.
    314 <!--l. 167--><p class="indent" >   <span
     316<!--l. 167--><p class="indent">   <span
    315317class="cmtt-10">BONMIN</span>&#x00A0;can use FilterSQP  <a
    316318href="http://www.mcs.anl.gov/~leyffer/solvers.html" >[FletcherLeyffer1998]</a>   as an alternative to <a
     
    318320class="cmtt-10">Ipopt</span></a>&#x00A0;for
    319321solving NLPs.
    320 <!--l. 169--><p class="indent" >   Also, in the outer approximation methods <span
     322<!--l. 169--><p class="indent">   Also, in the outer approximation methods <span
    321323class="cmtt-10">B-OA </span>and <span
    322324class="cmtt-10">B-iFP</span>, some MILP problems
    323325
    324 <a
    325  id="page.4"></a>
    326326are solved. By default <span
    327327class="cmtt-10">BONMIN</span>&#x00A0;uses <a
     
    332332href="http://www.ilog.com/products/cplex/product/mip.cfm" ><span
    333333class="cmtt-10">Cplex</span></a></a>.
    334 <!--l. 173--><p class="indent" >    </div> <div class="story"><h3><a id="Support">Tested platforms</a></h3>   <span
     334<!--l. 173--><p class="indent">    </div> <div class="story"><h3><a id="Support">Tested platforms</a></h3>   <span
    335335class="cmtt-10">BONMIN</span>&#x00A0;has been installed on the following
    336336systems:
  • html/Obtain.html

    r1947 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 11:55:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
    1613>
    17 <!--l. 1--><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"> Downloading <span
     14<!--l. 1--><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"> Downloading <span
    1815class="cmtt-10">BONMIN </span> </h2> <a href="#sec:obtain " >
    1916Obtaining <span
    2017class="cmtt-10">BONMIN </span> </a> / <a href="#sec:obtain&#x02D9;3rd " > Obtaining required third party code  </a> /   </div>
    21 <!--l. 7--><p class="noindent" > <div id="rightPanel"> <div id="headlines"> <h4>References </h4>     <div id="refer"> <p>  1 <a
     18<!--l. 7--><p class="noindent"> <div id="rightPanel"> <div id="headlines"> <h4>References </h4>     <div id="refer"> <p>  1 <a
    2219href="https://projects.coin-or.org/Bonmin" >Bonmin Wiki Pages</a>  </p> </div>       <div id="refer"> <p>  2 <a
    2320href="http://subversion.tigris.org/" >subversion web page</a>  </p> </div>       <div id="refer"> <p>  3 <a
     
    3027href="http://mumps.enseeiht.fr/" >Mumps</a>  </p> </div>       <div id="refer"> <p>  8 <a
    3128href="http://www.ampl.com" >Ampl Solver Library</a>  </p> </div>     </div> </div>
    32 <!--l. 18--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:obtain">Obtaining <span
     29<!--l. 18--><p class="noindent"> </div> <div id="content"> <div class="feature"> <h3> <a id="sec:obtain">Obtaining <span
    3330class="cmtt-10">BONMIN</span></a> </h3>
    34 <!--l. 22--><p class="indent" >   The <span
     31<!--l. 22--><p class="indent">   The <span
    3532class="cmtt-10">BONMIN</span>&#x00A0;package consists of the source code for the <span
    3633class="cmtt-10">BONMIN</span>&#x00A0;project but also
     
    6562href="https://projects.coin-or.org/Osi" ><span
    6663class="cmtt-10">Osi</span></a></li></ul>
    67 <!--l. 34--><p class="indent" >   When downloading the <span
     64<!--l. 34--><p class="indent">   When downloading the <span
    6865class="cmtt-10">BONMIN</span>&#x00A0;package you will download the source code for all
    69 these and libraries of problems to test the codes.<br
    70 class="newline" />
    71 <!--l. 37--><p class="indent" >   Before downloading <span
     66these and libraries of problems to test the codes.
     67<br class="newline" />
     68<!--l. 37--><p class="indent">   Before downloading <span
    7269class="cmtt-10">BONMIN</span>&#x00A0;you need to know which branch of Bonmin you want
    7370to download. In particular you need to know if you want to download the latest
     
    7875     <li class="itemize">the Released branch.</li></ul>
    7976
    80 <a
    81  id="page.2"></a>
    82 <!--l. 43--><p class="noindent" >These different version are made according to the guidelines of COIN-OR. The
     77<!--l. 43--><p class="noindent">These different version are made according to the guidelines of COIN-OR. The
    8378interpretation of these guidelines for the Bonmin project is explained on the wiki
    8479pages of Bonmin.
    85 <!--l. 45--><p class="indent" >   The main distinction between the Stable and Release branch is that a stable
     80<!--l. 45--><p class="indent">   The main distinction between the Stable and Release branch is that a stable
    8681version that we propose to download may evolve over time to include bug fixes while
    8782a released version will never change. The released versions present an advantage in
     
    8984the stable version presents the advantage that it is less work for you to update in the
    9085event where we fix a bug.
    91 <!--l. 47--><p class="indent" >   The easiest way to obtain the released version is by downloading a compressed
     86<!--l. 47--><p class="indent">   The easiest way to obtain the released version is by downloading a compressed
    9287archive from <a
    93 href="http://www.coin-or.org/Tarballs/Bonmin/" >Bonmin archive directory</a>. The latest release is Bonmin-1.5.2.
    94 <!--l. 49--><p class="indent" >   The only way to obain one of the stable versions is through <a
     88href="http://www.coin-or.org/Tarballs/Bonmin/" >Bonmin archive directory</a>. The latest release is Bonmin-1.6.0.
     89<!--l. 49--><p class="indent">   The only way to obain one of the stable versions is through <a
    9590href="http://subversion.tigris.org/" >subversion</a>.
    96 <!--l. 51--><p class="indent" >   In Unix<a
     91<!--l. 51--><p class="indent">   In Unix<a
    9792href="#Hfootnote.1" ><span class="footnote-mark"><a
    9893href="tmp2.html#fn1x0"><sup class="textsuperscript">1</sup></a></span></a><a
    9994 id="x1-2f1"></a>-like
    100 environments, to download the latest stable version of Bonmin (1.5)
     95environments, to download the latest stable version of Bonmin (1.6)
    10196in a sub-directory, say <span
    102 class="cmtt-10">Bonmin-1.5 </span>issue the following command
    103 <!--l. 57--><p class="indent" >   <div id="verbatim"> <span
    104 class="cmtt-10">svn co https://projects.coin-or.org/svn/Bonmin/stable/1.5</span><span
    105 class="cmtt-10">&#x00A0;Bonmin-1.5 </span></div>
    106 <!--l. 62--><p class="noindent" >This copies all the necessary COIN-OR files to compile <span
     97class="cmtt-10">Bonmin-1.6 </span>issue the following command
     98<!--l. 57--><p class="indent">   <div id="verbatim"> <span
     99class="cmtt-10">svn co https://projects.coin-or.org/svn/Bonmin/stable/1.6</span><span
     100class="cmtt-10">&#x00A0;Bonmin-1.6 </span></div>
     101<!--l. 62--><p class="noindent">This copies all the necessary COIN-OR files to compile <span
    107102class="cmtt-10">BONMIN</span>&#x00A0;to <span
    108 class="cmtt-10">Bonmin-1.5</span>. To
     103class="cmtt-10">Bonmin-1.6</span>. To
    109104download <span
    110105class="cmtt-10">BONMIN</span>&#x00A0;using svn on Windows, follow the instructions provided at
    111106<a
    112107href="http://www.coin-or.org/faqs.html#q4" >COIN-OR</a>.
    113 <!--l. 67--><p class="indent" >    </div> <div class="story"><h3><a id="sec:obtain&#x02D9;3rd">Obtaining required third party code</a></h3>   <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
    114109class="cmtt-10">BONMIN</span>&#x00A0;needs a few external
    115110packages which are not included in the <span
     
    125120class="cmtt-10">BONMIN</span>&#x00A0;from
    126121     Ampl.</li></ul>
    127 <!--l. 77--><p class="indent" >   Since these third-party software modules are released under licenses that are
     122<!--l. 77--><p class="indent">   Since these third-party software modules are released under licenses that are
    128123incompatible with the CPL, they cannot be included for distribution with
    129124<span
     
    136131machine).
    137132
    138 <a
    139  id="page.3"></a>
    140 <!--l. 86--><p class="indent" >   Linear solvers are used by Ipopt. The most up-to-date information regarding the
     133<!--l. 86--><p class="indent">   Linear solvers are used by Ipopt. The most up-to-date information regarding the
    141134supported linear solvers and how to install them is found in <a
    142135href="http://www.coin-or.org/Ipopt/documentation/node14.html" >Section 2.2</a> of the Ipopt
    143 manual.<br
    144 class="newline" />
    145 <!--l. 88--><p class="indent" >   Several options are available for linear solvers: MA27 from the Harwell Subroutine
     136manual.
     137<br class="newline" />
     138<!--l. 88--><p class="indent">   Several options are available for linear solvers: MA27 from the Harwell Subroutine
    146139Library (and optionally, but strongly recommended, MC19 to enable automatic
    147140scaling in <a
  • html/bib.html

    r1947 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 11:55:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
    1613>
    17 <!--l. 1--><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>    </div>
     14<!--l. 1--><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>    </div>
    1815<a
    1916 id="likesection.1"></a>
     
    2118 id="x1-1000"></a>References</h3>
    2219    <div class="thebibliography">
    23     <p class="bibitem" ><span class="biblabel">
     20    <p class="bibitem"><span class="biblabel">
    2421  [1]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    25  id="cite.abhishek.leyffer.linderoth:06"></a><a
     22 id="cite.abhishek.leyffer.linderoth:06"></a>
     23<a
    2624 id="Xabhishek.leyffer.linderoth:06"></a>K.&#x00A0;Abhishek,   S.&#x00A0;Leyffer,   and   J.&#x00A0;T.   Linderoth.   FilMINT:   An
    2725    outer-approximation-based solver for nonlinear mixed integer programs.
     
    2927    Division, Argonne National Laboratory, 2006.
    3028    </p>
    31     <p class="bibitem" ><span class="biblabel">
     29    <p class="bibitem"><span class="biblabel">
    3230  [2]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    33  id="cite.Betal"></a><a
     31 id="cite.Betal"></a>
     32<a
    3433 id="XBetal"></a>P.&#x00A0;Bonami,   A.&#x00A0;W&auml;chter,   L.T.&#x00A0;Biegler,   A.R.&#x00A0;Conn,   G.&#x00A0;Cornu&eacute;jols,
    3534    I.E.&#x00A0;Grossmann, C.D.&#x00A0;Laird, J.&#x00A0;Lee, A.&#x00A0;Lodi, F.&#x00A0;Margot and N.&#x00A0;Sawaya.
     
    3837class="cmti-10">Discrete Optimization </span>5:186&#8211;204, 2008.
    3938    </p>
    40     <p class="bibitem" ><span class="biblabel">
     39    <p class="bibitem"><span class="biblabel">
    4140  [3]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    42  id="cite.bonami.etal:06"></a><a
     41 id="cite.bonami.etal:06"></a>
     42<a
    4343 id="Xbonami.etal:06"></a>P.&#x00A0;Bonami, G.&#x00A0;Cornu&eacute;jols, A.&#x00A0;Lodi, and F.&#x00A0;Margot. A feasibility pump
    4444    for  mixed  integer  nonlinear  programs.  <span
     
    4646    (2009), pp.&#x00A0;331&#8211;352.
    4747    </p>
    48     <p class="bibitem" ><span class="biblabel">
     48    <p class="bibitem"><span class="biblabel">
    4949  [4]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    50  id="cite.bonami.goncalves:08"></a><a
     50 id="cite.bonami.goncalves:08"></a>
     51<a
    5152 id="Xbonami.goncalves:08"></a>P.&#x00A0;Bonami  and  J.&#x00A0;Gonçalves.  Primal  heuristics  for  mixed  integer
    5253    nonlinear programs. Research Report, IBM T. J. Watson Research Center,
    5354    Yorktown, USA, September 2008.
    5455    </p>
    55     <p class="bibitem" ><span class="biblabel">
     56    <p class="bibitem"><span class="biblabel">
    5657  [5]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    57  id="cite.hot:2009"></a><a
     58 id="cite.hot:2009"></a>
     59<a
    5860 id="Xhot:2009"></a>P.  Bonami,  M.&#x00A0;K<img
    5961src="cmr10-10.png" alt="i" class="10x-x-10" />l<img
     
    6264    Computer Sciences Department, University of Wisconsin-Madison, 2009.
    6365    </p>
    64     <p class="bibitem" ><span class="biblabel">
     66    <p class="bibitem"><span class="biblabel">
    6567  [6]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    66  id="cite.DG"></a><a
     68 id="cite.DG"></a>
     69<a
    6770 id="XDG"></a>M.&#x00A0;Duran and I.E.&#x00A0;Grossmann. An outer-approximation algorithm for
    6871    a class of mixed-integer nonlinear programs.  <span
     
    7073    36:307&#8211;339, 1986.
    7174
     75    </p>
     76    <p class="bibitem"><span class="biblabel">
     77  [7]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
     78 id="cite.Gupta80Nonlinear"></a>
    7279<a
    73  id="page.2"></a>
    74     </p>
    75     <p class="bibitem" ><span class="biblabel">
    76   [7]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    77  id="cite.Gupta80Nonlinear"></a><a
    7880 id="XGupta80Nonlinear"></a>O.K.&#x00A0;Gupta  and  V.&#x00A0;Ravindran.    Branch  and  bound  experiments
    7981    in   convex   nonlinear   integer   programming.      <span
     
    8183    31:1533&#8211;1546, 1985.
    8284    </p>
    83     <p class="bibitem" ><span class="biblabel">
     85    <p class="bibitem"><span class="biblabel">
    8486  [8]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    85  id="cite.FL"></a><a
     87 id="cite.FL"></a>
     88<a
    8689 id="XFL"></a>R.&#x00A0;Fletcher and S.&#x00A0;Leyffer. Solving mixed integer nonlinear programs
    8790    by outer approximation. <span
    8891class="cmti-10">Mathematical Programming</span>, 66:327&#8211;349, 1994.
    8992    </p>
    90     <p class="bibitem" ><span class="biblabel">
     93    <p class="bibitem"><span class="biblabel">
    9194  [9]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    92  id="cite.FiLter"></a><a
     95 id="cite.FiLter"></a>
     96<a
    9397 id="XFiLter"></a>R.&#x00A0;Fletcher and S.&#x00A0;Leyffer.  User manual for filterSQP.  <span
    9498class="cmti-10">University of</span>
     
    96100class="cmti-10">Dundee Numerical Analysis Report NA-181</span>, 1998.
    97101    </p>
    98     <p class="bibitem" ><span class="biblabel">
     102    <p class="bibitem"><span class="biblabel">
    99103 [10]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    100  id="cite.Gay"></a><a
     104 id="cite.Gay"></a>
     105<a
    101106 id="XGay"></a>D.M.&#x00A0;Gay.  Writing <span
    102107class="cmbx-10">.nl </span>files.  Sandia National Laboratories, Technical
    103108    Report No. 2005-7907P, 2005.
    104109    </p>
    105     <p class="bibitem" ><span class="biblabel">
     110    <p class="bibitem"><span class="biblabel">
    106111 [11]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    107  id="cite.QG"></a><a
     112 id="cite.QG"></a>
     113<a
    108114 id="XQG"></a>I.&#x00A0;Quesada and I.E.&#x00A0;Grossmann.   An LP/NLP based branched and
    109115    bound algorithm for convex MINLP optimization problems.  <span
     
    112118class="cmti-10">and Chemical Engineering</span>, 16:937&#8211;947, 1992.
    113119    </p>
    114     <p class="bibitem" ><span class="biblabel">
     120    <p class="bibitem"><span class="biblabel">
    115121 [12]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    116  id="cite.AMPL"></a><a
     122 id="cite.AMPL"></a>
     123<a
    117124 id="XAMPL"></a>R.&#x00A0;Fourer and D.M.&#x00A0;Gay and B.W.&#x00A0;Kernighan.  AMPL: A Modeling
    118125    Language for Mathematical Programming, Second Edition, Duxbury Press
    119126    Brooks Cole Publishing Co., 2003.
    120127    </p>
    121     <p class="bibitem" ><span class="biblabel">
     128    <p class="bibitem"><span class="biblabel">
    122129 [13]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    123  id="cite.NocedalAdaptive"></a><a
     130 id="cite.NocedalAdaptive"></a>
     131<a
    124132 id="XNocedalAdaptive"></a>J.&#x00A0;Nocedal, A.&#x00A0;Wächter, and R.&#x00A0;A. Waltz. Adaptive Barrier Strategies
    125133    for Nonlinear Interior Methods.  Research Report RC 23563, IBM T. J.
     
    127135    2006)
    128136    </p>
    129     <p class="bibitem" ><span class="biblabel">
     137    <p class="bibitem"><span class="biblabel">
    130138 [14]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a
    131  id="cite.AndreasIpopt"></a><a
     139 id="cite.AndreasIpopt"></a>
     140<a
    132141 id="XAndreasIpopt"></a>A.&#x00A0;Wächter  and  L.&#x00A0;T.&#x00A0;Biegler.      On  the  Implementation  of  a
    133142    Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale
  • html/options_list.html

    r1947 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 11:55:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
     
    1714<a
    1815 id="x1-1doc"></a>
    19 <!--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
     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
    2017class="cmtt-10">BONMIN</span>&#x00A0;options  </h2>    </div>
    21 <!--l. 815--><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> </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> </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> </tr> <tr> <td> <a href="#sec:allowable_gap">allowable_gap</a> </td> <td>F</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> </tr> <tr> <td> <a href="#sec:cutoff_decr">cutoff_decr</a> </td> <td>F</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> </tr> <tr> <td> <a href="#sec:integer_tolerance">integer_tolerance</a> </td> <td>F</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> </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> </tr> <tr> <td> <a href="#sec:node_comparison">node_comparison</a> </td> <td>S</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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:read_solution_file">read_solution_file</a> </td> <td>S</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> </tr> <tr> <td> <a href="#sec:sos_constraints">sos_constraints</a> </td> <td>S</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> </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> </tr> <tr> <td> <a href="#sec:variable_selection">variable_selection</a> </td> <td>S</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> </tr> <tr> <td> <a href="#sec:Gomory_cuts">Gomory_cuts</a> </td> <td>I</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> </tr> <tr> <td> <a href="#sec:cover_cuts">cover_cuts</a> </td> <td>I</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> </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> </tr> <tr> <td> <a href="#sec:mir_cuts">mir_cuts</a> </td> <td>I</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> </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> </tr> <tr> <td> <a href="#sec:heuristic_RINS">heuristic_RINS</a> </td> <td>S</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:resolve_on_small_infeasibility">resolve_on_small_infeasibility</a> </td> <td>F</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> </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> </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> </tr> <tr> <th colspan=9> <a href="#sec:Options_for_MILP_solver">Options for MILP solver</a> </th> </tr> <tr> <td> <a href="#sec:cpx_parallel_strategy">cpx_parallel_strategy</a> </td> <td>I</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </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> </tr> <tr> <td> <a href="#sec:milp_solver">milp_solver</a> </td> <td>S</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="#sec:milp_strategy">milp_strategy</a> </td> <td>S</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="#sec:number_cpx_threads">number_cpx_threads</a> </td> <td>I</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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:ecp_probability_factor">ecp_probability_factor</a> </td> <td>F</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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:fp_pass_infeasible">fp_pass_infeasible</a> </td> <td>S</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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:tiny_element">tiny_element</a> </td> <td>F</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> </tr> <tr> <th colspan=9> <a href="#sec:Output_and_log-level_options">Output and log-level 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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:nlp_solver">nlp_solver</a> </td> <td>S</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> </tr> </tr> </table>
     18<!--l. 831--><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> </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> </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> </tr> <tr> <td> <a href="#sec:allowable_gap">allowable_gap</a> </td> <td>F</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> </tr> <tr> <td> <a href="#sec:cutoff_decr">cutoff_decr</a> </td> <td>F</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> </tr> <tr> <td> <a href="#sec:integer_tolerance">integer_tolerance</a> </td> <td>F</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> </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> </tr> <tr> <td> <a href="#sec:node_comparison">node_comparison</a> </td> <td>S</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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:random_generator_seed">random_generator_seed</a> </td> <td>I</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </tr> <tr> <td> <a href="#sec:read_solution_file">read_solution_file</a> </td> <td>S</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> </tr> <tr> <td> <a href="#sec:sos_constraints">sos_constraints</a> </td> <td>S</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> </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> </tr> <tr> <td> <a href="#sec:variable_selection">variable_selection</a> </td> <td>S</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> </tr> <tr> <td> <a href="#sec:Gomory_cuts">Gomory_cuts</a> </td> <td>I</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> </tr> <tr> <td> <a href="#sec:cover_cuts">cover_cuts</a> </td> <td>I</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> </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> </tr> <tr> <td> <a href="#sec:mir_cuts">mir_cuts</a> </td> <td>I</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> </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> </tr> <tr> <td> <a href="#sec:heuristic_RINS">heuristic_RINS</a> </td> <td>S</td> <td> +</td> <td>+</td> <td>+</td> <td>+</td> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:resolve_on_small_infeasibility">resolve_on_small_infeasibility</a> </td> <td>F</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> </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> </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> </tr> <tr> <th colspan=9> <a href="#sec:Options_for_MILP_solver">Options for MILP solver</a> </th> </tr> <tr> <td> <a href="#sec:cpx_parallel_strategy">cpx_parallel_strategy</a> </td> <td>I</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </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> </tr> <tr> <td> <a href="#sec:milp_solver">milp_solver</a> </td> <td>S</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="#sec:milp_strategy">milp_strategy</a> </td> <td>S</td> <td> -</td> <td>-</td> <td>-</td> <td>-</td> </tr> <tr> <td> <a href="#sec:number_cpx_threads">number_cpx_threads</a> </td> <td>I</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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:ecp_probability_factor">ecp_probability_factor</a> </td> <td>F</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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:fp_pass_infeasible">fp_pass_infeasible</a> </td> <td>S</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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:oa_rhs_relax">oa_rhs_relax</a> </td> <td>F</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> </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> </tr> <tr> <th colspan=9> <a href="#sec:Output_and_log-level_options">Output and log-level 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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </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> </tr> <tr> <td> <a href="#sec:nlp_solver">nlp_solver</a> </td> <td>S</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> </tr> </tr> </table>
    2219   <a
    2320 id="subsection.A.1"></a>
    2421   <h4 class="subsectionHead"><span class="titlemark">A.1   </span> <a
    2522 id="x1-1000A.1"></a>Algorithm choice</h4>
    26 <!--l. 818--><p class="noindent" ><a id="sec:Algorithm_choice"></a> <a id="sec:algorithm"></a>
     23<!--l. 834--><p class="noindent"><a id="sec:Algorithm_choice"></a>
    2724<a
    2825 id="section*.1"></a>
    29 <!--l. 820--><p class="noindent" ><span class="paragraphHead"><a
     26<!--l. 835--><p class="noindent"><span class="paragraphHead"><a
    3027 id="x1-2000A.1"></a><span
    31 class="cmbx-10">algorithm:</span></span>
    32    Choice of the algorithm. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    33 class="newline" />This will preset some of the options of bonmin depending on the algorithm choice.
    34 The default value for this string option is &#8221;B-BB&#8221;. <br
    35 class="newline" />Possible values:
     28class="cmbx-10">algorithm:</span></span> Choice of the algorithm.
     29<br class="newline" />This will preset some of the options of bonmin depending on the algorithm choice.
     30The default value for this string option is &#8221;B-BB&#8221;.
     31<br class="newline" />Possible values:
    3632     <ul class="itemize1">
    3733     <li class="itemize">B-BB: simple branch-and-bound algorithm,
     
    5046   <h4 class="subsectionHead"><span class="titlemark">A.2   </span> <a
    5147 id="x1-3000A.2"></a>Branch-and-bound options</h4>
    52 <!--l. 837--><p class="noindent" ><a id="sec:Branch-and-bound_options"></a> <a id="sec:allowable_fraction_gap"></a>
     48<!--l. 852--><p class="noindent"><a id="sec:Branch-and-bound_options"></a>
    5349<a
    5450 id="section*.2"></a>
    55 <!--l. 839--><p class="noindent" ><span class="paragraphHead"><a
     51<!--l. 853--><p class="noindent"><span class="paragraphHead"><a
    5652 id="x1-4000A.2"></a><span
    5753class="cmbx-10">allowable</span><span
    5854class="cmbx-10">_fraction</span><span
    59 class="cmbx-10">_gap:</span></span>
    60    Specify the value of relative gap under which the algorithm stops. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    61 class="newline" />Stop the tree search when the gap between the objective value of the best known
     55class="cmbx-10">_gap:</span></span> Specify the value of relative gap under which the
     56algorithm stops.
     57<br class="newline" />Stop the tree search when the gap between the objective value of the best known
    6258solution and the best bound on the objective of any solution is less than this fraction
    6359of the absolute value of the best known solution value. The valid range for this real
     
    7470class="cmr-7">+20</span></sup> and its default value is
    75710.
    76 <!--l. 849--><p class="indent" >   <a id="sec:allowable_gap"></a>
    77 
    78 <a
    79  id="page.2"></a>
     72
    8073<a
    8174 id="section*.3"></a>
    82 <!--l. 850--><p class="noindent" ><span class="paragraphHead"><a
     75<!--l. 863--><p class="noindent"><span class="paragraphHead"><a
    8376 id="x1-5000A.2"></a><span
    8477class="cmbx-10">allowable</span><span
    85 class="cmbx-10">_gap:</span></span>
    86    Specify the value of absolute gap under which the algorithm stops. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    87 class="newline" />Stop the tree search when the gap between the objective value of the best known
     78class="cmbx-10">_gap:</span></span> Specify the value of absolute gap under which the algorithm stops.
     79<br class="newline" />Stop the tree search when the gap between the objective value of the best known
    8880solution and the best bound on the objective of any solution is less than this. The
    8981valid range for this real option is <span
     
    9890class="cmr-7">+20</span></sup> and its
    9991default value is 0.
    100 <!--l. 859--><p class="indent" >   <a id="sec:cutoff"></a>
    10192<a
    10293 id="section*.4"></a>
    103 <!--l. 860--><p class="noindent" ><span class="paragraphHead"><a
     94<!--l. 872--><p class="noindent"><span class="paragraphHead"><a
    10495 id="x1-6000A.2"></a><span
    105 class="cmbx-10">cutoff:</span></span>
    106    Specify cutoff value. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    107 class="newline" />cutoff should be the value of a feasible solution known by the user (if any). The
     96class="cmbx-10">cutoff:</span></span> Specify cutoff value.
     97<br class="newline" />cutoff should be the value of a feasible solution known by the user (if any). The
    10898algorithm will only look for solutions better than cutoff. The valid range for
    10999this real option is <span
     
    119109class="cmsy-10">&#x22C5; </span>10<sup><span
    120110class="cmr-7">+100</span></sup>.
    121 <!--l. 868--><p class="indent" >   <a id="sec:cutoff_decr"></a>
    122111<a
    123112 id="section*.5"></a>
    124 <!--l. 869--><p class="noindent" ><span class="paragraphHead"><a
     113<!--l. 880--><p class="noindent"><span class="paragraphHead"><a
    125114 id="x1-7000A.2"></a><span
    126115class="cmbx-10">cutoff</span><span
    127 class="cmbx-10">_decr:</span></span>
    128    Specify cutoff decrement. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    129 class="newline" />Specify the amount by which cutoff is decremented below a new best upper-bound
     116class="cmbx-10">_decr:</span></span> Specify cutoff decrement.
     117<br class="newline" />Specify the amount by which cutoff is decremented below a new best upper-bound
    130118(usually a small positive value but in non-convex problems it may be a negative
    131119value). The valid range for this real option is <span
     
    143131class="cmsy-7">-</span><span
    144132class="cmr-7">05</span></sup>.
    145 <!--l. 878--><p class="indent" >   <a id="sec:enable_dynamic_nlp"></a>
    146133<a
    147134 id="section*.6"></a>
    148 <!--l. 879--><p class="noindent" ><span class="paragraphHead"><a
     135<!--l. 889--><p class="noindent"><span class="paragraphHead"><a
    149136 id="x1-8000A.2"></a><span
    150137class="cmbx-10">enable</span><span
    151138class="cmbx-10">_dynamic</span><span
    152 class="cmbx-10">_nlp:</span></span>
    153    Enable dynamic linear and quadratic rows addition in nlp <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    154 class="newline" />
    155 <!--l. 881--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    156 class="newline" />Possible values:
     139class="cmbx-10">_nlp:</span></span> Enable dynamic linear and quadratic rows addition in nlp
     140<br class="newline" />
     141   The default value for this string option is &#8221;no&#8221;.
     142<br class="newline" />Possible values:
    157143     <ul class="itemize1">
    158144     <li class="itemize">no:
    159145     </li>
    160146     <li class="itemize">yes:</li></ul>
    161 <!--l. 889--><p class="indent" >   <a id="sec:integer_tolerance"></a>
    162147<a
    163148 id="section*.7"></a>
    164 <!--l. 890--><p class="noindent" ><span class="paragraphHead"><a
     149<!--l. 899--><p class="noindent"><span class="paragraphHead"><a
    165150 id="x1-9000A.2"></a><span
    166151class="cmbx-10">integer</span><span
    167 class="cmbx-10">_tolerance:</span></span>
    168 
    169 <a
    170  id="page.3"></a>
    171    Set integer tolerance. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    172 class="newline" />Any number within that value of an integer is considered integer. The valid range for
     152class="cmbx-10">_tolerance:</span></span> Set integer tolerance.
     153<br class="newline" />Any number within that value of an integer is considered integer. The valid range for
    173154this real option is 0 <span
    174155class="cmmi-10">&#x003C;</span> <span
     
    181162class="cmsy-7">-</span><span
    182163class="cmr-7">06</span></sup>.
    183 <!--l. 897--><p class="indent" >   <a id="sec:iteration_limit"></a>
    184164<a
    185165 id="section*.8"></a>
    186 <!--l. 898--><p class="noindent" ><span class="paragraphHead"><a
     166<!--l. 906--><p class="noindent"><span class="paragraphHead"><a
    187167 id="x1-10000A.2"></a><span
    188168class="cmbx-10">iteration</span><span
    189 class="cmbx-10">_limit:</span></span>
    190    Set the cumulated maximum number of iteration in the algorithm used to process
    191 nodes continuous relaxations in the branch-and-bound. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    192 class="newline" />value 0 deactivates option. The valid range for this integer option is
     169class="cmbx-10">_limit:</span></span> Set the cumulated maximum number of iteration in the
     170algorithm used to process nodes continuous relaxations in the branch-and-bound.
     171<br class="newline" />value 0 deactivates option. The valid range for this integer option is
     172
    1931730 <span
    194174class="cmsy-10">&#x2264;</span> <span
     
    197177class="cmmi-10">&#x003C;</span> +<span
    198178class="cmmi-10">inf</span> and its default value is 2147483647.
    199 <!--l. 904--><p class="indent" >   <a id="sec:nlp_failure_behavior"></a>
    200179<a
    201180 id="section*.9"></a>
    202 <!--l. 905--><p class="noindent" ><span class="paragraphHead"><a
     181<!--l. 912--><p class="noindent"><span class="paragraphHead"><a
    203182 id="x1-11000A.2"></a><span
    204183class="cmbx-10">nlp</span><span
    205184class="cmbx-10">_failure</span><span
    206 class="cmbx-10">_behavior:</span></span>
    207    Set the behavior when an NLP or a series of NLP are unsolved by Ipopt (we call
    208 unsolved an NLP for which Ipopt is not able to guarantee optimality within the
    209 specified tolerances). <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    210 class="newline" />If set to &#8221;fathom&#8221;, the algorithm will fathom the node when Ipopt fails to find a
    211 solution to the nlp at that node whithin the specified tolerances. The algorithm
    212 then becomes a heuristic, and the user will be warned that the solution
    213 might not be optimal. The default value for this string option is &#8221;stop&#8221;.
    214 <br
    215 class="newline" />Possible values:
     185class="cmbx-10">_behavior:</span></span> Set the behavior when an NLP or a series of NLP are
     186unsolved by Ipopt (we call unsolved an NLP for which Ipopt is not able to guarantee
     187optimality within the specified tolerances).
     188<br class="newline" />If set to &#8221;fathom&#8221;, the algorithm will fathom the node when Ipopt fails to
     189find a solution to the nlp at that node whithin the specified tolerances. The
     190algorithm then becomes a heuristic, and the user will be warned that the
     191solution might not be optimal. The default value for this string option is
     192&#8221;stop&#8221;.
     193<br class="newline" />Possible values:
    216194     <ul class="itemize1">
    217195     <li class="itemize">stop: Stop when failure happens.
    218196     </li>
    219197     <li class="itemize">fathom: Continue when failure happens.</li></ul>
    220 <!--l. 920--><p class="indent" >   <a id="sec:node_comparison"></a>
    221198<a
    222199 id="section*.10"></a>
    223 <!--l. 921--><p class="noindent" ><span class="paragraphHead"><a
     200<!--l. 927--><p class="noindent"><span class="paragraphHead"><a
    224201 id="x1-12000A.2"></a><span
    225202class="cmbx-10">node</span><span
    226 class="cmbx-10">_comparison:</span></span>
    227    Choose the node selection strategy. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    228 class="newline" />Choose the strategy for selecting the next node to be processed. The default value for
    229 this string option is &#8221;best-bound&#8221;. <br
    230 class="newline" />Possible values:
     203class="cmbx-10">_comparison:</span></span> Choose the node selection strategy.
     204<br class="newline" />Choose the strategy for selecting the next node to be processed. The default value for
     205this string option is &#8221;best-bound&#8221;.
     206<br class="newline" />Possible values:
    231207     <ul class="itemize1">
    232208     <li class="itemize">best-bound: choose node with the smallest bound,
    233209     </li>
    234210     <li class="itemize">depth-first: Perform depth first search,
    235 
    236 <a
    237  id="page.4"></a>
    238211     </li>
    239212     <li class="itemize">breadth-first: Perform breadth first search,
     
    243216     </li>
    244217     <li class="itemize">best-guess: choose node with smallest guessed integer solution</li></ul>
    245 <!--l. 938--><p class="indent" >   <a id="sec:node_limit"></a>
    246218<a
    247219 id="section*.11"></a>
    248 <!--l. 939--><p class="noindent" ><span class="paragraphHead"><a
     220<!--l. 944--><p class="noindent"><span class="paragraphHead"><a
    249221 id="x1-13000A.2"></a><span
    250222class="cmbx-10">node</span><span
    251 class="cmbx-10">_limit:</span></span>
    252    Set the maximum number of nodes explored in the branch-and-bound search. <span style="margin-left:2.77695pt" class="tmspace"></span>
    253 <br
    254 class="newline" />The valid range for this integer option is 0 <span
     223class="cmbx-10">_limit:</span></span> Set the maximum number of nodes explored in the branch-and-bound
     224search.
     225<br class="newline" />The valid range for this integer option is 0 <span
    255226class="cmsy-10">&#x2264;</span> <span
    256227class="cmmi-10">node</span>_<span
     
    259230class="cmmi-10">inf</span> and its default
    260231value is 2147483647.
    261 <!--l. 945--><p class="indent" >   <a id="sec:num_cut_passes"></a>
     232
    262233<a
    263234 id="section*.12"></a>
    264 <!--l. 946--><p class="noindent" ><span class="paragraphHead"><a
     235<!--l. 950--><p class="noindent"><span class="paragraphHead"><a
    265236 id="x1-14000A.2"></a><span
    266237class="cmbx-10">num</span><span
    267238class="cmbx-10">_cut</span><span
    268 class="cmbx-10">_passes:</span></span>
    269    Set the maximum number of cut passes at regular nodes of the branch-and-cut. <span style="margin-left:2.77695pt" class="tmspace"></span>
    270 <br
    271 class="newline" />The valid range for this integer option is 0 <span
     239class="cmbx-10">_passes:</span></span> Set the maximum number of cut passes at regular nodes of the
     240branch-and-cut.
     241<br class="newline" />The valid range for this integer option is 0 <span
    272242class="cmsy-10">&#x2264;</span> <span
    273243class="cmmi-10">num</span>_<span
     
    277247class="cmmi-10">inf</span> and its default
    278248value is 1.
    279 <!--l. 952--><p class="indent" >   <a id="sec:num_cut_passes_at_root"></a>
    280249<a
    281250 id="section*.13"></a>
    282 <!--l. 953--><p class="noindent" ><span class="paragraphHead"><a
     251<!--l. 956--><p class="noindent"><span class="paragraphHead"><a
    283252 id="x1-15000A.2"></a><span
    284253class="cmbx-10">num</span><span
     
    286255class="cmbx-10">_passes</span><span
    287256class="cmbx-10">_at</span><span
    288 class="cmbx-10">_root:</span></span>
    289    Set the maximum number of cut passes at regular nodes of the branch-and-cut. <span style="margin-left:2.77695pt" class="tmspace"></span>
    290 <br
    291 class="newline" />The valid range for this integer option is 0 <span
     257class="cmbx-10">_root:</span></span> Set the maximum number of cut passes at regular
     258nodes of the branch-and-cut.
     259<br class="newline" />The valid range for this integer option is 0 <span
    292260class="cmsy-10">&#x2264;</span> <span
    293261class="cmmi-10">num</span>_<span
     
    299267class="cmmi-10">inf</span> and
    300268its default value is 20.
    301 <!--l. 959--><p class="indent" >   <a id="sec:number_before_trust"></a>
    302269<a
    303270 id="section*.14"></a>
    304 <!--l. 960--><p class="noindent" ><span class="paragraphHead"><a
     271<!--l. 962--><p class="noindent"><span class="paragraphHead"><a
    305272 id="x1-16000A.2"></a><span
    306273class="cmbx-10">number</span><span
    307274class="cmbx-10">_before</span><span
    308 class="cmbx-10">_trust:</span></span>
    309    Set the number of branches on a variable before its pseudo costs are to be
    310 believed in dynamic strong branching. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    311 class="newline" />A value of 0 disables pseudo costs. The valid range for this integer option is
     275class="cmbx-10">_trust:</span></span> Set the number of branches on a variable before its pseudo
     276costs are to be believed in dynamic strong branching.
     277<br class="newline" />A value of 0 disables pseudo costs. The valid range for this integer option is
    3122780 <span
    313279class="cmsy-10">&#x2264;</span> <span
     
    317283class="cmmi-10">&#x003C;</span> +<span
    318284class="cmmi-10">inf</span> and its default value is 8.
    319 <!--l. 966--><p class="indent" >   <a id="sec:number_strong_branch"></a>
    320 
    321 <a
    322  id="page.5"></a>
    323285<a
    324286 id="section*.15"></a>
    325 <!--l. 967--><p class="noindent" ><span class="paragraphHead"><a
     287<!--l. 968--><p class="noindent"><span class="paragraphHead"><a
    326288 id="x1-17000A.2"></a><span
    327289class="cmbx-10">number</span><span
    328290class="cmbx-10">_strong</span><span
    329 class="cmbx-10">_branch:</span></span>
    330    Choose the maximum number of variables considered for strong branching. <span style="margin-left:2.77695pt" class="tmspace"></span>
    331 <br
    332 class="newline" />Set the number of variables on which to do strong branching. The valid range for this
     291class="cmbx-10">_branch:</span></span> Choose the maximum number of variables considered for
     292strong branching.
     293<br class="newline" />Set the number of variables on which to do strong branching. The valid range for this
    333294integer option is 0 <span
    334295class="cmsy-10">&#x2264;</span> <span
     
    339300class="cmmi-10">inf</span> and its default value is
    34030120.
    341 <!--l. 974--><p class="indent" >   <a id="sec:read_solution_file"></a>
    342302<a
    343303 id="section*.16"></a>
    344 <!--l. 975--><p class="noindent" ><span class="paragraphHead"><a
     304<!--l. 975--><p class="noindent"><span class="paragraphHead"><a
    345305 id="x1-18000A.2"></a><span
     306class="cmbx-10">random</span><span
     307class="cmbx-10">_generator</span><span
     308class="cmbx-10">_seed:</span></span> Set seed for random number generator (a value of -1 sets
     309seeds to time since Epoch).
     310<br class="newline" />The valid range for this integer option is <span
     311class="cmsy-10">-</span>1 <span
     312class="cmsy-10">&#x2264;</span> <span
     313class="cmmi-10">random</span>_<span
     314class="cmmi-10">generator</span>_<span
     315class="cmmi-10">seed</span> <span
     316class="cmmi-10">&#x003C;</span> +<span
     317class="cmmi-10">inf</span> and
     318its default value is 0.
     319<a
     320 id="section*.17"></a>
     321<!--l. 981--><p class="noindent"><span class="paragraphHead"><a
     322 id="x1-19000A.2"></a><span
    346323class="cmbx-10">read</span><span
    347324class="cmbx-10">_solution</span><span
    348 class="cmbx-10">_file:</span></span>
    349    Read a file with the optimal solution to test if algorithms cuts it. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    350 class="newline" />For Debugging purposes only. The default value for this string option is &#8221;no&#8221;.
    351 <br
    352 class="newline" />Possible values:
     325class="cmbx-10">_file:</span></span> Read a file with the optimal solution to test if algorithms cuts
     326it.
     327<br class="newline" />For Debugging purposes only. The default value for this string option is
     328&#8221;no&#8221;.
     329<br class="newline" />Possible values:
    353330     <ul class="itemize1">
    354331     <li class="itemize">no:
    355332     </li>
    356333     <li class="itemize">yes:</li></ul>
    357 <!--l. 985--><p class="indent" >   <a id="sec:solution_limit"></a>
    358 <a
    359  id="section*.17"></a>
    360 <!--l. 986--><p class="noindent" ><span class="paragraphHead"><a
    361  id="x1-19000A.2"></a><span
     334
     335<a
     336 id="section*.18"></a>
     337<!--l. 991--><p class="noindent"><span class="paragraphHead"><a
     338 id="x1-20000A.2"></a><span
    362339class="cmbx-10">solution</span><span
    363 class="cmbx-10">_limit:</span></span>
    364    Abort after that much integer feasible solution have been found by algorithm <span style="margin-left:2.77695pt" class="tmspace"></span>
    365 <br
    366 class="newline" />value 0 deactivates option The valid range for this integer option is
     340class="cmbx-10">_limit:</span></span> Abort after that much integer feasible solution have been found by
     341algorithm
     342<br class="newline" />value 0 deactivates option The valid range for this integer option is
    3673430 <span
    368344class="cmsy-10">&#x2264;</span> <span
     
    371347class="cmmi-10">&#x003C;</span> +<span
    372348class="cmmi-10">inf</span> and its default value is 2147483647.
    373 <!--l. 992--><p class="indent" >   <a id="sec:sos_constraints"></a>
    374 <a
    375  id="section*.18"></a>
    376 <!--l. 993--><p class="noindent" ><span class="paragraphHead"><a
    377  id="x1-20000A.2"></a><span
     349<a
     350 id="section*.19"></a>
     351<!--l. 997--><p class="noindent"><span class="paragraphHead"><a
     352 id="x1-21000A.2"></a><span
    378353class="cmbx-10">sos</span><span
    379 class="cmbx-10">_constraints:</span></span>
    380    Wether or not to activate SOS constraints. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    381 class="newline" />(only type 1 SOS are supported at the moment) The default value for this string
    382 option is &#8221;enable&#8221;. <br
    383 class="newline" />Possible values:
     354class="cmbx-10">_constraints:</span></span> Wether or not to activate SOS constraints.
     355<br class="newline" />(only type 1 SOS are supported at the moment) The default value for this string
     356option is &#8221;enable&#8221;.
     357<br class="newline" />Possible values:
    384358     <ul class="itemize1">
    385359     <li class="itemize">enable:
    386360     </li>
    387361     <li class="itemize">disable:</li></ul>
    388 <!--l. 1003--><p class="indent" >   <a id="sec:time_limit"></a>
    389 
    390 <a
    391  id="page.6"></a>
    392 <a
    393  id="section*.19"></a>
    394 <!--l. 1004--><p class="noindent" ><span class="paragraphHead"><a
    395  id="x1-21000A.2"></a><span
     362<a
     363 id="section*.20"></a>
     364<!--l. 1007--><p class="noindent"><span class="paragraphHead"><a
     365 id="x1-22000A.2"></a><span
    396366class="cmbx-10">time</span><span
    397 class="cmbx-10">_limit:</span></span>
    398    Set the global maximum computation time (in secs) for the algorithm. <span style="margin-left:2.77695pt" class="tmspace"></span>
    399 <br
    400 class="newline" />The valid range for this real option is 0 <span
     367class="cmbx-10">_limit:</span></span> Set the global maximum computation time (in secs) for the algorithm.
     368<br class="newline" />The valid range for this real option is 0 <span
    401369class="cmsy-10">&#x2264;</span> <span
    402370class="cmmi-10">time</span>_<span
     
    407375class="cmsy-10">&#x22C5; </span>10<sup><span
    408376class="cmr-7">+10</span></sup>.
    409 <!--l. 1010--><p class="indent" >   <a id="sec:tree_search_strategy"></a>
    410 <a
    411  id="section*.20"></a>
    412 <!--l. 1011--><p class="noindent" ><span class="paragraphHead"><a
    413  id="x1-22000A.2"></a><span
     377<a
     378 id="section*.21"></a>
     379<!--l. 1013--><p class="noindent"><span class="paragraphHead"><a
     380 id="x1-23000A.2"></a><span
    414381class="cmbx-10">tree</span><span
    415382class="cmbx-10">_search</span><span
    416 class="cmbx-10">_strategy:</span></span>
    417    Pick a strategy for traversing the tree <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    418 class="newline" />All strategies can be used in conjunction with any of the node comparison functions.
     383class="cmbx-10">_strategy:</span></span> Pick a strategy for traversing the tree
     384<br class="newline" />All strategies can be used in conjunction with any of the node comparison functions.
    419385Options which affect dfs-dive are max-backtracks-in-dive and max-dive-depth. The
    420 dfs-dive won&#8217;t work in a non-convex problem where objective does not decrease
    421 down branches. The default value for this string option is &#8221;probed-dive&#8221;.
    422 <br
    423 class="newline" />Possible values:
     386dfs-dive won&#8217;t work in a non-convex problem where objective does not decrease down
     387branches. The default value for this string option is &#8221;probed-dive&#8221;.
     388<br class="newline" />Possible values:
    424389     <ul class="itemize1">
    425390     <li class="itemize">top-node: Always pick the top node as sorted by the node comparison
     
    434399     <li class="itemize">dfs-dive: Dive in the tree if possible doing a depth first search. Backtrack
    435400     on leaves or when a prescribed depth is attained or when estimate of best
     401
    436402     possible integer feasible solution in subtree is worst than cutoff. Once a
    437403     prescribed limit of backtracks is attained pick top node as sorted by the
     
    440406     <li class="itemize">dfs-dive-dynamic: Same as dfs-dive but once enough solution are found
    441407     switch to best-bound and if too many nodes switch to depth-first.</li></ul>
    442 <!--l. 1041--><p class="indent" >   <a id="sec:variable_selection"></a>
    443 <a
    444  id="section*.21"></a>
    445 <!--l. 1042--><p class="noindent" ><span class="paragraphHead"><a
    446  id="x1-23000A.2"></a><span
     408<a
     409 id="section*.22"></a>
     410<!--l. 1043--><p class="noindent"><span class="paragraphHead"><a
     411 id="x1-24000A.2"></a><span
    447412class="cmbx-10">variable</span><span
    448 class="cmbx-10">_selection:</span></span>
    449    Chooses variable selection strategy <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    450 class="newline" />
    451 
    452 <a
    453  id="page.7"></a>
    454 <!--l. 1044--><p class="indent" >   The default value for this string option is &#8221;strong-branching&#8221;. <br
    455 class="newline" />Possible values:
     413class="cmbx-10">_selection:</span></span> Chooses variable selection strategy
     414<br class="newline" />
     415   The default value for this string option is &#8221;osi-strong&#8221;.
     416<br class="newline" />Possible values:
    456417     <ul class="itemize1">
    457418     <li class="itemize">most-fractional: Choose most fractional variable
     
    475436 id="subsection.A.3"></a>
    476437   <h4 class="subsectionHead"><span class="titlemark">A.3   </span> <a
    477  id="x1-24000A.3"></a>MILP cutting planes in hybrid</h4>
    478 <!--l. 1061--><p class="noindent" ><a id="sec:MILP_cutting_planes_in_hybrid"></a> <a id="sec:2mir_cuts"></a>
    479 <a
    480  id="section*.22"></a>
    481 <!--l. 1063--><p class="noindent" ><span class="paragraphHead"><a
    482  id="x1-25000A.3"></a><span
     438 id="x1-25000A.3"></a>MILP cutting planes in hybrid</h4>
     439<!--l. 1062--><p class="noindent"><a id="sec:MILP_cutting_planes_in_hybrid"></a>
     440
     441<a
     442 id="section*.23"></a>
     443<!--l. 1063--><p class="noindent"><span class="paragraphHead"><a
     444 id="x1-26000A.3"></a><span
    483445class="cmbx-10">2mir</span><span
    484 class="cmbx-10">_cuts:</span></span>
    485    Frequency (in terms of nodes) for generating 2-MIR cuts in branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span>
    486 <br
    487 class="newline" />If <span
    488 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     446class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating 2-MIR cuts in
     447branch-and-cut
     448<br class="newline" />If <span
     449class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     450class="cmmi-10">k </span>nodes, if <span
    489451class="cmsy-10">-</span>99 <span
    490452class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated every
     
    504466class="cmmi-10">inf</span>
    505467and its default value is 0.
    506 <!--l. 1074--><p class="indent" >   <a id="sec:Gomory_cuts"></a>
    507 
    508 <a
    509  id="page.8"></a>
    510 <a
    511  id="section*.23"></a>
    512 <!--l. 1075--><p class="noindent" ><span class="paragraphHead"><a
    513  id="x1-26000A.3"></a><span
     468<a
     469 id="section*.24"></a>
     470<!--l. 1074--><p class="noindent"><span class="paragraphHead"><a
     471 id="x1-27000A.3"></a><span
    514472class="cmbx-10">Gomory</span><span
    515 class="cmbx-10">_cuts:</span></span>
    516    Frequency k (in terms of nodes) for generating Gomory cuts in branch-and-cut. <span style="margin-left:2.77695pt" class="tmspace"></span>
    517 <br
    518 class="newline" />If <span
    519 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     473class="cmbx-10">_cuts:</span></span> Frequency k (in terms of nodes) for generating Gomory cuts in
     474branch-and-cut.
     475<br class="newline" />If <span
     476class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     477class="cmmi-10">k </span>nodes, if <span
    520478class="cmsy-10">-</span>99 <span
    521479class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated every
     
    536494class="cmmi-10">inf</span> and its default value is <span
    537495class="cmsy-10">-</span>5.
    538 <!--l. 1086--><p class="indent" >   <a id="sec:clique_cuts"></a>
    539 <a
    540  id="section*.24"></a>
    541 <!--l. 1087--><p class="noindent" ><span class="paragraphHead"><a
    542  id="x1-27000A.3"></a><span
     496<a
     497 id="section*.25"></a>
     498<!--l. 1085--><p class="noindent"><span class="paragraphHead"><a
     499 id="x1-28000A.3"></a><span
    543500class="cmbx-10">clique</span><span
    544 class="cmbx-10">_cuts:</span></span>
    545    Frequency (in terms of nodes) for generating clique cuts in branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span>
    546 <br
    547 class="newline" />If <span
    548 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     501class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating clique cuts in
     502branch-and-cut
     503<br class="newline" />If <span
     504class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     505class="cmmi-10">k </span>nodes, if <span
    549506class="cmsy-10">-</span>99 <span
    550507class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated every
     
    565522and its default value is <span
    566523class="cmsy-10">-</span>5.
    567 <!--l. 1098--><p class="indent" >   <a id="sec:cover_cuts"></a>
    568 <a
    569  id="section*.25"></a>
    570 <!--l. 1099--><p class="noindent" ><span class="paragraphHead"><a
    571  id="x1-28000A.3"></a><span
     524<a
     525 id="section*.26"></a>
     526<!--l. 1096--><p class="noindent"><span class="paragraphHead"><a
     527 id="x1-29000A.3"></a><span
    572528class="cmbx-10">cover</span><span
    573 class="cmbx-10">_cuts:</span></span>
    574    Frequency (in terms of nodes) for generating cover cuts in branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span>
    575 <br
    576 class="newline" />If <span
    577 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     529class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating cover cuts in
     530branch-and-cut
     531<br class="newline" />If <span
     532class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     533class="cmmi-10">k </span>nodes, if <span
    578534class="cmsy-10">-</span>99 <span
    579535class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated every
     
    593549class="cmmi-10">inf</span>
    594550and its default value is 0.
    595 <!--l. 1110--><p class="indent" >   <a id="sec:flow_cover_cuts"></a>
    596 <a
    597  id="section*.26"></a>
    598 <!--l. 1111--><p class="noindent" ><span class="paragraphHead"><a
    599  id="x1-29000A.3"></a><span
     551<a
     552 id="section*.27"></a>
     553<!--l. 1107--><p class="noindent"><span class="paragraphHead"><a
     554 id="x1-30000A.3"></a><span
    600555class="cmbx-10">flow</span><span
    601556class="cmbx-10">_cover</span><span
    602 class="cmbx-10">_cuts:</span></span>
    603    Frequency (in terms of nodes) for generating flow cover cuts in branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span>
    604 <br
    605 class="newline" />If <span
    606 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     557class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating flow cover cuts in
     558branch-and-cut
     559<br class="newline" />If <span
     560class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     561class="cmmi-10">k </span>nodes, if <span
    607562class="cmsy-10">-</span>99 <span
    608563class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated every
     
    624579class="cmmi-10">inf</span> and its default value is <span
    625580class="cmsy-10">-</span>5.
    626 <!--l. 1122--><p class="indent" >   <a id="sec:lift_and_project_cuts"></a>
    627 
    628 <a
    629  id="page.9"></a>
    630 <a
    631  id="section*.27"></a>
    632 <!--l. 1123--><p class="noindent" ><span class="paragraphHead"><a
    633  id="x1-30000A.3"></a><span
     581
     582<a
     583 id="section*.28"></a>
     584<!--l. 1118--><p class="noindent"><span class="paragraphHead"><a
     585 id="x1-31000A.3"></a><span
    634586class="cmbx-10">lift</span><span
    635587class="cmbx-10">_and</span><span
    636588class="cmbx-10">_project</span><span
    637 class="cmbx-10">_cuts:</span></span>
    638    Frequency (in terms of nodes) for generating lift-and-project cuts in
    639 branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    640 class="newline" />If <span
    641 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     589class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating lift-and-project
     590cuts in branch-and-cut
     591<br class="newline" />If <span
     592class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     593class="cmmi-10">k </span>nodes, if <span
    642594class="cmsy-10">-</span>99 <span
    643595class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated
     
    660612class="cmmi-10">inf</span> and its default value is
    6616130.
    662 <!--l. 1134--><p class="indent" >   <a id="sec:mir_cuts"></a>
    663 <a
    664  id="section*.28"></a>
    665 <!--l. 1135--><p class="noindent" ><span class="paragraphHead"><a
    666  id="x1-31000A.3"></a><span
     614<a
     615 id="section*.29"></a>
     616<!--l. 1129--><p class="noindent"><span class="paragraphHead"><a
     617 id="x1-32000A.3"></a><span
    667618class="cmbx-10">mir</span><span
    668 class="cmbx-10">_cuts:</span></span>
    669    Frequency (in terms of nodes) for generating MIR cuts in branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span>
    670 <br
    671 class="newline" />If <span
    672 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     619class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating MIR cuts in branch-and-cut
     620<br class="newline" />If <span
     621class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     622class="cmmi-10">k </span>nodes, if <span
    673623class="cmsy-10">-</span>99 <span
    674624class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated every
     
    689639and its default value is <span
    690640class="cmsy-10">-</span>5.
    691 <!--l. 1146--><p class="indent" >   <a id="sec:reduce_and_split_cuts"></a>
    692 <a
    693  id="section*.29"></a>
    694 <!--l. 1147--><p class="noindent" ><span class="paragraphHead"><a
    695  id="x1-32000A.3"></a><span
     641<a
     642 id="section*.30"></a>
     643<!--l. 1140--><p class="noindent"><span class="paragraphHead"><a
     644 id="x1-33000A.3"></a><span
    696645class="cmbx-10">reduce</span><span
    697646class="cmbx-10">_and</span><span
    698647class="cmbx-10">_split</span><span
    699 class="cmbx-10">_cuts:</span></span>
    700    Frequency (in terms of nodes) for generating reduce-and-split cuts in
    701 branch-and-cut <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    702 class="newline" />If <span
    703 class="cmmi-10">k &#x003E; </span>0, cuts are generated every k nodes, if <span
     648class="cmbx-10">_cuts:</span></span> Frequency (in terms of nodes) for generating
     649reduce-and-split cuts in branch-and-cut
     650<br class="newline" />If <span
     651class="cmmi-10">k &#x003E; </span>0, cuts are generated every <span
     652class="cmmi-10">k </span>nodes, if <span
    704653class="cmsy-10">-</span>99 <span
    705654class="cmmi-10">&#x003C; k &#x003C; </span>0 cuts are generated
     
    725674 id="subsection.A.4"></a>
    726675   <h4 class="subsectionHead"><span class="titlemark">A.4   </span> <a
    727  id="x1-33000A.4"></a>MINLP Heuristics</h4>
    728 <!--l. 1160--><p class="noindent" ><a id="sec:MINLP_Heuristics"></a> <a id="sec:feasibility_pump_objective_norm"></a>
    729 <a
    730  id="section*.30"></a>
    731 <!--l. 1162--><p class="noindent" ><span class="paragraphHead"><a
    732  id="x1-34000A.4"></a><span
     676 id="x1-34000A.4"></a>MINLP Heuristics</h4>
     677<!--l. 1153--><p class="noindent"><a id="sec:MINLP_Heuristics"></a>
     678<a
     679 id="section*.31"></a>
     680<!--l. 1154--><p class="noindent"><span class="paragraphHead"><a
     681 id="x1-35000A.4"></a><span
    733682class="cmbx-10">feasibility</span><span
    734683class="cmbx-10">_pump</span><span
    735684class="cmbx-10">_objective</span><span
    736 class="cmbx-10">_norm:</span></span>
    737    Norm of feasibility pump objective function <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    738 class="newline" />The valid range for this integer option is 1 <span
     685class="cmbx-10">_norm:</span></span> Norm of feasibility pump objective function
     686<br class="newline" />The valid range for this integer option is 1 <span
    739687class="cmsy-10">&#x2264;</span> <span
    740688class="cmmi-10">feasibility</span>_<span
     
    744692class="cmsy-10">&#x2264; </span>2
    745693and its default value is 1.
    746 <!--l. 1168--><p class="indent" >   <a id="sec:heuristic_RINS"></a>
    747 
    748 <a
    749  id="page.10"></a>
    750 <a
    751  id="section*.31"></a>
    752 <!--l. 1169--><p class="noindent" ><span class="paragraphHead"><a
    753  id="x1-35000A.4"></a><span
    754 class="cmbx-10">heuristic</span><span
    755 class="cmbx-10">_RINS:</span></span>
    756    if yes runs the RINS heuristic <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    757 class="newline" />
    758 <!--l. 1171--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    759 class="newline" />Possible values:
    760      <ul class="itemize1">
    761      <li class="itemize">no: don&#8217;t run it
    762      </li>
    763      <li class="itemize">yes: runs the heuristic</li></ul>
    764 <!--l. 1179--><p class="indent" >   <a id="sec:heuristic_dive_MIP_fractional"></a>
    765694<a
    766695 id="section*.32"></a>
    767 <!--l. 1180--><p class="noindent" ><span class="paragraphHead"><a
     696<!--l. 1160--><p class="noindent"><span class="paragraphHead"><a
    768697 id="x1-36000A.4"></a><span
    769698class="cmbx-10">heuristic</span><span
    770 class="cmbx-10">_dive</span><span
    771 class="cmbx-10">_MIP</span><span
    772 class="cmbx-10">_fractional:</span></span>
    773    if yes runs the Dive MIP Fractional heuristic <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    774 class="newline" />
    775 <!--l. 1182--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    776 class="newline" />Possible values:
     699class="cmbx-10">_RINS:</span></span> if yes runs the RINS heuristic
     700<br class="newline" />
     701   The default value for this string option is &#8221;no&#8221;.
     702<br class="newline" />Possible values:
     703
    777704     <ul class="itemize1">
    778705     <li class="itemize">no: don&#8217;t run it
    779706     </li>
    780707     <li class="itemize">yes: runs the heuristic</li></ul>
    781 <!--l. 1190--><p class="indent" >   <a id="sec:heuristic_dive_MIP_vectorLength"></a>
    782708<a
    783709 id="section*.33"></a>
    784 <!--l. 1191--><p class="noindent" ><span class="paragraphHead"><a
     710<!--l. 1170--><p class="noindent"><span class="paragraphHead"><a
    785711 id="x1-37000A.4"></a><span
    786712class="cmbx-10">heuristic</span><span
    787713class="cmbx-10">_dive</span><span
    788714class="cmbx-10">_MIP</span><span
    789 class="cmbx-10">_vectorLength:</span></span>
    790    if yes runs the Dive MIP VectorLength heuristic <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    791 class="newline" />
    792 <!--l. 1193--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    793 class="newline" />Possible values:
     715class="cmbx-10">_fractional:</span></span> if yes runs the Dive MIP Fractional heuristic
     716<br class="newline" />
     717   The default value for this string option is &#8221;no&#8221;.
     718<br class="newline" />Possible values:
    794719     <ul class="itemize1">
    795720     <li class="itemize">no: don&#8217;t run it
    796721     </li>
    797722     <li class="itemize">yes: runs the heuristic</li></ul>
    798 <!--l. 1201--><p class="indent" >   <a id="sec:heuristic_dive_fractional"></a>
    799 
    800 <a
    801  id="page.11"></a>
    802723<a
    803724 id="section*.34"></a>
    804 <!--l. 1202--><p class="noindent" ><span class="paragraphHead"><a
     725<!--l. 1180--><p class="noindent"><span class="paragraphHead"><a
    805726 id="x1-38000A.4"></a><span
    806727class="cmbx-10">heuristic</span><span
    807728class="cmbx-10">_dive</span><span
    808 class="cmbx-10">_fractional:</span></span>
    809    if yes runs the Dive Fractional heuristic <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    810 class="newline" />
    811 <!--l. 1204--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    812 class="newline" />Possible values:
     729class="cmbx-10">_MIP</span><span
     730class="cmbx-10">_vectorLength:</span></span> if yes runs the Dive MIP VectorLength
     731heuristic
     732<br class="newline" />
     733   The default value for this string option is &#8221;no&#8221;.
     734<br class="newline" />Possible values:
    813735     <ul class="itemize1">
    814736     <li class="itemize">no: don&#8217;t run it
    815737     </li>
    816738     <li class="itemize">yes: runs the heuristic</li></ul>
    817 <!--l. 1212--><p class="indent" >   <a id="sec:heuristic_dive_vectorLength"></a>
    818739<a
    819740 id="section*.35"></a>
    820 <!--l. 1213--><p class="noindent" ><span class="paragraphHead"><a
     741<!--l. 1190--><p class="noindent"><span class="paragraphHead"><a
    821742 id="x1-39000A.4"></a><span
    822743class="cmbx-10">heuristic</span><span
    823744class="cmbx-10">_dive</span><span
    824 class="cmbx-10">_vectorLength:</span></span>
    825    if yes runs the Dive VectorLength heuristic <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    826 class="newline" />
    827 <!--l. 1215--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    828 class="newline" />Possible values:
     745class="cmbx-10">_fractional:</span></span> if yes runs the Dive Fractional heuristic
     746<br class="newline" />
     747   The default value for this string option is &#8221;no&#8221;.
     748<br class="newline" />Possible values:
    829749     <ul class="itemize1">
    830750     <li class="itemize">no: don&#8217;t run it
    831751     </li>
    832752     <li class="itemize">yes: runs the heuristic</li></ul>
    833 <!--l. 1223--><p class="indent" >   <a id="sec:heuristic_feasibility_pump"></a>
     753
    834754<a
    835755 id="section*.36"></a>
    836 <!--l. 1224--><p class="noindent" ><span class="paragraphHead"><a
     756<!--l. 1200--><p class="noindent"><span class="paragraphHead"><a
    837757 id="x1-40000A.4"></a><span
    838758class="cmbx-10">heuristic</span><span
     759class="cmbx-10">_dive</span><span
     760class="cmbx-10">_vectorLength:</span></span> if yes runs the Dive VectorLength heuristic
     761<br class="newline" />
     762   The default value for this string option is &#8221;no&#8221;.
     763<br class="newline" />Possible values:
     764     <ul class="itemize1">
     765     <li class="itemize">no: don&#8217;t run it
     766     </li>
     767     <li class="itemize">yes: runs the heuristic</li></ul>
     768<a
     769 id="section*.37"></a>
     770<!--l. 1210--><p class="noindent"><span class="paragraphHead"><a
     771 id="x1-41000A.4"></a><span
     772class="cmbx-10">heuristic</span><span
    839773class="cmbx-10">_feasibility</span><span
    840 class="cmbx-10">_pump:</span></span>
    841    whether the heuristic feasibility pump should be used <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    842 class="newline" />
    843 <!--l. 1226--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    844 class="newline" />Possible values:
     774class="cmbx-10">_pump:</span></span> whether the heuristic feasibility pump should be used
     775<br class="newline" />
     776   The default value for this string option is &#8221;no&#8221;.
     777<br class="newline" />Possible values:
    845778     <ul class="itemize1">
    846779     <li class="itemize">no: don&#8217;t use it
    847780     </li>
    848781     <li class="itemize">yes: use it</li></ul>
    849 <!--l. 1234--><p class="indent" >   <a id="sec:pump_for_minlp"></a>
    850 
    851 <a
    852  id="page.12"></a>
    853 <a
    854  id="section*.37"></a>
    855 <!--l. 1235--><p class="noindent" ><span class="paragraphHead"><a
    856  id="x1-41000A.4"></a><span
     782<a
     783 id="section*.38"></a>
     784<!--l. 1220--><p class="noindent"><span class="paragraphHead"><a
     785 id="x1-42000A.4"></a><span
    857786class="cmbx-10">pump</span><span
    858787class="cmbx-10">_for</span><span
    859 class="cmbx-10">_minlp:</span></span>
    860    if yes runs FP for MINLP <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    861 class="newline" />
    862 <!--l. 1237--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    863 class="newline" />Possible values:
     788class="cmbx-10">_minlp:</span></span> if yes runs FP for MINLP
     789<br class="newline" />
     790   The default value for this string option is &#8221;no&#8221;.
     791<br class="newline" />Possible values:
    864792     <ul class="itemize1">
    865793     <li class="itemize">no: don&#8217;t run it
     
    869797 id="subsection.A.5"></a>
    870798   <h4 class="subsectionHead"><span class="titlemark">A.5   </span> <a
    871  id="x1-42000A.5"></a>Nlp solution robustness</h4>
    872 <!--l. 1247--><p class="noindent" ><a id="sec:Nlp_solution_robustness"></a> <a id="sec:max_consecutive_failures"></a>
    873 <a
    874  id="section*.38"></a>
    875 <!--l. 1249--><p class="noindent" ><span class="paragraphHead"><a
    876  id="x1-43000A.5"></a><span
     799 id="x1-43000A.5"></a>Nlp solution robustness</h4>
     800<!--l. 1232--><p class="noindent"><a id="sec:Nlp_solution_robustness"></a>
     801<a
     802 id="section*.39"></a>
     803<!--l. 1233--><p class="noindent"><span class="paragraphHead"><a
     804 id="x1-44000A.5"></a><span
    877805class="cmbx-10">max</span><span
    878806class="cmbx-10">_consecutive</span><span
    879 class="cmbx-10">_failures:</span></span>
    880    (temporarily removed) Number <span
    881 class="cmmi-10">n </span>of consecutive unsolved problems before
    882 aborting a branch of the tree. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    883 class="newline" />When <span
     807class="cmbx-10">_failures:</span></span> (temporarily removed) Number <span
     808class="cmmi-10">n </span>of consecutive
     809unsolved problems before aborting a branch of the tree.
     810<br class="newline" />When <span
    884811class="cmmi-10">n &#x003E; </span>0, continue exploring a branch of the tree until <span
    885812class="cmmi-10">n </span>consecutive problems in
    886813the branch are unsolved (we call unsolved a problem for which Ipopt can not
     814
    887815guarantee optimality within the specified tolerances). The valid range for this integer
    888816option is 0 <span
     
    894822class="cmmi-10">inf</span> and its default value is
    89582310.
    896 <!--l. 1259--><p class="indent" >   <a id="sec:max_random_point_radius"></a>
    897 <a
    898  id="section*.39"></a>
    899 <!--l. 1260--><p class="noindent" ><span class="paragraphHead"><a
    900  id="x1-44000A.5"></a><span
     824<a
     825 id="section*.40"></a>
     826<!--l. 1243--><p class="noindent"><span class="paragraphHead"><a
     827 id="x1-45000A.5"></a><span
    901828class="cmbx-10">max</span><span
    902829class="cmbx-10">_random</span><span
    903830class="cmbx-10">_point</span><span
    904 class="cmbx-10">_radius:</span></span>
    905    Set max value r for coordinate of a random point. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    906 class="newline" />When picking a random point, coordinate i will be in the interval [min(max(l,-r),u-r),
     831class="cmbx-10">_radius:</span></span> Set max value r for coordinate of a random point.
     832<br class="newline" />When picking a random point, coordinate i will be in the interval [min(max(l,-r),u-r),
    907833max(min(u,r),l+r)] (where l is the lower bound for the variable and u is its upper bound)
    908834The valid range for this real option is 0 <span
     
    915841class="cmmi-10">inf</span> and
    916842its default value is 100000.
    917 <!--l. 1269--><p class="indent" >   <a id="sec:num_iterations_suspect"></a>
    918 <a
    919  id="section*.40"></a>
    920 <!--l. 1270--><p class="noindent" ><span class="paragraphHead"><a
    921  id="x1-45000A.5"></a><span
     843<a
     844 id="section*.41"></a>
     845<!--l. 1252--><p class="noindent"><span class="paragraphHead"><a
     846 id="x1-46000A.5"></a><span
    922847class="cmbx-10">num</span><span
    923848class="cmbx-10">_iterations</span><span
    924 class="cmbx-10">_suspect:</span></span>
    925    Number of iterations over which a node is considered &#8221;suspect&#8221; (for debugging
    926 purposes only, see detailed documentation). <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    927 class="newline" />When the number of iterations to solve a node is above this number, the
     849class="cmbx-10">_suspect:</span></span> Number of iterations over which a node is considered
     850&#8221;suspect&#8221; (for debugging purposes only, see detailed documentation).
     851<br class="newline" />When the number of iterations to solve a node is above this number, the
    928852subproblem at this node is considered to be suspect and it will be outputed in a
    929853file (set to -1 to deactivate this). The valid range for this integer option is
     
    937861class="cmmi-10">inf</span> and its default value is <span
    938862class="cmsy-10">-</span>1.
    939 <!--l. 1279--><p class="indent" >   <a id="sec:num_retry_unsolved_random_point"></a>
    940 
    941 <a
    942  id="page.13"></a>
    943 <a
    944  id="section*.41"></a>
    945 <!--l. 1280--><p class="noindent" ><span class="paragraphHead"><a
    946  id="x1-46000A.5"></a><span
     863<a
     864 id="section*.42"></a>
     865<!--l. 1261--><p class="noindent"><span class="paragraphHead"><a
     866 id="x1-47000A.5"></a><span
    947867class="cmbx-10">num</span><span
    948868class="cmbx-10">_retry</span><span
    949869class="cmbx-10">_unsolved</span><span
    950870class="cmbx-10">_random</span><span
    951 class="cmbx-10">_point:</span></span>
    952    Number <span
    953 class="cmmi-10">k </span>of times that the algorithm will try to resolve an unsolved NLP with a
    954 random starting point (we call unsolved an NLP for which Ipopt is not able to
    955 guarantee optimality within the specified tolerances). <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    956 class="newline" />When Ipopt fails to solve a continuous NLP sub-problem, if <span
     871class="cmbx-10">_point:</span></span> Number <span
     872class="cmmi-10">k </span>of times that the algorithm will
     873try to resolve an unsolved NLP with a random starting point (we call unsolved an
     874NLP for which Ipopt is not able to guarantee optimality within the specified
     875tolerances).
     876<br class="newline" />When Ipopt fails to solve a continuous NLP sub-problem, if <span
    957877class="cmmi-10">k &#x003E; </span>0, the algorithm will
    958878try again to solve the failed NLP with <span
     
    969889class="cmmi-10">inf</span> and its default value is
    9708900.
    971 <!--l. 1290--><p class="indent" >   <a id="sec:random_point_perturbation_interval"></a>
    972 <a
    973  id="section*.42"></a>
    974 <!--l. 1291--><p class="noindent" ><span class="paragraphHead"><a
    975  id="x1-47000A.5"></a><span
     891<a
     892 id="section*.43"></a>
     893<!--l. 1271--><p class="noindent"><span class="paragraphHead"><a
     894 id="x1-48000A.5"></a><span
    976895class="cmbx-10">random</span><span
    977896class="cmbx-10">_point</span><span
    978897class="cmbx-10">_perturbation</span><span
    979 class="cmbx-10">_interval:</span></span>
    980    Amount by which starting point is perturbed when choosing to pick random point
    981 by perturbating starting point <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    982 class="newline" />The valid range for this real option is 0 <span
     898class="cmbx-10">_interval:</span></span> Amount by which starting point is
     899perturbed when choosing to pick random point by perturbating starting point
     900<br class="newline" />The valid range for this real option is 0 <span
    983901class="cmmi-10">&#x003C;</span> <span
    984902class="cmmi-10">random</span>_<span
     
    989907class="cmmi-10">inf</span>
    990908and its default value is 1.
    991 <!--l. 1297--><p class="indent" >   <a id="sec:random_point_type"></a>
    992 <a
    993  id="section*.43"></a>
    994 <!--l. 1298--><p class="noindent" ><span class="paragraphHead"><a
    995  id="x1-48000A.5"></a><span
     909<a
     910 id="section*.44"></a>
     911<!--l. 1277--><p class="noindent"><span class="paragraphHead"><a
     912 id="x1-49000A.5"></a><span
    996913class="cmbx-10">random</span><span
    997914class="cmbx-10">_point</span><span
    998 class="cmbx-10">_type:</span></span>
    999    method to choose a random starting point <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1000 class="newline" />
    1001 <!--l. 1300--><p class="indent" >   The default value for this string option is &#8221;Jon&#8221;. <br
    1002 class="newline" />Possible values:
     915class="cmbx-10">_type:</span></span> method to choose a random starting point
     916<br class="newline" />
     917   The default value for this string option is &#8221;Jon&#8221;.
     918<br class="newline" />Possible values:
    1003919     <ul class="itemize1">
    1004920     <li class="itemize">Jon: Choose random point uniformly between the bounds
     921
    1005922     </li>
    1006923     <li class="itemize">Andreas: perturb the starting point of the problem within a prescribed
     
    1009926     <li class="itemize">Claudia: perturb the starting point using the perturbation radius suffix
    1010927     information</li></ul>
    1011 <!--l. 1311--><p class="indent" >   <a id="sec:resolve_on_small_infeasibility"></a>
    1012 <a
    1013  id="section*.44"></a>
    1014 <!--l. 1312--><p class="noindent" ><span class="paragraphHead"><a
    1015  id="x1-49000A.5"></a><span
     928<a
     929 id="section*.45"></a>
     930<!--l. 1290--><p class="noindent"><span class="paragraphHead"><a
     931 id="x1-50000A.5"></a><span
    1016932class="cmbx-10">resolve</span><span
    1017933class="cmbx-10">_on</span><span
    1018934class="cmbx-10">_small</span><span
    1019 class="cmbx-10">_infeasibility:</span></span>
    1020    If a locally infeasible problem is infeasible by less than this resolve itwith initial
    1021 starting point. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1022 class="newline" />It is set to 0 by default with Ipopt. For filter Bonmin sets it to a small value. The
     935class="cmbx-10">_infeasibility:</span></span> If a locally infeasible problem is infeasible by less
     936than this, resolve it with initial starting point.
     937<br class="newline" />It is set to 0 by default with Ipopt. For filter Bonmin sets it to a small value. The
    1023938valid range for this real option is 0 <span
    1024939class="cmsy-10">&#x2264;</span> <span
     
    1030945class="cmmi-10">inf</span> and its
    1031946default value is 0.
    1032 
    1033 <a
    1034  id="page.14"></a>
    1035947   <a
    1036948 id="subsection.A.6"></a>
    1037949   <h4 class="subsectionHead"><span class="titlemark">A.6   </span> <a
    1038  id="x1-50000A.6"></a>Nlp solve options in B-Hyb</h4>
    1039 <!--l. 1321--><p class="noindent" ><a id="sec:Nlp_solve_options_in_B-Hyb"></a> <a id="sec:nlp_solve_frequency"></a>
    1040 <a
    1041  id="section*.45"></a>
    1042 <!--l. 1323--><p class="noindent" ><span class="paragraphHead"><a
    1043  id="x1-51000A.6"></a><span
     950 id="x1-51000A.6"></a>Nlp solve options in B-Hyb</h4>
     951<!--l. 1299--><p class="noindent"><a id="sec:Nlp_solve_options_in_B-Hyb"></a>
     952<a
     953 id="section*.46"></a>
     954<!--l. 1300--><p class="noindent"><span class="paragraphHead"><a
     955 id="x1-52000A.6"></a><span
    1044956class="cmbx-10">nlp</span><span
    1045957class="cmbx-10">_solve</span><span
    1046 class="cmbx-10">_frequency:</span></span>
    1047    Specify the frequency (in terms of nodes) at which NLP relaxations are solved in
    1048 B-Hyb. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1049 class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
     958class="cmbx-10">_frequency:</span></span> Specify the frequency (in terms of nodes) at which NLP
     959relaxations are solved in B-Hyb.
     960<br class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
    1050961this integer option is 0 <span
    1051962class="cmsy-10">&#x2264;</span> <span
     
    1056967class="cmmi-10">inf</span> and its default value is
    105796810.
    1058 <!--l. 1330--><p class="indent" >   <a id="sec:nlp_solve_max_depth"></a>
    1059 <a
    1060  id="section*.46"></a>
    1061 <!--l. 1331--><p class="noindent" ><span class="paragraphHead"><a
    1062  id="x1-52000A.6"></a><span
     969<a
     970 id="section*.47"></a>
     971<!--l. 1307--><p class="noindent"><span class="paragraphHead"><a
     972 id="x1-53000A.6"></a><span
    1063973class="cmbx-10">nlp</span><span
    1064974class="cmbx-10">_solve</span><span
    1065975class="cmbx-10">_max</span><span
    1066 class="cmbx-10">_depth:</span></span>
    1067    Set maximum depth in the tree at which NLP relaxations are solved in B-Hyb. <span style="margin-left:2.77695pt" class="tmspace"></span>
    1068 <br
    1069 class="newline" />A depth of 0 amounts to to never solve the NLP relaxation. The valid range for this
     976class="cmbx-10">_depth:</span></span> Set maximum depth in the tree at which NLP relaxations
     977are solved in B-Hyb.
     978<br class="newline" />A depth of 0 amounts to to never solve the NLP relaxation. The valid range for this
    1070979integer option is 0 <span
    1071980class="cmsy-10">&#x2264;</span> <span
     
    1077986class="cmmi-10">inf</span> and its default value is
    107898710.
    1079 <!--l. 1338--><p class="indent" >   <a id="sec:nlp_solves_per_depth"></a>
    1080 <a
    1081  id="section*.47"></a>
    1082 <!--l. 1339--><p class="noindent" ><span class="paragraphHead"><a
    1083  id="x1-53000A.6"></a><span
     988<a
     989 id="section*.48"></a>
     990<!--l. 1314--><p class="noindent"><span class="paragraphHead"><a
     991 id="x1-54000A.6"></a><span
    1084992class="cmbx-10">nlp</span><span
    1085993class="cmbx-10">_solves</span><span
    1086994class="cmbx-10">_per</span><span
    1087 class="cmbx-10">_depth:</span></span>
    1088    Set average number of nodes in the tree at which NLP relaxations are solved in
    1089 B-Hyb for each depth. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1090 class="newline" />The valid range for this real option is 0 <span
     995class="cmbx-10">_depth:</span></span> Set average number of nodes in the tree at which NLP
     996relaxations are solved in B-Hyb for each depth.
     997<br class="newline" />The valid range for this real option is 0 <span
    1091998class="cmsy-10">&#x2264;</span> <span
    1092999class="cmmi-10">nlp</span>_<span
     
    11021009 id="subsection.A.7"></a>
    11031010   <h4 class="subsectionHead"><span class="titlemark">A.7   </span> <a
    1104  id="x1-54000A.7"></a>Options for MILP solver</h4>
    1105 <!--l. 1347--><p class="noindent" ><a id="sec:Options_for_MILP_solver"></a> <a id="sec:cpx_parallel_strategy"></a>
    1106 <a
    1107  id="section*.48"></a>
    1108 <!--l. 1349--><p class="noindent" ><span class="paragraphHead"><a
    1109  id="x1-55000A.7"></a><span
     1011 id="x1-55000A.7"></a>Options for MILP solver</h4>
     1012<!--l. 1322--><p class="noindent"><a id="sec:Options_for_MILP_solver"></a>
     1013
     1014<a
     1015 id="section*.49"></a>
     1016<!--l. 1323--><p class="noindent"><span class="paragraphHead"><a
     1017 id="x1-56000A.7"></a><span
    11101018class="cmbx-10">cpx</span><span
    11111019class="cmbx-10">_parallel</span><span
    1112 class="cmbx-10">_strategy:</span></span>
    1113    Strategy of parallel search mode in CPLEX. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1114 class="newline" />-1 = opportunistic, 0 = automatic, 1 = deterministic (refer to CPLEX documentation)
     1020class="cmbx-10">_strategy:</span></span> Strategy of parallel search mode in CPLEX.
     1021<br class="newline" />-1 = opportunistic, 0 = automatic, 1 = deterministic (refer to CPLEX documentation)
    11151022The valid range for this integer option is <span
    11161023class="cmsy-10">-</span>1 <span
     
    11211028class="cmsy-10">&#x2264; </span>1 and its
    11221029default value is 0.
    1123 <!--l. 1356--><p class="indent" >   <a id="sec:milp_log_level"></a>
    1124 
    1125 <a
    1126  id="page.15"></a>
    1127 <a
    1128  id="section*.49"></a>
    1129 <!--l. 1357--><p class="noindent" ><span class="paragraphHead"><a
    1130  id="x1-56000A.7"></a><span
     1030<a
     1031 id="section*.50"></a>
     1032<!--l. 1330--><p class="noindent"><span class="paragraphHead"><a
     1033 id="x1-57000A.7"></a><span
    11311034class="cmbx-10">milp</span><span
    11321035class="cmbx-10">_log</span><span
    1133 class="cmbx-10">_level:</span></span>
    1134    specify MILP solver log level. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1135 class="newline" />Set the level of output of the MILP subsolver in OA : 0 - none, 1 - minimal,
     1036class="cmbx-10">_level:</span></span> specify MILP solver log level.
     1037<br class="newline" />Set the level of output of the MILP subsolver in OA : 0 - none, 1 - minimal,
    113610382 - normal low, 3 - normal high The valid range for this integer option is
    113710390 <span
     
    11411043class="cmmi-10">level</span> <span
    11421044class="cmsy-10">&#x2264; </span>4 and its default value is 0.
    1143 <!--l. 1365--><p class="indent" >   <a id="sec:milp_solver"></a>
    1144 <a
    1145  id="section*.50"></a>
    1146 <!--l. 1366--><p class="noindent" ><span class="paragraphHead"><a
    1147  id="x1-57000A.7"></a><span
    1148 class="cmbx-10">milp</span><span
    1149 class="cmbx-10">_solver:</span></span>
    1150    Choose the subsolver to solve MILP sub-problems in OA decompositions. <span style="margin-left:2.77695pt" class="tmspace"></span>
    1151 <br
    1152 class="newline" />To use Cplex, a valid license is required and you should have compiled OsiCpx in
    1153 COIN-OR (see Osi documentation). The default value for this string option is
    1154 &#8221;Cbc_D&#8221;. <br
    1155 class="newline" />Possible values:
    1156      <ul class="itemize1">
    1157      <li class="itemize">Cbc_D: Coin Branch and Cut with its default
    1158      </li>
    1159      <li class="itemize">Cbc_Par: Coin Branch and Cut with passed parameters
    1160      </li>
    1161      <li class="itemize">Cplex: Ilog Cplex</li></ul>
    1162 <!--l. 1379--><p class="indent" >   <a id="sec:milp_strategy"></a>
    11631045<a
    11641046 id="section*.51"></a>
    1165 <!--l. 1380--><p class="noindent" ><span class="paragraphHead"><a
     1047<!--l. 1338--><p class="noindent"><span class="paragraphHead"><a
    11661048 id="x1-58000A.7"></a><span
    11671049class="cmbx-10">milp</span><span
    1168 class="cmbx-10">_strategy:</span></span>
    1169    Choose a strategy for MILPs. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1170 class="newline" />
    1171 <!--l. 1382--><p class="indent" >   The default value for this string option is &#8221;find_good_sol&#8221;. <br
    1172 class="newline" />Possible values:
     1050class="cmbx-10">_solver:</span></span> Choose the subsolver to solve MILP sub-problems in OA
     1051decompositions.
     1052<br class="newline" />To use Cplex, a valid license is required and you should have compiled OsiCpx in
     1053COIN-OR (see Osi documentation). The default value for this string option is
     1054&#8221;Cbc_D&#8221;.
     1055<br class="newline" />Possible values:
     1056     <ul class="itemize1">
     1057     <li class="itemize">Cbc_D: Coin Branch and Cut with its default
     1058     </li>
     1059     <li class="itemize">Cbc_Par: Coin Branch and Cut with passed parameters
     1060     </li>
     1061     <li class="itemize">Cplex: Ilog Cplex</li></ul>
     1062<a
     1063 id="section*.52"></a>
     1064<!--l. 1351--><p class="noindent"><span class="paragraphHead"><a
     1065 id="x1-59000A.7"></a><span
     1066class="cmbx-10">milp</span><span
     1067class="cmbx-10">_strategy:</span></span> Choose a strategy for MILPs.
     1068<br class="newline" />
     1069   The default value for this string option is &#8221;find_good_sol&#8221;.
     1070<br class="newline" />Possible values:
    11731071     <ul class="itemize1">
    11741072     <li class="itemize">find_good_sol: Stop sub milps when a solution improving the incumbent
     
    11761074     </li>
    11771075     <li class="itemize">solve_to_optimality: Solve MILPs to optimality</li></ul>
    1178 <!--l. 1391--><p class="indent" >   <a id="sec:number_cpx_threads"></a>
    1179 <a
    1180  id="section*.52"></a>
    1181 <!--l. 1392--><p class="noindent" ><span class="paragraphHead"><a
    1182  id="x1-59000A.7"></a><span
     1076<a
     1077 id="section*.53"></a>
     1078<!--l. 1362--><p class="noindent"><span class="paragraphHead"><a
     1079 id="x1-60000A.7"></a><span
    11831080class="cmbx-10">number</span><span
    11841081class="cmbx-10">_cpx</span><span
    1185 class="cmbx-10">_threads:</span></span>
    1186    Set number of threads to use with cplex. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1187 class="newline" />(refer to CPLEX documentation) The valid range for this integer option is
     1082class="cmbx-10">_threads:</span></span> Set number of threads to use with cplex.
     1083<br class="newline" />(refer to CPLEX documentation) The valid range for this integer option is
    118810840 <span
    11891085class="cmsy-10">&#x2264;</span> <span
     
    11941090class="cmmi-10">inf</span> and its default value is 0.
    11951091
    1196 <a
    1197  id="page.16"></a>
    11981092   <a
    11991093 id="subsection.A.8"></a>
    12001094   <h4 class="subsectionHead"><span class="titlemark">A.8   </span> <a
    1201  id="x1-60000A.8"></a>Options for OA decomposition</h4>
    1202 <!--l. 1400--><p class="noindent" ><a id="sec:Options_for_OA_decomposition"></a> <a id="sec:oa_decomposition"></a>
    1203 <a
    1204  id="section*.53"></a>
    1205 <!--l. 1402--><p class="noindent" ><span class="paragraphHead"><a
    1206  id="x1-61000A.8"></a><span
    1207 class="cmbx-10">oa</span><span
    1208 class="cmbx-10">_decomposition:</span></span>
    1209    If yes do initial OA decomposition <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1210 class="newline" />
    1211 <!--l. 1404--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    1212 class="newline" />Possible values:
    1213      <ul class="itemize1">
    1214      <li class="itemize">no:
    1215      </li>
    1216      <li class="itemize">yes:</li></ul>
    1217 <!--l. 1412--><p class="indent" >   <a id="sec:oa_log_frequency"></a>
     1095 id="x1-61000A.8"></a>Options for OA decomposition</h4>
     1096<!--l. 1370--><p class="noindent"><a id="sec:Options_for_OA_decomposition"></a>
    12181097<a
    12191098 id="section*.54"></a>
    1220 <!--l. 1413--><p class="noindent" ><span class="paragraphHead"><a
     1099<!--l. 1371--><p class="noindent"><span class="paragraphHead"><a
    12211100 id="x1-62000A.8"></a><span
    12221101class="cmbx-10">oa</span><span
     1102class="cmbx-10">_decomposition:</span></span> If yes do initial OA decomposition
     1103<br class="newline" />
     1104   The default value for this string option is &#8221;no&#8221;.
     1105<br class="newline" />Possible values:
     1106     <ul class="itemize1">
     1107     <li class="itemize">no:
     1108     </li>
     1109     <li class="itemize">yes:</li></ul>
     1110<a
     1111 id="section*.55"></a>
     1112<!--l. 1381--><p class="noindent"><span class="paragraphHead"><a
     1113 id="x1-63000A.8"></a><span
     1114class="cmbx-10">oa</span><span
    12231115class="cmbx-10">_log</span><span
    1224 class="cmbx-10">_frequency:</span></span>
    1225    display an update on lower and upper bounds in OA every n seconds <span style="margin-left:2.77695pt" class="tmspace"></span>
    1226 <br
    1227 class="newline" />The valid range for this real option is 0 <span
     1116class="cmbx-10">_frequency:</span></span> display an update on lower and upper bounds in OA every n
     1117seconds
     1118<br class="newline" />The valid range for this real option is 0 <span
    12281119class="cmmi-10">&#x003C;</span> <span
    12291120class="cmmi-10">oa</span>_<span
     
    12331124class="cmmi-10">inf</span> and its default
    12341125value is 100.
    1235 <!--l. 1419--><p class="indent" >   <a id="sec:oa_log_level"></a>
    1236 <a
    1237  id="section*.55"></a>
    1238 <!--l. 1420--><p class="noindent" ><span class="paragraphHead"><a
    1239  id="x1-63000A.8"></a><span
     1126<a
     1127 id="section*.56"></a>
     1128<!--l. 1387--><p class="noindent"><span class="paragraphHead"><a
     1129 id="x1-64000A.8"></a><span
    12401130class="cmbx-10">oa</span><span
    12411131class="cmbx-10">_log</span><span
    1242 class="cmbx-10">_level:</span></span>
    1243    specify OA iterations log level. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1244 class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
     1132class="cmbx-10">_level:</span></span> specify OA iterations log level.
     1133<br class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
    12451134The valid range for this integer option is 0 <span
    12461135class="cmsy-10">&#x2264;</span> <span
     
    12531142 id="subsection.A.9"></a>
    12541143   <h4 class="subsectionHead"><span class="titlemark">A.9   </span> <a
    1255  id="x1-64000A.9"></a>Options for ecp cuts generation</h4>
    1256 <!--l. 1429--><p class="noindent" ><a id="sec:Options_for_ecp_cuts_generation"></a> <a id="sec:ecp_abs_tol"></a>
    1257 <a
    1258  id="section*.56"></a>
    1259 <!--l. 1431--><p class="noindent" ><span class="paragraphHead"><a
    1260  id="x1-65000A.9"></a><span
     1144 id="x1-65000A.9"></a>Options for ecp cuts generation</h4>
     1145<!--l. 1396--><p class="noindent"><a id="sec:Options_for_ecp_cuts_generation"></a>
     1146<a
     1147 id="section*.57"></a>
     1148<!--l. 1397--><p class="noindent"><span class="paragraphHead"><a
     1149 id="x1-66000A.9"></a><span
    12611150class="cmbx-10">ecp</span><span
    12621151class="cmbx-10">_abs</span><span
    1263 class="cmbx-10">_tol:</span></span>
    1264    Set the absolute termination tolerance for ECP rounds. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1265 class="newline" />The valid range for this real option is 0 <span
     1152class="cmbx-10">_tol:</span></span> Set the absolute termination tolerance for ECP rounds.
     1153<br class="newline" />The valid range for this real option is 0 <span
    12661154class="cmsy-10">&#x2264;</span> <span
    12671155class="cmmi-10">ecp</span>_<span
     
    12741162class="cmsy-7">-</span><span
    12751163class="cmr-7">06</span></sup>.
    1276 <!--l. 1437--><p class="indent" >   <a id="sec:ecp_max_rounds"></a>
    1277 
    1278 <a
    1279  id="page.17"></a>
    1280 <a
    1281  id="section*.57"></a>
    1282 <!--l. 1438--><p class="noindent" ><span class="paragraphHead"><a
    1283  id="x1-66000A.9"></a><span
     1164<a
     1165 id="section*.58"></a>
     1166<!--l. 1403--><p class="noindent"><span class="paragraphHead"><a
     1167 id="x1-67000A.9"></a><span
    12841168class="cmbx-10">ecp</span><span
    12851169class="cmbx-10">_max</span><span
    1286 class="cmbx-10">_rounds:</span></span>
    1287    Set the maximal number of rounds of ECP cuts. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1288 class="newline" />The valid range for this integer option is 0 <span
     1170class="cmbx-10">_rounds:</span></span> Set the maximal number of rounds of ECP cuts.
     1171<br class="newline" />The valid range for this integer option is 0 <span
    12891172class="cmsy-10">&#x2264;</span> <span
    12901173class="cmmi-10">ecp</span>_<span
     
    12941177class="cmmi-10">inf</span> and its
    12951178default value is 5.
    1296 <!--l. 1444--><p class="indent" >   <a id="sec:ecp_probability_factor"></a>
    1297 <a
    1298  id="section*.58"></a>
    1299 <!--l. 1445--><p class="noindent" ><span class="paragraphHead"><a
    1300  id="x1-67000A.9"></a><span
     1179
     1180<a
     1181 id="section*.59"></a>
     1182<!--l. 1409--><p class="noindent"><span class="paragraphHead"><a
     1183 id="x1-68000A.9"></a><span
    13011184class="cmbx-10">ecp</span><span
    13021185class="cmbx-10">_probability</span><span
    1303 class="cmbx-10">_factor:</span></span>
    1304    Factor appearing in formula for skipping ECP cuts. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1305 class="newline" />Choosing -1 disables the skipping. The valid range for this real option is
     1186class="cmbx-10">_factor:</span></span> Factor appearing in formula for skipping ECP cuts.
     1187<br class="newline" />Choosing -1 disables the skipping. The valid range for this real option is
    13061188<span
    13071189class="cmsy-10">-</span><span
     
    13131195class="cmmi-10">&#x003C;</span> +<span
    13141196class="cmmi-10">inf</span> and its default value is 10.
    1315 <!--l. 1451--><p class="indent" >   <a id="sec:ecp_rel_tol"></a>
    1316 <a
    1317  id="section*.59"></a>
    1318 <!--l. 1452--><p class="noindent" ><span class="paragraphHead"><a
    1319  id="x1-68000A.9"></a><span
     1197<a
     1198 id="section*.60"></a>
     1199<!--l. 1415--><p class="noindent"><span class="paragraphHead"><a
     1200 id="x1-69000A.9"></a><span
    13201201class="cmbx-10">ecp</span><span
    13211202class="cmbx-10">_rel</span><span
    1322 class="cmbx-10">_tol:</span></span>
    1323    Set the relative termination tolerance for ECP rounds. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1324 class="newline" />The valid range for this real option is 0 <span
     1203class="cmbx-10">_tol:</span></span> Set the relative termination tolerance for ECP rounds.
     1204<br class="newline" />The valid range for this real option is 0 <span
    13251205class="cmsy-10">&#x2264;</span> <span
    13261206class="cmmi-10">ecp</span>_<span
     
    13301210class="cmmi-10">inf</span> and its default value is
    133112110.
    1332 <!--l. 1458--><p class="indent" >   <a id="sec:filmint_ecp_cuts"></a>
    1333 <a
    1334  id="section*.60"></a>
    1335 <!--l. 1459--><p class="noindent" ><span class="paragraphHead"><a
    1336  id="x1-69000A.9"></a><span
     1212<a
     1213 id="section*.61"></a>
     1214<!--l. 1421--><p class="noindent"><span class="paragraphHead"><a
     1215 id="x1-70000A.9"></a><span
    13371216class="cmbx-10">filmint</span><span
    13381217class="cmbx-10">_ecp</span><span
    1339 class="cmbx-10">_cuts:</span></span>
    1340    Specify the frequency (in terms of nodes) at which some a la filmint ecp cuts are
    1341 generated. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1342 class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
     1218class="cmbx-10">_cuts:</span></span> Specify the frequency (in terms of nodes) at which some a la
     1219filmint ecp cuts are generated.
     1220<br class="newline" />A frequency of 0 amounts to to never solve the NLP relaxation. The valid range for
    13431221this integer option is 0 <span
    13441222class="cmsy-10">&#x2264;</span> <span
     
    13521230 id="subsection.A.10"></a>
    13531231   <h4 class="subsectionHead"><span class="titlemark">A.10   </span> <a
    1354  id="x1-70000A.10"></a>Options for feasibility checker using OA cuts</h4>
    1355 <!--l. 1468--><p class="noindent" ><a id="sec:Options_for_feasibility_checker_using_OA_cuts"></a> <a id="sec:feas_check_cut_types"></a>
    1356 <a
    1357  id="section*.61"></a>
    1358 <!--l. 1470--><p class="noindent" ><span class="paragraphHead"><a
    1359  id="x1-71000A.10"></a><span
     1232 id="x1-71000A.10"></a>Options for feasibility checker using OA cuts</h4>
     1233<!--l. 1430--><p class="noindent"><a id="sec:Options_for_feasibility_checker_using_OA_cuts"></a>
     1234<a
     1235 id="section*.62"></a>
     1236<!--l. 1431--><p class="noindent"><span class="paragraphHead"><a
     1237 id="x1-72000A.10"></a><span
    13601238class="cmbx-10">feas</span><span
    13611239class="cmbx-10">_check</span><span
    13621240class="cmbx-10">_cut</span><span
    1363 class="cmbx-10">_types:</span></span>
    1364    Choose the type of cuts generated when an integer feasible solution is found <span style="margin-left:2.77695pt" class="tmspace"></span>
    1365 <br
    1366 class="newline" />If it seems too much memory is used should try Benders to use less The default value
    1367 for this string option is &#8221;outer-approx&#8221;. <br
    1368 class="newline" />Possible values:
     1241class="cmbx-10">_types:</span></span> Choose the type of cuts generated when an integer feasible
     1242solution is found
     1243<br class="newline" />If it seems too much memory is used should try Benders to use less The default value
     1244for this string option is &#8221;outer-approx&#8221;.
     1245<br class="newline" />Possible values:
    13691246     <ul class="itemize1">
    13701247     <li class="itemize">outer-approx: Generate a set of Outer Approximations cuts.
    13711248     </li>
    13721249     <li class="itemize">Benders: Generate a single Benders cut.</li></ul>
    1373 
    1374 <a
    1375  id="page.18"></a>
    1376 <!--l. 1481--><p class="indent" >   <a id="sec:feas_check_discard_policy"></a>
    1377 <a
    1378  id="section*.62"></a>
    1379 <!--l. 1482--><p class="noindent" ><span class="paragraphHead"><a
    1380  id="x1-72000A.10"></a><span
     1250<a
     1251 id="section*.63"></a>
     1252<!--l. 1442--><p class="noindent"><span class="paragraphHead"><a
     1253 id="x1-73000A.10"></a><span
    13811254class="cmbx-10">feas</span><span
    13821255class="cmbx-10">_check</span><span
    13831256class="cmbx-10">_discard</span><span
    1384 class="cmbx-10">_policy:</span></span>
    1385    How cuts from feasibility checker are discarded <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1386 class="newline" />Normally to avoid cycle cuts from feasibility checker should not be discarded in the
    1387 node where they are generated. However Cbc sometimes does it if no care is taken
    1388 which can lead to an infinite loop in Bonmin (usualy on simple problems). To
    1389 avoid this one can instruct Cbc to never discard a cut but if we do that
    1390 for all cuts it can lead to memory problems. The default policy here is to
    1391 detect cycles and only then impose to Cbc to keep the cut. The two other
    1392 alternative are to instruct Cbc to keep all cuts or to just ignore the problem and
    1393 hope for the best The default value for this string option is &#8221;detect-cycles&#8221;.
    1394 <br
    1395 class="newline" />Possible values:
     1257class="cmbx-10">_policy:</span></span> How cuts from feasibility checker are discarded
     1258<br class="newline" />Normally to avoid cycle cuts from feasibility checker should not be discarded in the
     1259node where they are generated. However Cbc sometimes does it if no care
     1260is taken which can lead to an infinite loop in Bonmin (usualy on simple
     1261problems). To avoid this one can instruct Cbc to never discard a cut but if we do
     1262that for all cuts it can lead to memory problems. The default policy here
     1263is to detect cycles and only then impose to Cbc to keep the cut. The two
     1264other alternative are to instruct Cbc to keep all cuts or to just ignore the
     1265
     1266problem and hope for the best The default value for this string option is
     1267&#8221;detect-cycles&#8221;.
     1268<br class="newline" />Possible values:
    13961269     <ul class="itemize1">
    13971270     <li class="itemize">detect-cycles: Detect if a cycle occurs and only in this case force not to
     
    14031276     <li class="itemize">treated-as-normal: Cuts from memory checker can be discarded as any
    14041277     other cuts (code may cycle then)</li></ul>
    1405 <!--l. 1507--><p class="indent" >   <a id="sec:generate_benders_after_so_many_oa"></a>
    1406 <a
    1407  id="section*.63"></a>
    1408 <!--l. 1508--><p class="noindent" ><span class="paragraphHead"><a
    1409  id="x1-73000A.10"></a><span
     1278<a
     1279 id="section*.64"></a>
     1280<!--l. 1467--><p class="noindent"><span class="paragraphHead"><a
     1281 id="x1-74000A.10"></a><span
    14101282class="cmbx-10">generate</span><span
    14111283class="cmbx-10">_benders</span><span
     
    14131285class="cmbx-10">_so</span><span
    14141286class="cmbx-10">_many</span><span
    1415 class="cmbx-10">_oa:</span></span>
    1416    Specify that after so many oa cuts have been generated Benders cuts should be
    1417 generated instead. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1418 class="newline" />It seems that sometimes generating too many oa cuts slows down the optimization
     1287class="cmbx-10">_oa:</span></span> Specify that after so many oa cuts have
     1288been generated Benders cuts should be generated instead.
     1289<br class="newline" />It seems that sometimes generating too many oa cuts slows down the optimization
    14191290compared to Benders due to the size of the LP. With this option we specify that after
    14201291so many OA cuts have been generated we should switch to Benders cuts. The valid
     
    14331304 id="subsection.A.11"></a>
    14341305   <h4 class="subsectionHead"><span class="titlemark">A.11   </span> <a
    1435  id="x1-74000A.11"></a>Options for feasibility pump</h4>
    1436 <!--l. 1520--><p class="noindent" ><a id="sec:Options_for_feasibility_pump"></a> <a id="sec:fp_log_frequency"></a>
    1437 
    1438 <a
    1439  id="page.19"></a>
    1440 <a
    1441  id="section*.64"></a>
    1442 <!--l. 1522--><p class="noindent" ><span class="paragraphHead"><a
    1443  id="x1-75000A.11"></a><span
     1306 id="x1-75000A.11"></a>Options for feasibility pump</h4>
     1307<!--l. 1479--><p class="noindent"><a id="sec:Options_for_feasibility_pump"></a>
     1308<a
     1309 id="section*.65"></a>
     1310<!--l. 1480--><p class="noindent"><span class="paragraphHead"><a
     1311 id="x1-76000A.11"></a><span
    14441312class="cmbx-10">fp</span><span
    14451313class="cmbx-10">_log</span><span
    1446 class="cmbx-10">_frequency:</span></span>
    1447    display an update on lower and upper bounds in FP every n seconds <span style="margin-left:2.77695pt" class="tmspace"></span>
    1448 <br
    1449 class="newline" />The valid range for this real option is 0 <span
     1314class="cmbx-10">_frequency:</span></span> display an update on lower and upper bounds in FP every n
     1315seconds
     1316<br class="newline" />The valid range for this real option is 0 <span
    14501317class="cmmi-10">&#x003C;</span> <span
    14511318class="cmmi-10">fp</span>_<span
     
    14551322class="cmmi-10">inf</span> and its default
    14561323value is 100.
    1457 <!--l. 1528--><p class="indent" >   <a id="sec:fp_log_level"></a>
    1458 <a
    1459  id="section*.65"></a>
    1460 <!--l. 1529--><p class="noindent" ><span class="paragraphHead"><a
    1461  id="x1-76000A.11"></a><span
     1324<a
     1325 id="section*.66"></a>
     1326<!--l. 1486--><p class="noindent"><span class="paragraphHead"><a
     1327 id="x1-77000A.11"></a><span
    14621328class="cmbx-10">fp</span><span
    14631329class="cmbx-10">_log</span><span
    1464 class="cmbx-10">_level:</span></span>
    1465    specify FP iterations log level. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1466 class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
     1330class="cmbx-10">_level:</span></span> specify FP iterations log level.
     1331<br class="newline" />Set the level of output of OA decomposition solver : 0 - none, 1 - normal, 2 - verbose
    14671332The valid range for this integer option is 0 <span
    14681333class="cmsy-10">&#x2264;</span> <span
     
    14721337class="cmsy-10">&#x2264; </span>2 and its default value is
    147313381.
    1474 <!--l. 1536--><p class="indent" >   <a id="sec:fp_pass_infeasible"></a>
    1475 <a
    1476  id="section*.66"></a>
    1477 <!--l. 1537--><p class="noindent" ><span class="paragraphHead"><a
    1478  id="x1-77000A.11"></a><span
     1339<a
     1340 id="section*.67"></a>
     1341<!--l. 1493--><p class="noindent"><span class="paragraphHead"><a
     1342 id="x1-78000A.11"></a><span
    14791343class="cmbx-10">fp</span><span
    14801344class="cmbx-10">_pass</span><span
    1481 class="cmbx-10">_infeasible:</span></span>
    1482    Say whether feasibility pump should claim to converge or not <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1483 class="newline" />
    1484 <!--l. 1539--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    1485 class="newline" />Possible values:
     1345class="cmbx-10">_infeasible:</span></span> Say whether feasibility pump should claim to converge or not
     1346<br class="newline" />
     1347
     1348   The default value for this string option is &#8221;no&#8221;.
     1349<br class="newline" />Possible values:
    14861350     <ul class="itemize1">
    14871351     <li class="itemize">no: When master MILP is infeasible just bail out (don&#8217;t stop all algorithm).
     
    14921356 id="subsection.A.12"></a>
    14931357   <h4 class="subsectionHead"><span class="titlemark">A.12   </span> <a
    1494  id="x1-78000A.12"></a>Options for non-convex problems</h4>
    1495 <!--l. 1551--><p class="noindent" ><a id="sec:Options_for_non-convex_problems"></a> <a id="sec:coeff_var_threshold"></a>
    1496 <a
    1497  id="section*.67"></a>
    1498 <!--l. 1553--><p class="noindent" ><span class="paragraphHead"><a
    1499  id="x1-79000A.12"></a><span
     1358 id="x1-79000A.12"></a>Options for non-convex problems</h4>
     1359<!--l. 1507--><p class="noindent"><a id="sec:Options_for_non-convex_problems"></a>
     1360<a
     1361 id="section*.68"></a>
     1362<!--l. 1508--><p class="noindent"><span class="paragraphHead"><a
     1363 id="x1-80000A.12"></a><span
    15001364class="cmbx-10">coeff</span><span
    15011365class="cmbx-10">_var</span><span
    1502 class="cmbx-10">_threshold:</span></span>
    1503    Coefficient of variation threshold (for dynamic definition of cutoff_decr). <span style="margin-left:2.77695pt" class="tmspace"></span>
    1504 <br
    1505 class="newline" />The valid range for this real option is 0 <span
     1366class="cmbx-10">_threshold:</span></span> Coefficient of variation threshold (for dynamic definition of
     1367cutoff_decr).
     1368<br class="newline" />The valid range for this real option is 0 <span
    15061369class="cmsy-10">&#x2264;</span> <span
    15071370class="cmmi-10">coeff</span>_<span
     
    15121375default value is 0<span
    15131376class="cmmi-10">.</span>1.
    1514 <!--l. 1559--><p class="indent" >   <a id="sec:dynamic_def_cutoff_decr"></a>
    1515 
    1516 <a
    1517  id="page.20"></a>
    1518 <a
    1519  id="section*.68"></a>
    1520 <!--l. 1560--><p class="noindent" ><span class="paragraphHead"><a
    1521  id="x1-80000A.12"></a><span
     1377<a
     1378 id="section*.69"></a>
     1379<!--l. 1514--><p class="noindent"><span class="paragraphHead"><a
     1380 id="x1-81000A.12"></a><span
    15221381class="cmbx-10">dynamic</span><span
    15231382class="cmbx-10">_def</span><span
    15241383class="cmbx-10">_cutoff</span><span
    1525 class="cmbx-10">_decr:</span></span>
    1526    Do you want to define the parameter cutoff_decr dynamically? <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1527 class="newline" />
    1528 <!--l. 1562--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    1529 class="newline" />Possible values:
     1384class="cmbx-10">_decr:</span></span> Do you want to define the parameter cutoff_decr
     1385dynamically?
     1386<br class="newline" />
     1387   The default value for this string option is &#8221;no&#8221;.
     1388<br class="newline" />Possible values:
    15301389     <ul class="itemize1">
    15311390     <li class="itemize">no: No, define it statically
    15321391     </li>
    15331392     <li class="itemize">yes: Yes, define it dynamically</li></ul>
    1534 <!--l. 1570--><p class="indent" >   <a id="sec:first_perc_for_cutoff_decr"></a>
    1535 <a
    1536  id="section*.69"></a>
    1537 <!--l. 1571--><p class="noindent" ><span class="paragraphHead"><a
    1538  id="x1-81000A.12"></a><span
     1393<a
     1394 id="section*.70"></a>
     1395<!--l. 1524--><p class="noindent"><span class="paragraphHead"><a
     1396 id="x1-82000A.12"></a><span
    15391397class="cmbx-10">first</span><span
    15401398class="cmbx-10">_perc</span><span
    15411399class="cmbx-10">_for</span><span
    15421400class="cmbx-10">_cutoff</span><span
    1543 class="cmbx-10">_decr:</span></span>
    1544    The percentage used when, the coeff of variance is smaller than the threshold, to
    1545 compute the cutoff_decr dynamically. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1546 class="newline" />The valid range for this real option is <span
     1401class="cmbx-10">_decr:</span></span> The percentage used when, the coeff of variance is
     1402smaller than the threshold, to compute the cutoff_decr dynamically.
     1403<br class="newline" />The valid range for this real option is <span
    15471404class="cmsy-10">-</span><span
    15481405class="cmmi-10">inf</span> <span
     
    15581415class="cmsy-10">-</span>0<span
    15591416class="cmmi-10">.</span>02.
    1560 <!--l. 1577--><p class="indent" >   <a id="sec:max_consecutive_infeasible"></a>
    1561 <a
    1562  id="section*.70"></a>
    1563 <!--l. 1578--><p class="noindent" ><span class="paragraphHead"><a
    1564  id="x1-82000A.12"></a><span
     1417<a
     1418 id="section*.71"></a>
     1419<!--l. 1530--><p class="noindent"><span class="paragraphHead"><a
     1420 id="x1-83000A.12"></a><span
    15651421class="cmbx-10">max</span><span
    15661422class="cmbx-10">_consecutive</span><span
    1567 class="cmbx-10">_infeasible:</span></span>
    1568    Number of consecutive infeasible subproblems before aborting a branch. <span style="margin-left:2.77695pt" class="tmspace"></span>
    1569 <br
    1570 class="newline" />Will continue exploring a branch of the tree until &#8221;max_consecutive_infeasible&#8221;consecutive
     1423class="cmbx-10">_infeasible:</span></span> Number of consecutive infeasible subproblems before
     1424aborting a branch.
     1425<br class="newline" />Will continue exploring a branch of the tree until &#8221;max_consecutive_infeasible&#8221;consecutive
    15711426problems are infeasibles by the NLP sub-solver. The valid range for this integer
    15721427option is 0 <span
     
    15781433class="cmmi-10">inf</span> and its default value is
    157914340.
    1580 <!--l. 1586--><p class="indent" >   <a id="sec:num_resolve_at_infeasibles"></a>
    1581 <a
    1582  id="section*.71"></a>
    1583 <!--l. 1587--><p class="noindent" ><span class="paragraphHead"><a
    1584  id="x1-83000A.12"></a><span
     1435
     1436<a
     1437 id="section*.72"></a>
     1438<!--l. 1538--><p class="noindent"><span class="paragraphHead"><a
     1439 id="x1-84000A.12"></a><span
    15851440class="cmbx-10">num</span><span
    15861441class="cmbx-10">_resolve</span><span
    15871442class="cmbx-10">_at</span><span
    1588 class="cmbx-10">_infeasibles:</span></span>
    1589    Number <span
    1590 class="cmmi-10">k </span>of tries to resolve an infeasible node (other than the root) of the tree
    1591 with different starting point. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1592 class="newline" />The algorithm will solve all the infeasible nodes with <span
     1443class="cmbx-10">_infeasibles:</span></span> Number <span
     1444class="cmmi-10">k </span>of tries to resolve an infeasible node
     1445(other than the root) of the tree with different starting point.
     1446<br class="newline" />The algorithm will solve all the infeasible nodes with <span
    15931447class="cmmi-10">k </span>different random starting
    15941448points and will keep the best local optimum found. The valid range for this integer
     
    16021456class="cmmi-10">inf</span> and its default value is
    160314570.
    1604 <!--l. 1595--><p class="indent" >   <a id="sec:num_resolve_at_node"></a>
    1605 
    1606 <a
    1607  id="page.21"></a>
    1608 <a
    1609  id="section*.72"></a>
    1610 <!--l. 1596--><p class="noindent" ><span class="paragraphHead"><a
    1611  id="x1-84000A.12"></a><span
     1458<a
     1459 id="section*.73"></a>
     1460<!--l. 1546--><p class="noindent"><span class="paragraphHead"><a
     1461 id="x1-85000A.12"></a><span
    16121462class="cmbx-10">num</span><span
    16131463class="cmbx-10">_resolve</span><span
    16141464class="cmbx-10">_at</span><span
    1615 class="cmbx-10">_node:</span></span>
    1616    Number <span
    1617 class="cmmi-10">k </span>of tries to resolve a node (other than the root) of the tree with different
    1618 starting point. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1619 class="newline" />The algorithm will solve all the nodes with <span
     1465class="cmbx-10">_node:</span></span> Number <span
     1466class="cmmi-10">k </span>of tries to resolve a node (other than the root)
     1467of the tree with different starting point.
     1468<br class="newline" />The algorithm will solve all the nodes with <span
    16201469class="cmmi-10">k </span>different random starting points and
    16211470will keep the best local optimum found. The valid range for this integer option is
     
    16281477class="cmmi-10">&#x003C;</span> +<span
    16291478class="cmmi-10">inf</span> and its default value is 0.
    1630 <!--l. 1604--><p class="indent" >   <a id="sec:num_resolve_at_root"></a>
    1631 <a
    1632  id="section*.73"></a>
    1633 <!--l. 1605--><p class="noindent" ><span class="paragraphHead"><a
    1634  id="x1-85000A.12"></a><span
     1479<a
     1480 id="section*.74"></a>
     1481<!--l. 1554--><p class="noindent"><span class="paragraphHead"><a
     1482 id="x1-86000A.12"></a><span
    16351483class="cmbx-10">num</span><span
    16361484class="cmbx-10">_resolve</span><span
    16371485class="cmbx-10">_at</span><span
    1638 class="cmbx-10">_root:</span></span>
    1639    Number <span
    1640 class="cmmi-10">k </span>of tries to resolve the root node with different starting points. <span style="margin-left:2.77695pt" class="tmspace"></span>
    1641 <br
    1642 class="newline" />The algorithm will solve the root node with <span
     1486class="cmbx-10">_root:</span></span> Number <span
     1487class="cmmi-10">k </span>of tries to resolve the root node with different
     1488starting points.
     1489<br class="newline" />The algorithm will solve the root node with <span
    16431490class="cmmi-10">k </span>random starting points and will keep
    16441491the best local optimum found. The valid range for this integer option is
     
    16511498class="cmmi-10">&#x003C;</span> +<span
    16521499class="cmmi-10">inf</span> and its default value is 0.
    1653 <!--l. 1613--><p class="indent" >   <a id="sec:second_perc_for_cutoff_decr"></a>
    1654 <a
    1655  id="section*.74"></a>
    1656 <!--l. 1614--><p class="noindent" ><span class="paragraphHead"><a
    1657  id="x1-86000A.12"></a><span
     1500<a
     1501 id="section*.75"></a>
     1502<!--l. 1562--><p class="noindent"><span class="paragraphHead"><a
     1503 id="x1-87000A.12"></a><span
    16581504class="cmbx-10">second</span><span
    16591505class="cmbx-10">_perc</span><span
    16601506class="cmbx-10">_for</span><span
    16611507class="cmbx-10">_cutoff</span><span
    1662 class="cmbx-10">_decr:</span></span>
    1663    The percentage used when, the coeff of variance is greater than the threshold, to
    1664 compute the cutoff_decr dynamically. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1665 class="newline" />The valid range for this real option is <span
     1508class="cmbx-10">_decr:</span></span> The percentage used when, the coeff of
     1509variance is greater than the threshold, to compute the cutoff_decr dynamically.
     1510<br class="newline" />The valid range for this real option is <span
    16661511class="cmsy-10">-</span><span
    16671512class="cmmi-10">inf</span> <span
     
    16801525 id="subsection.A.13"></a>
    16811526   <h4 class="subsectionHead"><span class="titlemark">A.13   </span> <a
    1682  id="x1-87000A.13"></a>Outer Approximation cuts generation</h4>
    1683 <!--l. 1622--><p class="noindent" ><a id="sec:Outer_Approximation_cuts_generation"></a> <a id="sec:add_only_violated_oa"></a>
    1684 <a
    1685  id="section*.75"></a>
    1686 <!--l. 1624--><p class="noindent" ><span class="paragraphHead"><a
    1687  id="x1-88000A.13"></a><span
     1527 id="x1-88000A.13"></a>Outer Approximation cuts generation</h4>
     1528<!--l. 1570--><p class="noindent"><a id="sec:Outer_Approximation_cuts_generation"></a>
     1529<a
     1530 id="section*.76"></a>
     1531<!--l. 1571--><p class="noindent"><span class="paragraphHead"><a
     1532 id="x1-89000A.13"></a><span
    16881533class="cmbx-10">add</span><span
    16891534class="cmbx-10">_only</span><span
    16901535class="cmbx-10">_violated</span><span
    1691 class="cmbx-10">_oa:</span></span>
    1692    Do we add all OA cuts or only the ones violated by current point? <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1693 class="newline" />
    1694 <!--l. 1626--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    1695 class="newline" />Possible values:
     1536class="cmbx-10">_oa:</span></span> Do we add all OA cuts or only the ones violated by current
     1537point?
     1538<br class="newline" />
     1539   The default value for this string option is &#8221;no&#8221;.
     1540<br class="newline" />Possible values:
    16961541     <ul class="itemize1">
    16971542     <li class="itemize">no: Add all cuts
    16981543     </li>
    16991544     <li class="itemize">yes: Add only violated Cuts</li></ul>
    1700 <!--l. 1634--><p class="indent" >   <a id="sec:oa_cuts_log_level"></a>
    1701 
    1702 <a
    1703  id="page.22"></a>
    1704 <a
    1705  id="section*.76"></a>
    1706 <!--l. 1635--><p class="noindent" ><span class="paragraphHead"><a
    1707  id="x1-89000A.13"></a><span
     1545
     1546<a
     1547 id="section*.77"></a>
     1548<!--l. 1581--><p class="noindent"><span class="paragraphHead"><a
     1549 id="x1-90000A.13"></a><span
    17081550class="cmbx-10">oa</span><span
    17091551class="cmbx-10">_cuts</span><span
    17101552class="cmbx-10">_log</span><span
    1711 class="cmbx-10">_level:</span></span>
    1712    level of log when generating OA cuts. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1713 class="newline" />0: outputs nothing, 1: when a cut is generated, its violation and index of row
     1553class="cmbx-10">_level:</span></span> level of log when generating OA cuts.
     1554<br class="newline" />0: outputs nothing, 1: when a cut is generated, its violation and index of row
    17141555from which it originates, 2: always output violation of the cut. 3: output
    17151556generated cuts incidence vectors. The valid range for this integer option is
     
    17221563class="cmmi-10">&#x003C;</span> +<span
    17231564class="cmmi-10">inf</span> and its default value is 0.
    1724 <!--l. 1647--><p class="indent" >   <a id="sec:oa_cuts_scope"></a>
    1725 <a
    1726  id="section*.77"></a>
    1727 <!--l. 1648--><p class="noindent" ><span class="paragraphHead"><a
    1728  id="x1-90000A.13"></a><span
     1565<a
     1566 id="section*.78"></a>
     1567<!--l. 1593--><p class="noindent"><span class="paragraphHead"><a
     1568 id="x1-91000A.13"></a><span
    17291569class="cmbx-10">oa</span><span
    17301570class="cmbx-10">_cuts</span><span
    1731 class="cmbx-10">_scope:</span></span>
    1732    Specify if OA cuts added are to be set globally or locally valid <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1733 class="newline" />
    1734 <!--l. 1650--><p class="indent" >   The default value for this string option is &#8221;global&#8221;. <br
    1735 class="newline" />Possible values:
     1571class="cmbx-10">_scope:</span></span> Specify if OA cuts added are to be set globally or locally valid
     1572<br class="newline" />
     1573   The default value for this string option is &#8221;global&#8221;.
     1574<br class="newline" />Possible values:
    17361575     <ul class="itemize1">
    17371576     <li class="itemize">local: Cuts are treated as locally valid
    17381577     </li>
    17391578     <li class="itemize">global: Cuts are treated as globally valid</li></ul>
    1740 <!--l. 1658--><p class="indent" >   <a id="sec:tiny_element"></a>
    1741 <a
    1742  id="section*.78"></a>
    1743 <!--l. 1659--><p class="noindent" ><span class="paragraphHead"><a
    1744  id="x1-91000A.13"></a><span
    1745 class="cmbx-10">tiny</span><span
    1746 class="cmbx-10">_element:</span></span>
    1747    Value for tiny element in OA cut <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1748 class="newline" />We will remove &#8221;cleanly&#8221; (by relaxing cut) an element lower than this. The valid
    1749 range for this real option is <span
     1579<a
     1580 id="section*.79"></a>
     1581<!--l. 1603--><p class="noindent"><span class="paragraphHead"><a
     1582 id="x1-92000A.13"></a><span
     1583class="cmbx-10">oa</span><span
     1584class="cmbx-10">_rhs</span><span
     1585class="cmbx-10">_relax:</span></span> Value by which to relax OA cut
     1586<br class="newline" />RHS of OA constraints will be relaxed by this amount times the absolute value
     1587of the initial rhs if it is ¿= 1 (otherwise by this amount). The valid range
     1588for this real option is <span
    17501589class="cmsy-10">-</span>0 <span
    17511590class="cmsy-10">&#x2264;</span> <span
    1752 class="cmmi-10">tiny</span>_<span
    1753 class="cmmi-10">element</span> <span
     1591class="cmmi-10">oa</span>_<span
     1592class="cmmi-10">rhs</span>_<span
     1593class="cmmi-10">relax</span> <span
    17541594class="cmmi-10">&#x003C;</span> +<span
    17551595class="cmmi-10">inf</span> and its default value is
     
    17581598class="cmsy-7">-</span><span
    17591599class="cmr-7">08</span></sup>.
    1760 <!--l. 1666--><p class="indent" >   <a id="sec:very_tiny_element"></a>
    1761 <a
    1762  id="section*.79"></a>
    1763 <!--l. 1667--><p class="noindent" ><span class="paragraphHead"><a
    1764  id="x1-92000A.13"></a><span
     1600<a
     1601 id="section*.80"></a>
     1602<!--l. 1611--><p class="noindent"><span class="paragraphHead"><a
     1603 id="x1-93000A.13"></a><span
     1604class="cmbx-10">tiny</span><span
     1605class="cmbx-10">_element:</span></span> Value for tiny element in OA cut
     1606<br class="newline" />We will remove &#8221;cleanly&#8221; (by relaxing cut) an element lower than this. The valid
     1607range for this real option is <span
     1608class="cmsy-10">-</span>0 <span
     1609class="cmsy-10">&#x2264;</span> <span
     1610class="cmmi-10">tiny</span>_<span
     1611class="cmmi-10">element</span> <span
     1612class="cmmi-10">&#x003C;</span> +<span
     1613class="cmmi-10">inf</span> and its default value is
     16141 <span
     1615class="cmsy-10">&#x22C5; </span>10<sup><span
     1616class="cmsy-7">-</span><span
     1617class="cmr-7">08</span></sup>.
     1618<a
     1619 id="section*.81"></a>
     1620<!--l. 1618--><p class="noindent"><span class="paragraphHead"><a
     1621 id="x1-94000A.13"></a><span
    17651622class="cmbx-10">very</span><span
    17661623class="cmbx-10">_tiny</span><span
    1767 class="cmbx-10">_element:</span></span>
    1768    Value for very tiny element in OA cut <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1769 class="newline" />Algorithm will take the risk of neglecting an element lower than this. The valid range
     1624class="cmbx-10">_element:</span></span> Value for very tiny element in OA cut
     1625<br class="newline" />Algorithm will take the risk of neglecting an element lower than this. The valid range
    17701626for this real option is <span
    17711627class="cmsy-10">-</span>0 <span
     
    17831639 id="subsection.A.14"></a>
    17841640   <h4 class="subsectionHead"><span class="titlemark">A.14   </span> <a
    1785  id="x1-93000A.14"></a>Output and log-level options</h4>
    1786 <!--l. 1676--><p class="noindent" ><a id="sec:Output_and_log-level_options"></a> <a id="sec:bb_log_interval"></a>
    1787 
    1788 <a
    1789  id="page.23"></a>
    1790 <a
    1791  id="section*.80"></a>
    1792 <!--l. 1678--><p class="noindent" ><span class="paragraphHead"><a
    1793  id="x1-94000A.14"></a><span
     1641 id="x1-95000A.14"></a>Output and log-level options</h4>
     1642<!--l. 1627--><p class="noindent"><a id="sec:Output_and_log-level_options"></a>
     1643
     1644<a
     1645 id="section*.82"></a>
     1646<!--l. 1628--><p class="noindent"><span class="paragraphHead"><a
     1647 id="x1-96000A.14"></a><span
    17941648class="cmbx-10">bb</span><span
    17951649class="cmbx-10">_log</span><span
    1796 class="cmbx-10">_interval:</span></span>
    1797    Interval at which node level output is printed. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1798 class="newline" />Set the interval (in terms of number of nodes) at which a log on node resolutions
     1650class="cmbx-10">_interval:</span></span> Interval at which node level output is printed.
     1651<br class="newline" />Set the interval (in terms of number of nodes) at which a log on node resolutions
    17991652(consisting of lower and upper bounds) is given. The valid range for this integer
    18001653option is 0 <span
     
    18051658class="cmmi-10">&#x003C;</span> +<span
    18061659class="cmmi-10">inf</span> and its default value is 100.
    1807 <!--l. 1686--><p class="indent" >   <a id="sec:bb_log_level"></a>
    1808 <a
    1809  id="section*.81"></a>
    1810 <!--l. 1687--><p class="noindent" ><span class="paragraphHead"><a
    1811  id="x1-95000A.14"></a><span
     1660<a
     1661 id="section*.83"></a>
     1662<!--l. 1636--><p class="noindent"><span class="paragraphHead"><a
     1663 id="x1-97000A.14"></a><span
    18121664class="cmbx-10">bb</span><span
    18131665class="cmbx-10">_log</span><span
    1814 class="cmbx-10">_level:</span></span>
    1815    specify main branch-and-bound log level. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1816 class="newline" />Set the level of output of the branch-and-bound : 0 - none, 1 - minimal, 2 - normal
     1666class="cmbx-10">_level:</span></span> specify main branch-and-bound log level.
     1667<br class="newline" />Set the level of output of the branch-and-bound : 0 - none, 1 - minimal, 2 - normal
    18171668low, 3 - normal high The valid range for this integer option is 0 <span
    18181669class="cmsy-10">&#x2264;</span> <span
     
    18221673class="cmsy-10">&#x2264; </span>5
    18231674and its default value is 1.
    1824 <!--l. 1695--><p class="indent" >   <a id="sec:lp_log_level"></a>
    1825 <a
    1826  id="section*.82"></a>
    1827 <!--l. 1696--><p class="noindent" ><span class="paragraphHead"><a
    1828  id="x1-96000A.14"></a><span
     1675<a
     1676 id="section*.84"></a>
     1677<!--l. 1644--><p class="noindent"><span class="paragraphHead"><a
     1678 id="x1-98000A.14"></a><span
    18291679class="cmbx-10">lp</span><span
    18301680class="cmbx-10">_log</span><span
    1831 class="cmbx-10">_level:</span></span>
    1832    specify LP log level. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1833 class="newline" />Set the level of output of the linear programming sub-solver in B-Hyb or B-QG : 0 -
     1681class="cmbx-10">_level:</span></span> specify LP log level.
     1682<br class="newline" />Set the level of output of the linear programming sub-solver in B-Hyb or B-QG : 0 -
    18341683none, 1 - minimal, 2 - normal low, 3 - normal high, 4 - verbose The valid
    18351684range for this integer option is 0 <span
     
    18401689class="cmsy-10">&#x2264; </span>4 and its default value is
    184116900.
    1842 <!--l. 1705--><p class="indent" >   <a id="sec:nlp_log_at_root"></a>
    1843 <a
    1844  id="section*.83"></a>
    1845 <!--l. 1706--><p class="noindent" ><span class="paragraphHead"><a
    1846  id="x1-97000A.14"></a><span
     1691<a
     1692 id="section*.85"></a>
     1693<!--l. 1653--><p class="noindent"><span class="paragraphHead"><a
     1694 id="x1-99000A.14"></a><span
    18471695class="cmbx-10">nlp</span><span
    18481696class="cmbx-10">_log</span><span
    18491697class="cmbx-10">_at</span><span
    1850 class="cmbx-10">_root:</span></span>
    1851    Specify a different log level for root relaxtion. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1852 class="newline" />The valid range for this integer option is 0 <span
     1698class="cmbx-10">_root:</span></span> Specify a different log level for root relaxtion.
     1699<br class="newline" />The valid range for this integer option is 0 <span
    18531700class="cmsy-10">&#x2264;</span> <span
    18541701class="cmmi-10">nlp</span>_<span
     
    18611708 id="subsection.A.15"></a>
    18621709   <h4 class="subsectionHead"><span class="titlemark">A.15   </span> <a
    1863  id="x1-98000A.15"></a>Strong branching setup</h4>
    1864 <!--l. 1714--><p class="noindent" ><a id="sec:Strong_branching_setup"></a> <a id="sec:candidate_sort_criterion"></a>
    1865 <a
    1866  id="section*.84"></a>
    1867 <!--l. 1716--><p class="noindent" ><span class="paragraphHead"><a
    1868  id="x1-99000A.15"></a><span
     1710 id="x1-100000A.15"></a>Strong branching setup</h4>
     1711<!--l. 1661--><p class="noindent"><a id="sec:Strong_branching_setup"></a>
     1712<a
     1713 id="section*.86"></a>
     1714<!--l. 1662--><p class="noindent"><span class="paragraphHead"><a
     1715 id="x1-101000A.15"></a><span
    18691716class="cmbx-10">candidate</span><span
    18701717class="cmbx-10">_sort</span><span
    1871 class="cmbx-10">_criterion:</span></span>
    1872    Choice of the criterion to choose candidates in strong-branching <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1873 class="newline" />
    1874 <!--l. 1718--><p class="indent" >   The default value for this string option is &#8221;best-ps-cost&#8221;. <br
    1875 class="newline" />Possible values:
     1718class="cmbx-10">_criterion:</span></span> Choice of the criterion to choose candidates in
     1719strong-branching
     1720<br class="newline" />
     1721   The default value for this string option is &#8221;best-ps-cost&#8221;.
     1722<br class="newline" />Possible values:
    18761723     <ul class="itemize1">
    18771724     <li class="itemize">best-ps-cost: Sort by decreasing pseudo-cost
    1878 
    1879 <a
    1880  id="page.24"></a>
    18811725     </li>
    18821726     <li class="itemize">worst-ps-cost: Sort by increasing pseudo-cost
     
    18851729     </li>
    18861730     <li class="itemize">least-fractional: Sort by increasing integer infeasibility</li></ul>
    1887 <!--l. 1728--><p class="indent" >   <a id="sec:maxmin_crit_have_sol"></a>
    1888 <a
    1889  id="section*.85"></a>
    1890 <!--l. 1729--><p class="noindent" ><span class="paragraphHead"><a
    1891  id="x1-100000A.15"></a><span
     1731
     1732<a
     1733 id="section*.87"></a>
     1734<!--l. 1674--><p class="noindent"><span class="paragraphHead"><a
     1735 id="x1-102000A.15"></a><span
    18921736class="cmbx-10">maxmin</span><span
    18931737class="cmbx-10">_crit</span><span
    18941738class="cmbx-10">_have</span><span
    1895 class="cmbx-10">_sol:</span></span>
    1896    Weight towards minimum in of lower and upper branching estimates when a
    1897 solution has been found. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1898 class="newline" />The valid range for this real option is 0 <span
     1739class="cmbx-10">_sol:</span></span> Weight towards minimum in of lower and upper branching
     1740estimates when a solution has been found.
     1741<br class="newline" />The valid range for this real option is 0 <span
    18991742class="cmsy-10">&#x2264;</span> <span
    19001743class="cmmi-10">maxmin</span>_<span
     
    19051748value is 0<span
    19061749class="cmmi-10">.</span>1.
    1907 <!--l. 1735--><p class="indent" >   <a id="sec:maxmin_crit_no_sol"></a>
    1908 <a
    1909  id="section*.86"></a>
    1910 <!--l. 1736--><p class="noindent" ><span class="paragraphHead"><a
    1911  id="x1-101000A.15"></a><span
     1750<a
     1751 id="section*.88"></a>
     1752<!--l. 1680--><p class="noindent"><span class="paragraphHead"><a
     1753 id="x1-103000A.15"></a><span
    19121754class="cmbx-10">maxmin</span><span
    19131755class="cmbx-10">_crit</span><span
    19141756class="cmbx-10">_no</span><span
    1915 class="cmbx-10">_sol:</span></span>
    1916    Weight towards minimum in of lower and upper branching estimates when no
    1917 solution has been found yet. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1918 class="newline" />The valid range for this real option is 0 <span
     1757class="cmbx-10">_sol:</span></span> Weight towards minimum in of lower and upper branching
     1758estimates when no solution has been found yet.
     1759<br class="newline" />The valid range for this real option is 0 <span
    19191760class="cmsy-10">&#x2264;</span> <span
    19201761class="cmmi-10">maxmin</span>_<span
     
    19251766value is 0<span
    19261767class="cmmi-10">.</span>7.
    1927 <!--l. 1742--><p class="indent" >   <a id="sec:min_number_strong_branch"></a>
    1928 <a
    1929  id="section*.87"></a>
    1930 <!--l. 1743--><p class="noindent" ><span class="paragraphHead"><a
    1931  id="x1-102000A.15"></a><span
     1768<a
     1769 id="section*.89"></a>
     1770<!--l. 1686--><p class="noindent"><span class="paragraphHead"><a
     1771 id="x1-104000A.15"></a><span
    19321772class="cmbx-10">min</span><span
    19331773class="cmbx-10">_number</span><span
    19341774class="cmbx-10">_strong</span><span
    1935 class="cmbx-10">_branch:</span></span>
    1936    Sets minimum number of variables for strong branching (overriding trust) <span style="margin-left:2.77695pt" class="tmspace"></span>
    1937 <br
    1938 class="newline" />The valid range for this integer option is 0 <span
     1775class="cmbx-10">_branch:</span></span> Sets minimum number of variables for strong
     1776branching (overriding trust)
     1777<br class="newline" />The valid range for this integer option is 0 <span
    19391778class="cmsy-10">&#x2264;</span> <span
    19401779class="cmmi-10">min</span>_<span
     
    19451784class="cmmi-10">inf</span>
    19461785and its default value is 0.
    1947 <!--l. 1749--><p class="indent" >   <a id="sec:number_before_trust_list"></a>
    1948 <a
    1949  id="section*.88"></a>
    1950 <!--l. 1750--><p class="noindent" ><span class="paragraphHead"><a
    1951  id="x1-103000A.15"></a><span
     1786<a
     1787 id="section*.90"></a>
     1788<!--l. 1692--><p class="noindent"><span class="paragraphHead"><a
     1789 id="x1-105000A.15"></a><span
    19521790class="cmbx-10">number</span><span
    19531791class="cmbx-10">_before</span><span
    19541792class="cmbx-10">_trust</span><span
    1955 class="cmbx-10">_list:</span></span>
    1956    Set the number of branches on a variable before its pseudo costs are to be
    1957 believed during setup of strong branching candidate list. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1958 class="newline" />The default value is that of &#8221;number_before_trust&#8221; The valid range for this integer
     1793class="cmbx-10">_list:</span></span> Set the number of branches on a variable before its
     1794pseudo costs are to be believed during setup of strong branching candidate list.
     1795<br class="newline" />The default value is that of &#8221;number_before_trust&#8221; The valid range for this integer
    19591796option is <span
    19601797class="cmsy-10">-</span>1 <span
     
    19671804class="cmmi-10">inf</span> and its default value is
    196818050.
    1969 <!--l. 1757--><p class="indent" >   <a id="sec:number_look_ahead"></a>
    1970 
    1971 <a
    1972  id="page.25"></a>
    1973 <a
    1974  id="section*.89"></a>
    1975 <!--l. 1758--><p class="noindent" ><span class="paragraphHead"><a
    1976  id="x1-104000A.15"></a><span
     1806<a
     1807 id="section*.91"></a>
     1808<!--l. 1699--><p class="noindent"><span class="paragraphHead"><a
     1809 id="x1-106000A.15"></a><span
    19771810class="cmbx-10">number</span><span
    19781811class="cmbx-10">_look</span><span
    1979 class="cmbx-10">_ahead:</span></span>
    1980    Sets limit of look-ahead strong-branching trials <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    1981 class="newline" />The valid range for this integer option is 0 <span
     1812class="cmbx-10">_ahead:</span></span> Sets limit of look-ahead strong-branching trials
     1813<br class="newline" />The valid range for this integer option is 0 <span
    19821814class="cmsy-10">&#x2264;</span> <span
    19831815class="cmmi-10">number</span>_<span
     
    19871819class="cmmi-10">inf</span> and its
    19881820default value is 0.
    1989 <!--l. 1764--><p class="indent" >   <a id="sec:number_strong_branch_root"></a>
    1990 <a
    1991  id="section*.90"></a>
    1992 <!--l. 1765--><p class="noindent" ><span class="paragraphHead"><a
    1993  id="x1-105000A.15"></a><span
     1821<a
     1822 id="section*.92"></a>
     1823<!--l. 1705--><p class="noindent"><span class="paragraphHead"><a
     1824 id="x1-107000A.15"></a><span
    19941825class="cmbx-10">number</span><span
    19951826class="cmbx-10">_strong</span><span
    19961827class="cmbx-10">_branch</span><span
    1997 class="cmbx-10">_root:</span></span>
    1998    Maximum number of variables considered for strong branching in root node. <span style="margin-left:2.77695pt" class="tmspace"></span>
    1999 <br
    2000 class="newline" />The valid range for this integer option is 0 <span
     1828class="cmbx-10">_root:</span></span> Maximum number of variables considered for
     1829strong branching in root node.
     1830<br class="newline" />The valid range for this integer option is 0 <span
    20011831class="cmsy-10">&#x2264;</span> <span
    20021832class="cmmi-10">number</span>_<span
     
    20071837class="cmmi-10">inf</span>
    20081838and its default value is 2147483647.
    2009 <!--l. 1771--><p class="indent" >   <a id="sec:setup_pseudo_frac"></a>
    2010 <a
    2011  id="section*.91"></a>
    2012 <!--l. 1772--><p class="noindent" ><span class="paragraphHead"><a
    2013  id="x1-106000A.15"></a><span
     1839<a
     1840 id="section*.93"></a>
     1841<!--l. 1711--><p class="noindent"><span class="paragraphHead"><a
     1842 id="x1-108000A.15"></a><span
    20141843class="cmbx-10">setup</span><span
    20151844class="cmbx-10">_pseudo</span><span
    2016 class="cmbx-10">_frac:</span></span>
    2017    Proportion of strong branching list that has to be taken from most-integer-infeasible
    2018 list. <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    2019 class="newline" />The valid range for this real option is 0 <span
     1845class="cmbx-10">_frac:</span></span> Proportion of strong branching list that has to be taken from
     1846most-integer-infeasible list.
     1847<br class="newline" />The valid range for this real option is 0 <span
    20201848class="cmsy-10">&#x2264;</span> <span
    20211849class="cmmi-10">setup</span>_<span
     
    20251853value is 0<span
    20261854class="cmmi-10">.</span>5.
    2027 <!--l. 1778--><p class="indent" >   <a id="sec:trust_strong_branching_for_pseudo_cost"></a>
    2028 <a
    2029  id="section*.92"></a>
    2030 <!--l. 1779--><p class="noindent" ><span class="paragraphHead"><a
    2031  id="x1-107000A.15"></a><span
     1855
     1856<a
     1857 id="section*.94"></a>
     1858<!--l. 1717--><p class="noindent"><span class="paragraphHead"><a
     1859 id="x1-109000A.15"></a><span
    20321860class="cmbx-10">trust</span><span
    20331861class="cmbx-10">_strong</span><span
     
    20351863class="cmbx-10">_for</span><span
    20361864class="cmbx-10">_pseudo</span><span
    2037 class="cmbx-10">_cost:</span></span>
    2038    Whether or not to trust strong branching results for updating pseudo costs. <span style="margin-left:2.77695pt" class="tmspace"></span>
    2039 <br
    2040 class="newline" />
    2041 <!--l. 1781--><p class="indent" >   The default value for this string option is &#8221;yes&#8221;. <br
    2042 class="newline" />Possible values:
     1865class="cmbx-10">_cost:</span></span> Whether or not to trust strong
     1866branching results for updating pseudo costs.
     1867<br class="newline" />
     1868   The default value for this string option is &#8221;yes&#8221;.
     1869<br class="newline" />Possible values:
    20431870     <ul class="itemize1">
    20441871     <li class="itemize">no:
     
    20481875 id="subsection.A.16"></a>
    20491876   <h4 class="subsectionHead"><span class="titlemark">A.16   </span> <a
    2050  id="x1-108000A.16"></a>nlp interface option</h4>
    2051 <!--l. 1791--><p class="noindent" ><a id="sec:nlp_interface_option"></a> <a id="sec:file_solution"></a>
    2052 <a
    2053  id="section*.93"></a>
    2054 <!--l. 1793--><p class="noindent" ><span class="paragraphHead"><a
    2055  id="x1-109000A.16"></a><span
     1877 id="x1-110000A.16"></a>nlp interface option</h4>
     1878<!--l. 1729--><p class="noindent"><a id="sec:nlp_interface_option"></a>
     1879<a
     1880 id="section*.95"></a>
     1881<!--l. 1730--><p class="noindent"><span class="paragraphHead"><a
     1882 id="x1-111000A.16"></a><span
    20561883class="cmbx-10">file</span><span
    2057 class="cmbx-10">_solution:</span></span>
    2058    Write a file bonmin.sol with the solution <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    2059 class="newline" />
    2060 
    2061 <a
    2062  id="page.26"></a>
    2063 <!--l. 1795--><p class="indent" >   The default value for this string option is &#8221;no&#8221;. <br
    2064 class="newline" />Possible values:
     1884class="cmbx-10">_solution:</span></span> Write a file bonmin.sol with the solution
     1885<br class="newline" />
     1886   The default value for this string option is &#8221;no&#8221;.
     1887<br class="newline" />Possible values:
    20651888     <ul class="itemize1">
    20661889     <li class="itemize">yes:
    20671890     </li>
    20681891     <li class="itemize">no:</li></ul>
    2069 <!--l. 1803--><p class="indent" >   <a id="sec:nlp_log_level"></a>
    2070 <a
    2071  id="section*.94"></a>
    2072 <!--l. 1804--><p class="noindent" ><span class="paragraphHead"><a
    2073  id="x1-110000A.16"></a><span
     1892<a
     1893 id="section*.96"></a>
     1894<!--l. 1740--><p class="noindent"><span class="paragraphHead"><a
     1895 id="x1-112000A.16"></a><span
    20741896class="cmbx-10">nlp</span><span
    20751897class="cmbx-10">_log</span><span
    2076 class="cmbx-10">_level:</span></span>
    2077    specify NLP solver interface log level (independent from ipopt print_level). <span style="margin-left:2.77695pt" class="tmspace"></span>
    2078 <br
    2079 class="newline" />Set the level of output of the OsiTMINLPInterface : 0 - none, 1 - normal, 2 - verbose
     1898class="cmbx-10">_level:</span></span> specify NLP solver interface log level (independent from ipopt
     1899print_level).
     1900<br class="newline" />Set the level of output of the OsiTMINLPInterface : 0 - none, 1 - normal, 2 - verbose
    20801901The valid range for this integer option is 0 <span
    20811902class="cmsy-10">&#x2264;</span> <span
     
    20851906class="cmsy-10">&#x2264; </span>2 and its default value
    20861907is 1.
    2087 <!--l. 1811--><p class="indent" >   <a id="sec:nlp_solver"></a>
    2088 <a
    2089  id="section*.95"></a>
    2090 <!--l. 1812--><p class="noindent" ><span class="paragraphHead"><a
    2091  id="x1-111000A.16"></a><span
     1908<a
     1909 id="section*.97"></a>
     1910<!--l. 1747--><p class="noindent"><span class="paragraphHead"><a
     1911 id="x1-113000A.16"></a><span
    20921912class="cmbx-10">nlp</span><span
    2093 class="cmbx-10">_solver:</span></span>
    2094    Choice of the solver for local optima of continuous nlp&#8217;s <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    2095 class="newline" />Note that option will work only if the specified solver has been installed.
    2096 Ipopt will usualy be installed with Bonmin by default. For FilterSQP please
    2097 see http://www-unix.mcs.anl.gov/&#x00A0;leyffer/solvers.html on how to obtain
    2098 it and https://projects.coin-or.org/Bonmin/wiki/HintTric- ks on how to
    2099 configure Bonmin to use it. The default value for this string option is &#8221;Ipopt&#8221;.
    2100 <br
    2101 class="newline" />Possible values:
     1913class="cmbx-10">_solver:</span></span> Choice of the solver for local optima of continuous nlp&#8217;s
     1914<br class="newline" />Note that option will work only if the specified solver has been installed. Ipopt
     1915will usualy be installed with Bonmin by default. For FilterSQP please see
     1916http://www-unix.mcs.anl.gov/&#x00A0;leyffer/solvers.html on how to obtain it and
     1917https://projects.coin-or.org/Bonmin/wiki/HintTric- ks on how to configure Bonmin
     1918to use it. The default value for this string option is &#8221;Ipopt&#8221;.
     1919<br class="newline" />Possible values:
    21021920     <ul class="itemize1">
    21031921     <li class="itemize">Ipopt: Interior Point OPTimizer (https://projects.coin-or.org/Ipopt)
     1922
    21041923     </li>
    21051924     <li class="itemize">filterSQP:  Sequential  quadratic  programming  trust  region  algorithm
     
    21071926     </li>
    21081927     <li class="itemize">all: run all available solvers at each node</li></ul>
    2109 <!--l. 1834--><p class="indent" >   <a id="sec:warm_start"></a>
    2110 <a
    2111  id="section*.96"></a>
    2112 <!--l. 1835--><p class="noindent" ><span class="paragraphHead"><a
    2113  id="x1-112000A.16"></a><span
     1928<a
     1929 id="section*.98"></a>
     1930<!--l. 1769--><p class="noindent"><span class="paragraphHead"><a
     1931 id="x1-114000A.16"></a><span
    21141932class="cmbx-10">warm</span><span
    2115 class="cmbx-10">_start:</span></span>
    2116 
    2117 <a
    2118  id="page.27"></a>
    2119    Select the warm start method <span style="margin-left:2.77695pt" class="tmspace"></span> <br
    2120 class="newline" />This will affect the function getWarmStart(), and as a consequence the warm starting
    2121 in the various algorithms. The default value for this string option is &#8221;none&#8221;.
    2122 <br
    2123 class="newline" />Possible values:
    2124      <ul class="itemize1">
    2125      <li class="itemize">none: No warm start just start NLPs from optimal solution of the root
     1933class="cmbx-10">_start:</span></span> Select the warm start method
     1934<br class="newline" />This will affect the function getWarmStart(), and as a consequence the warm
     1935starting in the various algorithms. The default value for this string option is
     1936&#8221;none&#8221;.
     1937<br class="newline" />Possible values:
     1938     <ul class="itemize1">
     1939     <li class="itemize">none: No warm start, just start NLPs from optimal solution of the root
    21261940     relaxation
    21271941     </li>
    2128      <li class="itemize">fake_basis: builds fake bases usefull for cut management in Cbc (warm
     1942     <li class="itemize">fake_basis: builds fake basis, useful for cut management in Cbc (warm
    21291943     start is the same as in none)
    21301944     </li>
  • html/options_set.html

    r1947 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 11:55:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
    1613>
    17 <!--l. 2--><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"> Setting Options  </h2>  <a href="#sec:opt&#x02D9;opt " > Passing options to
     14<!--l. 2--><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"> Setting Options  </h2>  <a href="#sec:opt&#x02D9;opt " > Passing options to
    1815<span
    1916class="cmtt-10">BONMIN </span> </a> / <a href="#sec:options&#x02D9;list " > List of options  </a> / <a href="#sec:opt&#x02D9;nonconv " > Getting good
     
    2118href="https://projects.coin-or.org/Ipopt" ><span
    2219class="cmtt-10">Ipopt</span></a>&#x00A0;options  </a> /   </div>
    23 <!--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
     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
    2421class="cmtt-10">BONMIN</span></a></h3>  Options in <span
    2522class="cmtt-10">BONMIN</span>&#x00A0;can be
    2623set in several different ways.
    27 <!--l. 15--><p class="indent" >   First, you can set options by putting them in a file called <span
     24<!--l. 15--><p class="indent">   First, you can set options by putting them in a file called <span
    2825class="cmtt-10">bonmin.opt </span>in the
    2926directory where <span
     
    4037single line. Anything on a line after a # symbol is ignored (i.e., treated as a
    4138comment).
    42 <!--l. 26--><p class="indent" >   Note that <span
     39<!--l. 26--><p class="indent">   Note that <span
    4340class="cmtt-10">BONMIN</span>&#x00A0;sets options for <span
    4441class="cmtt-10">Ipopt</span>. If you want to set options for <span
     
    5653<span
    5754class="cmtt-10">Ipopt</span></a>.
    58 <!--l. 36--><p class="indent" >   Since <span
     55<!--l. 36--><p class="indent">   Since <span
    5956class="cmtt-10">bonmin.opt </span>contains both <span
    6057class="cmtt-10">Ipopt </span>and <span
     
    6865class="cmtt-10">BONMIN</span>&#x00A0;in the outer approximation decomposition and the hybrid (see Subsection
    6966<span
    70 class="cmbx-10">??</span>).<br
    71 class="newline" />
    72 <!--l. 42--><p class="indent" >   The most important option in <span
     67class="cmbx-10">??</span>).
     68<br class="newline" />
     69<!--l. 42--><p class="indent">   The most important option in <span
    7370class="cmtt-10">BONMIN</span>&#x00A0;is the choice of the solution algorithm.
    7471This can be set by using the option named <span
     
    9693option is available for that particular algorithm while &#8216;<span
    9794class="cmsy-10">-</span>&#8217; indicates that it is
    98 not.<br
    99 class="newline" />
    100 <!--l. 57--><p class="indent" >   An example of a <span
     95not.
     96<br class="newline" />
     97<!--l. 57--><p class="indent">   An example of a <span
    10198class="cmtt-10">bonmin.opt </span>file including all the options with their default
    10299values is located in the <span
    103100class="cmtt-10">Test </span>sub-directory.
    104 <!--l. 61--><p class="indent" >   A small example is as follows:
    105 
    106 <a
    107  id="page.2"></a>
    108    <div class="verbatim" id="verbatim-1">
     101<!--l. 61--><p class="indent">   A small example is as follows:
     102
     103   <table
     104class="verbatim"><tr class="verbatim"><td
     105class="verbatim"><div class="verbatim">
    109106&#x00A0;&#x00A0;&#x00A0;bonmin.bb_log_level&#x00A0;4
    110107&#x00A0;<br />&#x00A0;&#x00A0;&#x00A0;bonmin.algorithm&#x00A0;B-BB
    111108&#x00A0;<br />&#x00A0;&#x00A0;&#x00A0;print_level&#x00A0;6
    112109</div>
    113 <!--l. 66--><p class="nopar" > This sets the level of output of the branch-and-bound in <span
     110</td></tr></table>
     111<!--l. 66--><p class="nopar"> This sets the level of output of the branch-and-bound in <span
    114112class="cmtt-10">BONMIN</span>&#x00A0;to 4, the algorithm
    115113to branch-and-bound and the output level for <span
    116 class="cmtt-10">Ipopt </span>to 6.<br
    117 class="newline" />
    118 <!--l. 70--><p class="indent" >   When <span
     114class="cmtt-10">Ipopt </span>to 6.
     115<br class="newline" />
     116<!--l. 70--><p class="indent">   When <span
    119117class="cmtt-10">BONMIN</span>&#x00A0;is run from within <span
    120118class="cmtt-10">Ampl</span>, another way to set an option is through
     
    123121class="cmtt-10">options</span>. For example
    124122
    125 <a
    126  id="page.3"></a>
    127    <div class="verbatim" id="verbatim-2">
     123   <table
     124class="verbatim"><tr class="verbatim"><td
     125class="verbatim"><div class="verbatim">
    128126options&#x00A0;bonmin_options&#x00A0;"bonmin.bb_log-level&#x00A0;4&#x00A0;\
    129127&#x00A0;<br />&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;bonmin.algorithm&#x00A0;B-BB&#x00A0;print_level&#x00A0;6";
    130128</div>
    131 <!--l. 77--><p class="nopar" > has the same affect as the <span
     129</td></tr></table>
     130<!--l. 77--><p class="nopar"> has the same affect as the <span
    132131class="cmtt-10">bonmin.opt </span>example above. Note that any <span
    133132class="cmtt-10">BONMIN</span>&#x00A0;option
     
    135134class="cmtt-10">bonmin.opt </span>overrides any setting of that option from within <img
    136135src="tmp0x.png" alt="A
    137 "  class="udot" >mpl.<br
    138 class="newline" />
    139 <!--l. 82--><p class="indent" >   A third way is to set options directly in the C/C++ code when running
     136"  class="udot" >mpl.
     137<br class="newline" />
     138<!--l. 82--><p class="indent">   A third way is to set options directly in the C/C++ code when running
    140139<span
    141140class="cmtt-10">BONMIN</span>&#x00A0;from inside a C/C++ program as is explained in the reference manual.
    142 <!--l. 85--><p class="indent" >   A detailed description of all of the <span
     141<!--l. 85--><p class="indent">   A detailed description of all of the <span
    143142class="cmtt-10">BONMIN</span>&#x00A0;options is given <a
    144143href="options_list.html#sec:options_list" >here</a>. In the following,
    145144we give some more details on options for the MILP subsolver and on the options
    146 specifically designed for nonconvex problems.<br
    147 class="newline" />
    148 <!--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>
     145specifically designed for nonconvex problems.
     146<br class="newline" />
     147<!--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>
    149148<a
    150149 id="x1-1doc"></a>Several parts of the algorithms in <span
     
    156155MINLP (called in B-Hyb or B-BB at the root node), RINS, RENS, Local
    157156Branching.
    158 <!--l. 101--><p class="indent" >   In all these cases, one can pass options to the sub-algorithm used through the
     157<!--l. 101--><p class="indent">   In all these cases, one can pass options to the sub-algorithm used through the
    159158bonmin.opt file. The basic principle is that the &#8220;bonmin.&#8221; prefix is replaced with a
    160159prefix that identifies the sub-algorithm used:
     
    179178class="cmtt-10">local</span><span
    180179class="cmtt-10">_branch</span>.</li></ul>
    181 <!--l. 112--><p class="indent" >   For example, we may want to run a maximum of 60 seconds of FP for MINLP
     180<!--l. 112--><p class="indent">   For example, we may want to run a maximum of 60 seconds of FP for MINLP
    182181until 6 solutions are found at the beginning of the hybrid algorithm. To do so we set
    183182the following option in <span
    184183class="cmtt-10">bonmin.opt</span>
    185184
    186 <a
    187  id="page.4"></a>
    188    <div class="verbatim" id="verbatim-3">
     185   <table
     186class="verbatim"><tr class="verbatim"><td
     187class="verbatim"><div class="verbatim">
    189188bonmin.algorithm&#x00A0;B-Hyb
    190189&#x00A0;<br />
     
    194193&#x00A0;<br />
    195194</div>
    196 <!--l. 121--><p class="nopar" >
    197 <!--l. 123--><p class="indent" >   Note that the actual solution and time limit will be the minimum of the global
     195</td></tr></table>
     196<!--l. 121--><p class="nopar">
     197<!--l. 123--><p class="indent">   Note that the actual solution and time limit will be the minimum of the global
    198198limits set for <span
    199199class="cmtt-10">BONMIN</span>.
    200 <!--l. 125--><p class="indent" >   A slightly more complicated set of options may be used when using RINS. Say
     200<!--l. 125--><p class="indent">   A slightly more complicated set of options may be used when using RINS. Say
    201201for example that we want to run RINS inside B-BB. Each time RINS is
    202202called we want to solve the small-size MINLP generated using B-QG (we
     
    206206bonmin.opt
    207207
    208 <a
    209  id="page.5"></a>
    210    <div class="verbatim" id="verbatim-4">
     208   <table
     209class="verbatim"><tr class="verbatim"><td
     210class="verbatim"><div class="verbatim">
    211211bonmin.algorithm&#x00A0;B-BB
    212212&#x00A0;<br />
     
    216216&#x00A0;<br />
    217217</div>
    218 <!--l. 136--><p class="nopar" > This example shows that it is possible to set any option used in the sub-algorithm to
     218</td></tr></table>
     219<!--l. 136--><p class="nopar"> This example shows that it is possible to set any option used in the sub-algorithm to
    219220be different than the one used for the main algorithm.
    220 <!--l. 140--><p class="indent" >   In the context of OA and FP for MINLP, a standard MILP solver is used. Several
     221<!--l. 140--><p class="indent">   In the context of OA and FP for MINLP, a standard MILP solver is used. Several
    221222option are available for configuring this MILP solver. <span
    222223class="cmtt-10">BONMIN</span>&#x00A0;allows a choice of
     
    241242Table <span
    242243class="cmbx-10">??</span>).
    243 <!--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
     244<!--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
    244245problem with non-convex constraints, one should only use the branch-and-bound
    245246algorithm <span
    246247class="cmtt-10">B-BB</span>.
    247 <!--l. 155--><p class="indent" >   A few options have been designed in <span
     248<!--l. 155--><p class="indent">   A few options have been designed in <span
    248249class="cmtt-10">BONMIN</span>&#x00A0;specifically to treat problems that
    249250do not have a convex continuous relaxation. In such problems, the solutions obtained
     
    252253the outer-approximation constraints are not necessarily valid inequalities for the
    253254problem.
    254 <!--l. 161--><p class="indent" >   No specific heuristic method for treating nonconvex problems is implemented yet
     255<!--l. 161--><p class="indent">   No specific heuristic method for treating nonconvex problems is implemented yet
    255256within the OA framework. But for the pure branch-and-bound <span
    256257class="cmtt-10">B-BB</span>, we implemented
     
    259260trusted, and with the goal of trying to get good solutions. Such options are at a very
    260261experimental stage.
    261 <!--l. 167--><p class="indent" >   First, in the context of nonconvex problems, <span
     262<!--l. 167--><p class="indent">   First, in the context of nonconvex problems, <span
    262263class="cmtt-10">Ipopt </span>may find different
    263264local optima when started from different starting points. The two options
     
    278279points of the domain, it may pick such points, and so it is not robust in that
    279280respect.
    280 <!--l. 177--><p class="indent" >   Secondly, since the solution given by <span
     281
     282<!--l. 177--><p class="indent">   Secondly, since the solution given by <span
    281283class="cmtt-10">Ipopt </span>does not truly give a lower bound, we
    282284allow for changing the fathoming rule to continue branching even if the solution value
    283 
    284 <a
    285  id="page.6"></a>
    286285to the current node is worse than the best-known solution. This is achieved by setting
    287286<span
     
    294293class="cmtt-10">_decr </span>to negative
    295294values.
    296 <!--l. 184--><p class="indent" >    </div> <div class="story"><h3><a id="sec:opt&#x02D9;ipopt">Notes on <span
     295<!--l. 184--><p class="indent">    </div> <div class="story"><h3><a id="sec:opt&#x02D9;ipopt">Notes on <span
    297296class="cmtt-10">Ipopt </span>options</a></h3>   <a
    298297href="https://projects.coin-or.org/Ipopt" ><span
     
    309308 id="x1-10000.0.1"></a>Default options changed by <span
    310309class="cmtt-10">BONMIN</span></h5>
    311 <!--l. 191--><p class="noindent" ><a
     310<!--l. 191--><p class="noindent"><a
    312311href="https://projects.coin-or.org/Ipopt" ><span
    313312class="cmtt-10">Ipopt</span></a>&#x00A0;has been tailored to be more efficient when used in the context of the
     
    322321class="cmtt-10">BONMIN</span>&#x00A0;automatically changes these options from their default
    323322values.
    324 <!--l. 197--><p class="indent" >   Note that options set by the user in <span
     323<!--l. 197--><p class="indent">   Note that options set by the user in <span
    325324class="cmtt-10">bonmin.opt </span>will override these settings.
    326325<a
    327326 id="section*.1"></a>
    328 <!--l. 200--><p class="noindent" ><span class="paragraphHead"><a
     327<!--l. 200--><p class="noindent"><span class="paragraphHead"><a
    329328 id="x1-20000.0.1"></a><span
    330329class="cmtt-10">mu</span><span
     
    332331class="cmbx-10">and </span><span
    333332class="cmtt-10">mu</span><span
    334 class="cmtt-10">_oracle</span></span>
    335    are set, respectively, to <span
     333class="cmtt-10">_oracle</span></span> are set, respectively, to <span
    336334class="cmtt-10">adaptive </span>and <span
    337 class="cmtt-10">probing </span>by default (these are
    338 newly implemented strategies in <a
    339 href="https://projects.coin-or.org/Ipopt" ><span
    340 class="cmtt-10">Ipopt</span></a>&#x00A0;for updating the barrier parameter
    341 <a
     335class="cmtt-10">probing </span>by
     336default (these are newly implemented strategies in <a
     337href="https://projects.coin-or.org/Ipopt" ><span
     338class="cmtt-10">Ipopt</span></a>&#x00A0;for updating the barrier
     339parameter  <a
    342340href="bib.html#NocedalAdaptive" >[Nocedal2004]</a>   which we have found to be more efficient in the context of
    343341MINLP).
    344342<a
    345343 id="section*.2"></a>
    346 <!--l. 204--><p class="noindent" ><span class="paragraphHead"><a
     344<!--l. 204--><p class="noindent"><span class="paragraphHead"><a
    347345 id="x1-30000.0.1"></a><span
    348346class="cmtt-10">gamma</span><span
     
    350348class="cmbx-10">and </span><span
    351349class="cmtt-10">gamma</span><span
    352 class="cmtt-10">_theta</span></span>
    353    are set to 10<sup><span
     350class="cmtt-10">_theta</span></span> are set to 10<sup><span
    354351class="cmsy-7">-</span><span
    355352class="cmr-7">8</span></sup> and 10<sup><span
    356353class="cmsy-7">-</span><span
    357 class="cmr-7">4</span></sup> respectively. This has the effect of reducing the size of
    358 the filter in the line search performed by <a
     354class="cmr-7">4</span></sup> respectively. This has
     355the effect of reducing the size of the filter in the line search performed by
     356<a
    359357href="https://projects.coin-or.org/Ipopt" ><span
    360358class="cmtt-10">Ipopt</span></a>.
    361359<a
    362360 id="section*.3"></a>
    363 <!--l. 207--><p class="noindent" ><span class="paragraphHead"><a
     361<!--l. 207--><p class="noindent"><span class="paragraphHead"><a
    364362 id="x1-40000.0.1"></a><span
    365363class="cmtt-10">required</span><span
    366364class="cmtt-10">_infeasibility</span><span
    367 class="cmtt-10">_reduction</span></span>
    368    is set to 0<span
    369 class="cmmi-10">.</span>1. This increases the required infeasibility reduction when <a
    370 href="https://projects.coin-or.org/Ipopt" ><span
    371 class="cmtt-10">Ipopt</span></a>&#x00A0;enters
    372 the restoration phase and should thus help to detect infeasible problems
    373 faster.
     365class="cmtt-10">_reduction</span></span> is set to 0<span
     366class="cmmi-10">.</span>1. This increases the required
     367infeasibility reduction when <a
     368href="https://projects.coin-or.org/Ipopt" ><span
     369class="cmtt-10">Ipopt</span></a>&#x00A0;enters the restoration phase and should thus help
     370to detect infeasible problems faster.
    374371<a
    375372 id="section*.4"></a>
    376 <!--l. 212--><p class="noindent" ><span class="paragraphHead"><a
     373<!--l. 212--><p class="noindent"><span class="paragraphHead"><a
    377374 id="x1-50000.0.1"></a><span
    378375class="cmtt-10">expect</span><span
    379376class="cmtt-10">_infeasible</span><span
    380 class="cmtt-10">_problem</span></span>
    381    is set to <span
    382 class="cmtt-10">yes</span>, which enables some heuristics to detect infeasible problems
    383 faster.
    384 
    385 <a
    386  id="page.7"></a>
     377class="cmtt-10">_problem</span></span> is set to <span
     378class="cmtt-10">yes</span>, which enables some heuristics to detect
     379infeasible problems faster.
    387380<a
    388381 id="section*.5"></a>
    389 <!--l. 215--><p class="noindent" ><span class="paragraphHead"><a
     382<!--l. 215--><p class="noindent"><span class="paragraphHead"><a
    390383 id="x1-60000.0.1"></a><span
    391384class="cmtt-10">warm</span><span
    392385class="cmtt-10">_start</span><span
    393386class="cmtt-10">_init</span><span
    394 class="cmtt-10">_point</span></span>
    395    is set to <span
    396 class="cmtt-10">yes </span>when a full primal/dual starting point is available (generally all the
    397 optimizations after the continuous relaxation has been solved).
     387class="cmtt-10">_point</span></span> is set to <span
     388class="cmtt-10">yes </span>when a full primal/dual starting point is
     389available (generally all the optimizations after the continuous relaxation has been
     390solved).
     391
    398392<a
    399393 id="section*.6"></a>
    400 <!--l. 218--><p class="noindent" ><span class="paragraphHead"><a
     394<!--l. 218--><p class="noindent"><span class="paragraphHead"><a
    401395 id="x1-70000.0.1"></a><span
    402396class="cmtt-10">print</span><span
    403 class="cmtt-10">_level</span></span>
    404    is set to 0 by default to turn off <a
     397class="cmtt-10">_level</span></span> is set to 0 by default to turn off <a
    405398href="https://projects.coin-or.org/Ipopt" ><span
    406399class="cmtt-10">Ipopt</span></a>&#x00A0;output.
     
    413406<a
    414407 id="section*.7"></a>
    415 <!--l. 220--><p class="noindent" ><span class="paragraphHead"><a
     408<!--l. 220--><p class="noindent"><span class="paragraphHead"><a
    416409 id="x1-90000.0.2"></a><span
    417410class="cmbx-10">bound</span><span
    418411class="cmbx-10">_relax</span><span
    419 class="cmbx-10">_factor</span></span>
    420    is by default set to 10<sup><span
     412class="cmbx-10">_factor</span></span> is by default set to 10<sup><span
    421413class="cmsy-7">-</span><span
    422414class="cmr-7">8</span></sup> in <a
    423415href="https://projects.coin-or.org/Ipopt" ><span
    424 class="cmtt-10">Ipopt</span></a>. All of the bounds of the problem are relaxed by
    425 this factor. This may cause some trouble when constraint functions can only be
    426 evaluated within their bounds. In such cases, this option should be set to
    427 0.
     416class="cmtt-10">Ipopt</span></a>. All of the bounds of the
     417problem are relaxed by this factor. This may cause some trouble when constraint
     418functions can only be evaluated within their bounds. In such cases, this option should
     419be set to 0.
    428420   
    429421</body></html>
  • html/use.html

    r1947 r1993  
    1 <a
    2  id="page.1"></a>
    3 
    41<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
    52  "http://www.w3.org/TR/html4/loose.dtd"> 
     
    118<!-- html -->
    129<meta name="src" content="tmp.tex">
    13 <meta name="date" content="2012-02-02 11:55:00">
     10<meta name="date" content="2012-06-04 14:26:00">
    1411<link rel="stylesheet" type="text/css" href="bonmin.css">
    1512</head><body
    1613>
    17 <!--l. 2--><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"> Running <span
     14<!--l. 2--><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"> Running <span
    1815class="cmtt-10">BONMIN </span> </h2> <a href="#sec:run&#x02D9;nl " > On an .nl file  </a> /
    1916<a href="#sec:run&#x02D9;ampl " > From Ampl  </a> / <a href="#sub&#x02D9;sec:prio " > priorities and SOS in Ampl  </a> /
    2017<a href="#sec:run&#x02D9;gams " > From GAMS  </a> / <a href="#sec:run&#x02D9;cpp " > From a C++ Programm  </a> /   </div>
    21 <!--l. 11--><p class="noindent" > <div id="rightPanel"> <div id="headlines"> <h4>References </h4>     <div id="refer"> <p>  1 <a
     18<!--l. 11--><p class="noindent"> <div id="rightPanel"> <div id="headlines"> <h4>References </h4>     <div id="refer"> <p>  1 <a
    2219href="bib.html#Gay" >Writing <span
    2320class="cmbx-10">.nl </span>files. D.M.&#x00A0;Gay.</a>  </p> </div>       <div id="refer"> <p>  2 <a
     
    2522Mathematical Programming, Second Edition, Duxbury Press Brooks Cole
    2623Publishing Co., 2003. R.&#x00A0;Fourer and D.M.&#x00A0;Gay and B.W.&#x00A0;Kernighan.</a>  </p> </div>     </div> </div>
    27 <!--l. 18--><p class="noindent" > </div> <div id="content"> <div class="feature"> <h3> <a id="sec:run">Running <span
     24<!--l. 18--><p class="noindent"> </div> <div id="content"> <div class="feature"> <h3> <a id="sec:run">Running <span
    2825class="cmtt-10">BONMIN</span></a> </h3>  <span
    2926class="cmtt-10">BONMIN</span>&#x00A0;can be run
     
    4542     <li class="itemize">remotely through the <a
    4643href="http://neos.mcs.anl.gov/neos" >NEOS</a> web interface.</li></ul>
    47 <!--l. 30--><p class="indent" >   In this page, we give some details about the various ways to run <span
     44<!--l. 30--><p class="indent">   In this page, we give some details about the various ways to run <span
    4845class="cmtt-10">BONMIN</span>.
    49 <!--l. 33--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;nl">On a <span
     46<!--l. 33--><p class="indent">    </div> <div class="story"><h3><a id="sec:run&#x02D9;nl">On a <span
    5047class="cmtt-10">.nl </span>file</a></h3>   <span
    5148class="cmtt-10">BONMIN</span>&#x00A0;can read a <span
     
    5855class="cmtt-10">.nl </span>file to be
    5956processed.
    60 <!--l. 40--><p class="indent" >   For example, if you want to solve <span
     57<!--l. 40--><p class="indent">   For example, if you want to solve <span
    6158class="cmtt-10">mytoy.nl</span>, from the <span
    6259class="cmtt-10">Bonmin-dist </span>directory,
    6360issue the command:
    64 <!--l. 43--><p class="indent" >   <div id="verbatim">
    65 
    66 <a
    67  id="page.2"></a>
    68    <div class="verbatim" id="verbatim-1">
     61<!--l. 43--><p class="indent">   <div id="verbatim">
     62
     63   <table
     64class="verbatim"><tr class="verbatim"><td
     65class="verbatim"><div class="verbatim">
    6966&#x00A0;<br />bonmin&#x00A0;test/mytoy.nl
    7067&#x00A0;<br />
    7168</div>
    72 <!--l. 48--><p class="nopar" > </div>
    73 <!--l. 51--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;ampl">From <span
     69</td></tr></table>
     70<!--l. 48--><p class="nopar"> </div>
     71<!--l. 51--><p class="indent">    </div> <div class="story"><h3><a id="sec:run&#x02D9;ampl">From <span
    7472class="cmtt-10">Ampl</span></a></h3>  To use <span
    7573class="cmtt-10">BONMIN</span>&#x00A0;from <span
     
    7977class="cmtt-10">$PATH </span>and to issue the
    8078command
    81 <!--l. 56--><p class="indent" >   <div id="verbatim">
    82 
    83 <a
    84  id="page.3"></a>
    85    <div class="verbatim" id="verbatim-2">
     79<!--l. 56--><p class="indent">   <div id="verbatim">
     80
     81   <table
     82class="verbatim"><tr class="verbatim"><td
     83class="verbatim"><div class="verbatim">
    8684&#x00A0;<br />option&#x00A0;solver&#x00A0;bonmin;
    8785&#x00A0;<br />
    8886</div>
    89 <!--l. 61--><p class="nopar" > </div>
    90 <!--l. 64--><p class="indent" >   in the <span
     87</td></tr></table>
     88<!--l. 61--><p class="nopar"> </div>
     89<!--l. 64--><p class="indent">   in the <span
    9190class="cmtt-10">Ampl </span>environment. Then the next <span
    9291class="cmtt-10">solve </span>will use <span
     
    9897interrupted with <span
    9998class="cmtt-10">&#x003C;CTRL-C&#x003E; </span>the best known solution is accessible (this feature is not
    100 available in Cygwin).<br
    101 class="newline" />
    102 <!--l. 71--><p class="indent" >    </div> <div class="story"><h3><a id="A">Example <span
     99available in Cygwin).
     100<br class="newline" />
     101<!--l. 71--><p class="indent">    </div> <div class="story"><h3><a id="A">Example <span
    103102class="cmtt-10">Ampl </span>model</a></h3>   simple <span
    104103class="cmtt-10">Ampl </span>example model follows:
    105 <!--l. 73--><p class="indent" >   <div id="verbatim">
    106 
    107 <a
    108  id="page.4"></a>
    109    <div class="verbatim" id="verbatim-3">
     104<!--l. 73--><p class="indent">   <div id="verbatim">
     105
     106   <table
     107class="verbatim"><tr class="verbatim"><td
     108class="verbatim"><div class="verbatim">
    110109&#x00A0;<br />&#x00A0;&#x00A0;&#x00A0;#&#x00A0;An&#x00A0;Ampl&#x00A0;version&#x00A0;of&#x00A0;toy
    111110&#x00A0;<br />
     
    131130&#x00A0;<br />
    132131</div>
    133 <!--l. 98--><p class="nopar" > </div>
    134 <!--l. 101--><p class="indent" >   (This example can be found in the subdirectory <span
     132</td></tr></table>
     133<!--l. 98--><p class="nopar"> </div>
     134<!--l. 101--><p class="indent">   (This example can be found in the subdirectory <span
    135135class="cmtt-10">Bonmin/examples/amplExamples/</span>
    136136of the <span
    137137class="cmtt-10">BONMIN</span>&#x00A0;package.)
    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
     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
    139139constraints in ampl</a></h3>   Branching priorities, branching directions and pseudo-costs can
    140140be passed using <span
     
    153153down pseudo-costs is set in the <span
    154154class="cmtt-10">Ampl </span>model it will be used for both up and
    155 down).<br
    156 class="newline" />
    157 <!--l. 114--><p class="indent" >   For example, to give branching priorities of 10 to variables <span
     155down).
     156<br class="newline" />
     157<!--l. 114--><p class="indent">   For example, to give branching priorities of 10 to variables <span
    158158class="cmtt-10">y </span>and 1 to variable <span
    159159class="cmtt-10">x</span>
     
    162162<div id="verbatim">
    163163
    164 <a
    165  id="page.5"></a>
    166    <div class="verbatim" id="verbatim-4">
     164   <table
     165class="verbatim"><tr class="verbatim"><td
     166class="verbatim"><div class="verbatim">
    167167&#x00A0;<br />suffix&#x00A0;priority&#x00A0;IN,&#x00A0;integer,&#x00A0;&#x003E;=0,&#x00A0;&#x003C;=&#x00A0;9999;
    168168&#x00A0;<br />y[1].priority&#x00A0;:=&#x00A0;10;
     
    176176&#x00A0;<br />
    177177</div>
    178 <!--l. 130--><p class="nopar" > </div>
    179 <!--l. 133--><p class="indent" >   SOS Type-1 branching is also available in <span
     178</td></tr></table>
     179<!--l. 130--><p class="nopar"> </div>
     180<!--l. 133--><p class="indent">   SOS Type-1 branching is also available in <span
    180181class="cmtt-10">BONMIN</span>&#x00A0;from <span
    181182class="cmtt-10">Ampl</span>. We follow the
    182183conventional way of doing this with suffixes. Two type of suffixes should be
    183184declared:
    184 <!--l. 137--><p class="indent" >   <div id="verbatim">
    185 
    186 <a
    187  id="page.6"></a>
    188    <div class="verbatim" id="verbatim-5">
     185<!--l. 137--><p class="indent">   <div id="verbatim">
     186
     187   <table
     188class="verbatim"><tr class="verbatim"><td
     189class="verbatim"><div class="verbatim">
    189190suffix&#x00A0;sosno&#x00A0;IN,&#x00A0;integer,&#x00A0;&#x003E;=1;&#x00A0;&#x00A0;#&#x00A0;Note&#x00A0;that&#x00A0;the&#x00A0;solver&#x00A0;assumes&#x00A0;that&#x00A0;these
    190191&#x00A0;<br />&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;#&#x00A0;&#x00A0;&#x00A0;values&#x00A0;are&#x00A0;positive&#x00A0;for&#x00A0;SOS&#x00A0;Type&#x00A0;1
    191192&#x00A0;<br />suffix&#x00A0;ref&#x00A0;IN;
    192193</div>
    193 <!--l. 142--><p class="nopar" > </div>
    194 <!--l. 145--><p class="indent" >   Next, suppose that we wish to have variables
    195 <!--l. 147--><p class="indent" >   <div id="verbatim">
    196 
    197 <a
    198  id="page.7"></a>
    199    <div class="verbatim" id="verbatim-6">
     194</td></tr></table>
     195<!--l. 142--><p class="nopar"> </div>
     196<!--l. 145--><p class="indent">   Next, suppose that we wish to have variables
     197<!--l. 147--><p class="indent">   <div id="verbatim">
     198
     199   <table
     200class="verbatim"><tr class="verbatim"><td
     201class="verbatim"><div class="verbatim">
    200202var&#x00A0;X&#x00A0;{i&#x00A0;in&#x00A0;1..M,&#x00A0;j&#x00A0;in&#x00A0;1..N}&#x00A0;binary;
    201203</div>
    202 <!--l. 150--><p class="nopar" > </div>
     204</td></tr></table>
     205<!--l. 150--><p class="nopar"> </div>
    203206and the &#8220;convexity&#8221; constraints:
    204 <!--l. 154--><p class="indent" >   <div id="verbatim">
    205 
    206 <a
    207  id="page.8"></a>
    208    <div class="verbatim" id="verbatim-7">
     207<!--l. 154--><p class="indent">   <div id="verbatim">
     208
     209   <table
     210class="verbatim"><tr class="verbatim"><td
     211class="verbatim"><div class="verbatim">
    209212subject&#x00A0;to&#x00A0;Convexity&#x00A0;{i&#x00A0;in&#x00A0;1..M}:
    210213&#x00A0;<br />&#x00A0;&#x00A0;&#x00A0;sum&#x00A0;{j&#x00A0;in&#x00A0;1..N}&#x00A0;X[i,j]&#x00A0;=&#x00A0;1;
    211214</div>
    212 <!--l. 158--><p class="nopar" > </div>
    213 <!--l. 161--><p class="indent" >   (note that we must explicitly include the convexity constraints in the <span
     215</td></tr></table>
     216<!--l. 158--><p class="nopar"> </div>
     217<!--l. 161--><p class="indent">   (note that we must explicitly include the convexity constraints in the <span
    214218class="cmtt-10">Ampl</span>
    215219model).
    216 <!--l. 163--><p class="indent" >   Then after reading in the data, we set the suffix values: <div id="verbatim">
    217 
    218 <a
    219  id="page.9"></a>
    220    <div class="verbatim" id="verbatim-8">
     220<!--l. 163--><p class="indent">   Then after reading in the data, we set the suffix values: <div id="verbatim">
     221
     222   <table
     223class="verbatim"><tr class="verbatim"><td
     224class="verbatim"><div class="verbatim">
    221225&#x00A0;<br />#&#x00A0;The&#x00A0;numbers&#x00A0;&#8216;val[i,j]&#8217;&#x00A0;are&#x00A0;chosen&#x00A0;typically&#x00A0;as
    222226&#x00A0;<br />#&#x00A0;&#x00A0;&#x00A0;&#x00A0;&#x00A0;the&#x00A0;values&#x00A0;&#8216;represented&#8217;&#x00A0;by&#x00A0;the&#x00A0;discrete&#x00A0;choices.
     
    226230&#x00A0;<br />let&#x00A0;{i&#x00A0;in&#x00A0;1..M,&#x00A0;j&#x00A0;in&#x00A0;1..N}&#x00A0;X[i,j].sosno&#x00A0;:=&#x00A0;i;
    227231</div>
    228 <!--l. 173--><p class="nopar" > </div>
    229 <!--l. 176--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;gams">From <span
     232</td></tr></table>
     233<!--l. 173--><p class="nopar"> </div>
     234<!--l. 176--><p class="indent">    </div> <div class="story"><h3><a id="sec:run&#x02D9;gams">From <span
    230235class="cmtt-10">Gams</span></a></h3>  Thanks to the <a
    231236href="http://projects.coin-or.org/GAMSlinks" >GAMSlinks</a> project, Bonmin is available
     
    241246<a
    242247href="http://www.gams.com/solvers/coin.pdf" >here</a>.
    243 <!--l. 187--><p class="indent" >    </div> <div class="story"><h3><a id="sec:run&#x02D9;cpp">From a C/C++ program</a></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
    244249class="cmtt-10">BONMIN</span>&#x00A0;can also be run from within a
    245250C/C++ program if the user codes the functions to compute first- and second-order
Note: See TracChangeset for help on using the changeset viewer.