491 lines
90 KiB
HTML
491 lines
90 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: parameters.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('parameters_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">parameters.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="parameters_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_MATH_OPT_CPP_PARAMETERS_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_MATH_OPT_CPP_PARAMETERS_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <optional></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include "absl/status/statusor.h"</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "absl/strings/string_view.h"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "<a class="code" href="linked__hash__map_8h.html">ortools/base/linked_hash_map.h</a>"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "ortools/glop/parameters.pb.h"</span> <span class="comment">// IWYU pragma: export</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "ortools/gscip/gscip.pb.h"</span> <span class="comment">// IWYU pragma: export</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="enums_8h.html">ortools/math_opt/cpp/enums.h</a>"</span> <span class="comment">// IWYU pragma: export</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "ortools/math_opt/parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "ortools/math_opt/solvers/gurobi.pb.h"</span> <span class="comment">// IWYU pragma: export</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span> <span class="comment">// IWYU pragma: export</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research_1_1math__opt.html">math_opt</a> {</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">// The solvers wrapped by MathOpt.</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ec"> 37</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ec">SolverType</a> {</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// Solving Constraint Integer Programs (SCIP) solver.</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// It supports both MIPs and LPs. No dual data for LPs is returned though. To</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// solve LPs, kGlop should be preferred.</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306eca30143491c833be17bff959fa79c72bda">kGscip</a> = SOLVER_TYPE_GSCIP,</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// Gurobi solver.</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// It supports both MIPs and LPs.</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ecabc8ddfb8a00bb405e68545ce187ac238">kGurobi</a> = SOLVER_TYPE_GUROBI,</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// Google's Glop linear solver.</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// It only solves LPs.</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306eca512b5059e1ca814e697fb191d93aaf7f">kGlop</a> = SOLVER_TYPE_GLOP,</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// Google's CP-SAT solver.</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// It supports solving IPs and can scale MIPs to solve them as IPs.</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306eca44e5c1d9f55c30721e6b79c5ca328a62">kCpSat</a> = SOLVER_TYPE_CP_SAT,</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// GNU Linear Programming Kit (GLPK).</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// It supports both MIPs and LPs.</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// Thread-safety: GLPK use thread-local storage for memory allocations. As a</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// consequence when using IncrementalSolver, the user must make sure that</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// instances are destroyed on the same thread as they are created or GLPK will</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// crash. It seems OK to call IncrementalSolver::Solve() from another thread</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// than the one used to create the Solver but it is not documented by GLPK and</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// should be avoided. Of course these limitations do not apply to the Solve()</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// function that recreates a new GLPK problem in the calling thread and</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// destroys before returning.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// When solving a LP with the presolver, a solution (and the unbound rays) are</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// only returned if an optimal solution has been found. Else nothing is</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// returned. See glpk-5.0/doc/glpk.pdf page #40 available from glpk-5.0.tar.gz</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// for details.</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ecae2a40eea095a7c19652eff4af08a9144">kGlpk</a> = SOLVER_TYPE_GLPK,</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> </div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span>};</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> </div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#ab0e0cb61730eb1d83ff68969eb3a3d19"> 80</a></span><a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a6539b726794dda80e1570435b74b96f8">MATH_OPT_DEFINE_ENUM</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ec">SolverType</a>, SOLVER_TYPE_UNSPECIFIED);</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// Parses a flag of type SolverType.</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">// The expected values are the one returned by EnumToString().</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a90811b426f82fd0533888ec9090e4fce">AbslParseFlag</a>(absl::string_view text, <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ec">SolverType</a>* <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>,</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> std::string* error);</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> </div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment">// Unparses a flag of type SolverType.</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// The returned values are the same as EnumToString().</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span>std::string <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a9e7ad1d70792e12d16dc22cd63028e77">AbslUnparseFlag</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ec">SolverType</a> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment">// Selects an algorithm for solving linear programs.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212"> 94</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212">LPAlgorithm</a> {</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// The (primal) simplex method. Typically can provide primal and dual</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// solutions, primal/dual rays on primal/dual unbounded problems, and a basis.</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212a3109cf29ac1c83cbca48b23c11ca88fb">kPrimalSimplex</a> = LP_ALGORITHM_PRIMAL_SIMPLEX,</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> </div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// The dual simplex method. Typically can provide primal and dual</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// solutions, primal/dual rays on primal/dual unbounded problems, and a basis.</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212ac3a659d06e6ead2ed2179ebbfefc0734">kDualSimplex</a> = LP_ALGORITHM_DUAL_SIMPLEX,</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// The barrier method, also commonly called an interior point method (IPM).</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// Can typically give both primal and dual solutions. Some implementations can</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// also produce rays on unbounded/infeasible problems. A basis is not given</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// unless the underlying solver does "crossover" and finishes with simplex.</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#a4f0b2adea9a4297f27df941fe3ed3831affa5976cb7170d234d6b69921bf0f085">kBarrier</a> = LP_ALGORITHM_BARRIER</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span>};</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> </div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a3eadaeff213e8dbeac83d4aa64669eb0"> 110</a></span><a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a6539b726794dda80e1570435b74b96f8">MATH_OPT_DEFINE_ENUM</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212">LPAlgorithm</a>, LP_ALGORITHM_UNSPECIFIED);</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> </div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">// Effort level applied to an optional task while solving (see SolveParameters</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment">// for use).</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment">// Typically used as a std::optional<Emphasis>. It used to configure a solver</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment">// feature as follows:</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment">// * If a solver doesn't support the feature, only nullopt will always be</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment">// valid, any other setting will give an invalid argument error (some solvers</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment">// may also accept kOff).</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="comment">// * If the solver supports the feature:</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment">// - When unset, the underlying default is used.</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span><span class="comment">// - When the feature cannot be turned off, kOff will return an error.</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span><span class="comment">// - If the feature is enabled by default, the solver default is typically</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="comment">// mapped to kMedium.</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span><span class="comment">// - If the feature is supported, kLow, kMedium, kHigh, and kVeryHigh will</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span><span class="comment">// never give an error, and will map onto their best match.</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7"> 127</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7">Emphasis</a> {</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7acc9ab5e60ac2a9a675ba64bf4bb49dc8">kOff</a> = EMPHASIS_OFF,</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7acd8fe42741a3bbc973bbf1d404afeff4">kLow</a> = EMPHASIS_LOW,</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7a3ce9d817402b59f65fb01ea044bb1ee9">kMedium</a> = EMPHASIS_MEDIUM,</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7aa022f15e910eb36278094efb6e808a07">kHigh</a> = EMPHASIS_HIGH,</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7ab19e80cac5b7f585659031a6cff1489b">kVeryHigh</a> = EMPHASIS_VERY_HIGH</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>};</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> </div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#acd2a269e1b0c91fb4133e02b5fef684b"> 135</a></span><a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a6539b726794dda80e1570435b74b96f8">MATH_OPT_DEFINE_ENUM</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7">Emphasis</a>, EMPHASIS_UNSPECIFIED);</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment">// Gurobi specific parameters for solving. See</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment">// https://www.gurobi.com/documentation/9.1/refman/parameters.html</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment">// for a list of possible parameters.</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// Example use:</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">// GurobiParameters gurobi;</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment">// gurobi.param_values["BarIterLimit"] = "10";</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment">// With Gurobi, the order that parameters are applied can have an impact in rare</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span><span class="comment">// situations. Parameters are applied in the following order:</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="comment">// * LogToConsole is set from SolveParameters.enable_output.</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="comment">// * Any common parameters not overwritten by GurobiParameters.</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// * param_values in iteration order (insertion order).</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="comment">// We set LogToConsole first because setting other parameters can generate</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">// output.</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html"> 152</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html">GurobiParameters</a> {</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Parameter name-value pairs to set in insertion order.</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#adb43fff359863070c805fa5cb921655f"> 154</a></span> <a class="code hl_class" href="classgtl_1_1linked__hash__map.html">gtl::linked_hash_map<std::string, std::string></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#adb43fff359863070c805fa5cb921655f">param_values</a>;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> GurobiParametersProto <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#ab6c6b7e079ea960ca2d802ee30a3a919">Proto</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html">GurobiParameters</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#a35971ccf0d56f080fe88cad9e5ef55d0">FromProto</a>(<span class="keyword">const</span> GurobiParametersProto& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>);</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#a644718bb2fb240de962dc3c9a1fdf0dc"> 159</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#a644718bb2fb240de962dc3c9a1fdf0dc">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#adb43fff359863070c805fa5cb921655f">param_values</a>.<a class="code hl_function" href="classgtl_1_1linked__hash__map.html#a644718bb2fb240de962dc3c9a1fdf0dc">empty</a>(); }</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span>};</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment">// Parameters to control a single solve.</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span><span class="comment">// Contains both parameters common to all solvers e.g. time_limit, and</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span><span class="comment">// parameters for a specific solver, e.g. gscip. If a value is set in both</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment">// common and solver specific field, the solver specific setting is used.</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span><span class="comment">// The common parameters that are optional and unset indicate that the solver</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span><span class="comment">// default is used.</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span><span class="comment">// Solver specific parameters for solvers other than the one in use are ignored.</span></div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span><span class="comment">// Parameters that depends on the model (e.g. branching priority is set for</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span><span class="comment">// each variable) are passed in ModelSolveParametersProto.</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html"> 175</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html">SolveParameters</a> {</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// Enables printing the solver implementation traces. These traces are sent</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// to the standard output stream.</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// Note that if the solver supports message callback and the user registers a</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// callback for it, then this parameter value is ignored and no traces are</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// printed.</span></div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a2ec1cbffcca0b4f069643c74bafbb416"> 182</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a2ec1cbffcca0b4f069643c74bafbb416">enable_output</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> </div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// Maximum time a solver should spend on the problem.</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// This value is not a hard limit, solve time may slightly exceed this value.</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// Always passed to the underlying solver, the solver default is not used.</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a2f87eac3d8c6fbf56c27b9c79a619dc2"> 188</a></span> absl::Duration <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a2f87eac3d8c6fbf56c27b9c79a619dc2">time_limit</a> = absl::InfiniteDuration();</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> </div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// Limit on the iterations of the underlying algorithm (e.g. simplex pivots).</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// The specific behavior is dependent on the solver and algorithm used, but</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// often can give a deterministic solve limit (further configuration may be</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// needed, e.g. one thread).</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// Typically supported by LP, QP, and MIP solvers, but for MIP solvers see</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// also node_limit.</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#adef25d8fac985971efcf57bb9f54d96a"> 197</a></span> std::optional<int64_t> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#adef25d8fac985971efcf57bb9f54d96a">iteration_limit</a>;</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// Limit on the number of subproblems solved in enumerative search (e.g.</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// branch and bound). For many solvers this can be used to deterministically</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// limit computation (further configuration may be needed, e.g. one thread).</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// Typically for MIP solvers, see also iteration_limit.</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a3a05f9c24e622394220e7f5554406505"> 204</a></span> std::optional<int64_t> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a3a05f9c24e622394220e7f5554406505">node_limit</a>;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> </div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// The solver stops early if it can prove there are no primal solutions at</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="comment">// least as good as cutoff.</span></div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// On an early stop, the solver returns termination reason kNoSolutionFound</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// and with limit kCutoff and is not required to give any extra solution</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// information. Has no effect on the return value if there is no early stop.</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// It is recommended that you use a tolerance if you want solutions with</span></div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// objective exactly equal to cutoff to be returned.</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// See the user guide for more details and a comparison with best_bound_limit.</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#aee4d634e8c30d7c38bd91a5f35666617"> 217</a></span> std::optional<double> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#aee4d634e8c30d7c38bd91a5f35666617">cutoff_limit</a>;</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> </div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// The solver stops early as soon as it finds a solution at least this good,</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// with termination reason kFeasible and limit kObjective.</span></div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#acf9855ade06415e74329250380b14a14"> 221</a></span> std::optional<double> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#acf9855ade06415e74329250380b14a14">objective_limit</a>;</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> </div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// The solver stops early as soon as it proves the best bound is at least this</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// good, with termination reason kFeasible or kNoSolutionFound and limit</span></div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// kObjective.</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// See the user guide for a comparison with cutoff_limit.</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a045f4ae0164882a0f94ef4ca0c588c63"> 228</a></span> std::optional<double> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a045f4ae0164882a0f94ef4ca0c588c63">best_bound_limit</a>;</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> </div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="comment">// The solver stops early after finding this many feasible solutions, with</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// termination reason kFeasible and limit kSolution. Must be greater than</span></div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// zero if set. It is often used get the solver to stop on the first feasible</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// solution found. Note that there is no guarantee on the objective value for</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// any of the returned solutions.</span></div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// Solvers will typically not return more solutions than the solution limit,</span></div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="comment">// but this is not enforced by MathOpt, see also b/214041169.</span></div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// Currently supported for Gurobi and SCIP, and for CP-SAT only with value 1.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a1c761a136563e784c0212d3f22e9529e"> 240</a></span> std::optional<int32_t> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a1c761a136563e784c0212d3f22e9529e">solution_limit</a>;</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="comment">// If unset, use the solver default. If set, it must be >= 1.</span></div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a8112e07adcce45fb4e3dc39b01aa4875"> 243</a></span> std::optional<int32_t> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a8112e07adcce45fb4e3dc39b01aa4875">threads</a>;</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> </div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// Seed for the pseudo-random number generator in the underlying</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// solver. Note that all solvers use pseudo-random numbers to select things</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// such as perturbation in the LP algorithm, for tie-break-up rules, and for</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// heuristic fixings. Varying this can have a noticeable impact on solver</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// behavior.</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// Although all solvers have a concept of seeds, note that valid values</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="comment">// depend on the actual solver.</span></div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// - Gurobi: [0:GRB_MAXINT] (which as of Gurobi 9.0 is 2x10^9).</span></div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// - GSCIP: [0:2147483647] (which is MAX_INT or kint32max or 2^31-1).</span></div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// - GLOP: [0:2147483647] (same as above)</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// In all cases, the solver will receive a value equal to:</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// MAX(0, MIN(MAX_VALID_VALUE_FOR_SOLVER, random_seed)).</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a7ca5ca47c6443a869fc42668c88448a2"> 258</a></span> std::optional<int32_t> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a7ca5ca47c6443a869fc42668c88448a2">random_seed</a>;</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> </div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// An absolute optimality tolerance (primarily) for MIP solvers.</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// The absolute GAP is the absolute value of the difference between:</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="comment">// * the objective value of the best feasible solution found,</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// * the dual bound produced by the search.</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// The solver can stop once the absolute GAP is at most absolute_gap_tolerance</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// (when set), and return TerminationReason::kOptimal.</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// Must be >= 0 if set.</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="comment">// See also relative_gap_tolerance.</span></div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a415d2993b6d4c08587fde450b930f377"> 271</a></span> std::optional<double> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a415d2993b6d4c08587fde450b930f377">absolute_gap_tolerance</a>;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> </div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="comment">// A relative optimality tolerance (primarily) for MIP solvers.</span></div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// The relative GAP is a normalized version of the absolute GAP (defined on</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// absolute_gap_tolerance), where the normalization is solver-dependent, e.g.</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// the absolute GAP divided by the objective value of the best feasible</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// solution found.</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="comment">// The solver can stop once the relative GAP is at most relative_gap_tolerance</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="comment">// (when set), and return TerminationReason::kOptimal.</span></div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// Must be >= 0 if set.</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// See also absolute_gap_tolerance.</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a5b0ee6745311a111aa402ad6c029c1ff"> 286</a></span> std::optional<double> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a5b0ee6745311a111aa402ad6c029c1ff">relative_gap_tolerance</a>;</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> </div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// The algorithm for solving a linear program. If nullopt, use the solver</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// default algorithm.</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// For problems that are not linear programs but where linear programming is</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// a subroutine, solvers may use this value. E.g. MIP solvers will typically</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// use this for the root LP solve only (and use dual simplex otherwise).</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a60dcc868cf2c99069fcbcbdefe359f52"> 294</a></span> std::optional<LPAlgorithm> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a60dcc868cf2c99069fcbcbdefe359f52">lp_algorithm</a>;</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> </div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// Effort on simplifying the problem before starting the main algorithm, or</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// the solver default effort level if unset.</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a6c37a9b3c9533bc192f78ffa2bfe8936"> 298</a></span> std::optional<Emphasis> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a6c37a9b3c9533bc192f78ffa2bfe8936">presolve</a>;</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> </div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="comment">// Effort on getting a stronger LP relaxation (MIP only) or the solver default</span></div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="comment">// effort level if unset.</span></div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="comment">// NOTE: disabling cuts may prevent callbacks from having a chance to add cuts</span></div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="comment">// at MIP_NODE, this behavior is solver specific.</span></div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#adb4a58bc44cad2e8baa3a0ed5047adb9"> 305</a></span> std::optional<Emphasis> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#adb4a58bc44cad2e8baa3a0ed5047adb9">cuts</a>;</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> </div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="comment">// Effort in finding feasible solutions beyond those encountered in the</span></div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// complete search procedure (MIP only), or the solver default effort level if</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="comment">// unset.</span></div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a3b9a899fc3cdf022551dd453c4b7b14f"> 310</a></span> std::optional<Emphasis> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a3b9a899fc3cdf022551dd453c4b7b14f">heuristics</a>;</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// Effort in rescaling the problem to improve numerical stability, or the</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// solver default effort level if unset.</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a11f39e94bb1a313c4fb3bd9303dfe516"> 314</a></span> std::optional<Emphasis> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a11f39e94bb1a313c4fb3bd9303dfe516">scaling</a>;</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> </div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a1f73616d2b7766c9d2ca8c9096ab0904"> 316</a></span> GScipParameters <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a1f73616d2b7766c9d2ca8c9096ab0904">gscip</a>;</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a967d40e1837a8d1fe03d32bff9a58286"> 317</a></span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html">GurobiParameters</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a967d40e1837a8d1fe03d32bff9a58286">gurobi</a>;</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#af85ee751fe5055e2f22a63fe44524a08"> 318</a></span> glop::GlopParameters <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#af85ee751fe5055e2f22a63fe44524a08">glop</a>;</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#ab79d691db3838c51dfafc14a0dc21fd9"> 319</a></span> sat::SatParameters <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#ab79d691db3838c51dfafc14a0dc21fd9">cp_sat</a>;</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> </div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> SolveParametersProto <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a9bd12b71646ba8d047a6d58c2688d51f">Proto</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keyword">static</span> absl::StatusOr<SolveParameters> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a94c967b2838f46f9ceb769101242d058">FromProto</a>(</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keyword">const</span> SolveParametersProto& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a>);</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span>};</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> </div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span>} <span class="comment">// namespace math_opt</span></div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> </div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_MATH_OPT_CPP_PARAMETERS_H_</span></div>
|
|
<div class="ttc" id="aclassgtl_1_1linked__hash__map_html"><div class="ttname"><a href="classgtl_1_1linked__hash__map.html">gtl::linked_hash_map< std::string, std::string ></a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1linked__hash__map_html_a644718bb2fb240de962dc3c9a1fdf0dc"><div class="ttname"><a href="classgtl_1_1linked__hash__map.html#a644718bb2fb240de962dc3c9a1fdf0dc">gtl::linked_hash_map::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="linked__hash__map_8h_source.html#l00275">linked_hash_map.h:275</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_aed003f5eb5197bc586b7ef2c36a63da2"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#aed003f5eb5197bc586b7ef2c36a63da2">proto</a></div><div class="ttdeci">CpModelProto proto</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00118">cp_model_fz_solver.cc:118</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="aenums_8h_html"><div class="ttname"><a href="enums_8h.html">enums.h</a></div></div>
|
|
<div class="ttc" id="alinked__hash__map_8h_html"><div class="ttname"><a href="linked__hash__map_8h.html">linked_hash_map.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html">operations_research::math_opt</a></div><div class="ttdef"><b>Definition:</b> <a href="arrow__operator__proxy_8h_source.html#l00020">arrow_operator_proxy.h:20</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4de967bf2b2e0ba7775f8b25676dada7"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7">operations_research::math_opt::Emphasis</a></div><div class="ttdeci">Emphasis</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00127">parameters.h:127</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4de967bf2b2e0ba7775f8b25676dada7a3ce9d817402b59f65fb01ea044bb1ee9"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7a3ce9d817402b59f65fb01ea044bb1ee9">operations_research::math_opt::Emphasis::kMedium</a></div><div class="ttdeci">@ kMedium</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4de967bf2b2e0ba7775f8b25676dada7aa022f15e910eb36278094efb6e808a07"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7aa022f15e910eb36278094efb6e808a07">operations_research::math_opt::Emphasis::kHigh</a></div><div class="ttdeci">@ kHigh</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4de967bf2b2e0ba7775f8b25676dada7ab19e80cac5b7f585659031a6cff1489b"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7ab19e80cac5b7f585659031a6cff1489b">operations_research::math_opt::Emphasis::kVeryHigh</a></div><div class="ttdeci">@ kVeryHigh</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4de967bf2b2e0ba7775f8b25676dada7acc9ab5e60ac2a9a675ba64bf4bb49dc8"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7acc9ab5e60ac2a9a675ba64bf4bb49dc8">operations_research::math_opt::Emphasis::kOff</a></div><div class="ttdeci">@ kOff</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a4de967bf2b2e0ba7775f8b25676dada7acd8fe42741a3bbc973bbf1d404afeff4"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a4de967bf2b2e0ba7775f8b25676dada7acd8fe42741a3bbc973bbf1d404afeff4">operations_research::math_opt::Emphasis::kLow</a></div><div class="ttdeci">@ kLow</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a6539b726794dda80e1570435b74b96f8"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a6539b726794dda80e1570435b74b96f8">operations_research::math_opt::MATH_OPT_DEFINE_ENUM</a></div><div class="ttdeci">MATH_OPT_DEFINE_ENUM(CallbackEvent, CALLBACK_EVENT_UNSPECIFIED)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a8b06041d7c1fb05f379714f4312306ec"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ec">operations_research::math_opt::SolverType</a></div><div class="ttdeci">SolverType</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00037">parameters.h:37</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a8b06041d7c1fb05f379714f4312306eca30143491c833be17bff959fa79c72bda"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306eca30143491c833be17bff959fa79c72bda">operations_research::math_opt::SolverType::kGscip</a></div><div class="ttdeci">@ kGscip</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a8b06041d7c1fb05f379714f4312306eca44e5c1d9f55c30721e6b79c5ca328a62"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306eca44e5c1d9f55c30721e6b79c5ca328a62">operations_research::math_opt::SolverType::kCpSat</a></div><div class="ttdeci">@ kCpSat</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a8b06041d7c1fb05f379714f4312306eca512b5059e1ca814e697fb191d93aaf7f"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306eca512b5059e1ca814e697fb191d93aaf7f">operations_research::math_opt::SolverType::kGlop</a></div><div class="ttdeci">@ kGlop</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a8b06041d7c1fb05f379714f4312306ecabc8ddfb8a00bb405e68545ce187ac238"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ecabc8ddfb8a00bb405e68545ce187ac238">operations_research::math_opt::SolverType::kGurobi</a></div><div class="ttdeci">@ kGurobi</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a8b06041d7c1fb05f379714f4312306ecae2a40eea095a7c19652eff4af08a9144"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a8b06041d7c1fb05f379714f4312306ecae2a40eea095a7c19652eff4af08a9144">operations_research::math_opt::SolverType::kGlpk</a></div><div class="ttdeci">@ kGlpk</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a90811b426f82fd0533888ec9090e4fce"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a90811b426f82fd0533888ec9090e4fce">operations_research::math_opt::AbslParseFlag</a></div><div class="ttdeci">bool AbslParseFlag(const absl::string_view text, SolverType *const value, std::string *const error)</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8cc_source.html#l00061">parameters.cc:61</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a9e7ad1d70792e12d16dc22cd63028e77"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a9e7ad1d70792e12d16dc22cd63028e77">operations_research::math_opt::AbslUnparseFlag</a></div><div class="ttdeci">std::string AbslUnparseFlag(const SolverType value)</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8cc_source.html#l00073">parameters.cc:73</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad410f2eb7db3432ebaa22c809eaa7212"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212">operations_research::math_opt::LPAlgorithm</a></div><div class="ttdeci">LPAlgorithm</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00094">parameters.h:94</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad410f2eb7db3432ebaa22c809eaa7212a3109cf29ac1c83cbca48b23c11ca88fb"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212a3109cf29ac1c83cbca48b23c11ca88fb">operations_research::math_opt::LPAlgorithm::kPrimalSimplex</a></div><div class="ttdeci">@ kPrimalSimplex</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad410f2eb7db3432ebaa22c809eaa7212ac3a659d06e6ead2ed2179ebbfefc0734"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad410f2eb7db3432ebaa22c809eaa7212ac3a659d06e6ead2ed2179ebbfefc0734">operations_research::math_opt::LPAlgorithm::kDualSimplex</a></div><div class="ttdeci">@ kDualSimplex</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4f0b2adea9a4297f27df941fe3ed3831affa5976cb7170d234d6b69921bf0f085"><div class="ttname"><a href="namespaceoperations__research.html#a4f0b2adea9a4297f27df941fe3ed3831affa5976cb7170d234d6b69921bf0f085">operations_research::MPCallbackEvent::kBarrier</a></div><div class="ttdeci">@ kBarrier</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_gurobi_parameters_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html">operations_research::math_opt::GurobiParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00152">parameters.h:152</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_gurobi_parameters_html_a35971ccf0d56f080fe88cad9e5ef55d0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#a35971ccf0d56f080fe88cad9e5ef55d0">operations_research::math_opt::GurobiParameters::FromProto</a></div><div class="ttdeci">static GurobiParameters FromProto(const GurobiParametersProto &proto)</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8cc_source.html#l00135">parameters.cc:135</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_gurobi_parameters_html_a644718bb2fb240de962dc3c9a1fdf0dc"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#a644718bb2fb240de962dc3c9a1fdf0dc">operations_research::math_opt::GurobiParameters::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00159">parameters.h:159</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_gurobi_parameters_html_ab6c6b7e079ea960ca2d802ee30a3a919"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#ab6c6b7e079ea960ca2d802ee30a3a919">operations_research::math_opt::GurobiParameters::Proto</a></div><div class="ttdeci">GurobiParametersProto Proto() const</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8cc_source.html#l00125">parameters.cc:125</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_gurobi_parameters_html_adb43fff359863070c805fa5cb921655f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_gurobi_parameters.html#adb43fff359863070c805fa5cb921655f">operations_research::math_opt::GurobiParameters::param_values</a></div><div class="ttdeci">gtl::linked_hash_map< std::string, std::string > param_values</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00154">parameters.h:154</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html">operations_research::math_opt::SolveParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00175">parameters.h:175</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a045f4ae0164882a0f94ef4ca0c588c63"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a045f4ae0164882a0f94ef4ca0c588c63">operations_research::math_opt::SolveParameters::best_bound_limit</a></div><div class="ttdeci">std::optional< double > best_bound_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00228">parameters.h:228</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a11f39e94bb1a313c4fb3bd9303dfe516"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a11f39e94bb1a313c4fb3bd9303dfe516">operations_research::math_opt::SolveParameters::scaling</a></div><div class="ttdeci">std::optional< Emphasis > scaling</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00314">parameters.h:314</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a1c761a136563e784c0212d3f22e9529e"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a1c761a136563e784c0212d3f22e9529e">operations_research::math_opt::SolveParameters::solution_limit</a></div><div class="ttdeci">std::optional< int32_t > solution_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00240">parameters.h:240</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a1f73616d2b7766c9d2ca8c9096ab0904"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a1f73616d2b7766c9d2ca8c9096ab0904">operations_research::math_opt::SolveParameters::gscip</a></div><div class="ttdeci">GScipParameters gscip</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00316">parameters.h:316</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a2ec1cbffcca0b4f069643c74bafbb416"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a2ec1cbffcca0b4f069643c74bafbb416">operations_research::math_opt::SolveParameters::enable_output</a></div><div class="ttdeci">bool enable_output</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00182">parameters.h:182</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a2f87eac3d8c6fbf56c27b9c79a619dc2"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a2f87eac3d8c6fbf56c27b9c79a619dc2">operations_research::math_opt::SolveParameters::time_limit</a></div><div class="ttdeci">absl::Duration time_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00188">parameters.h:188</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a3a05f9c24e622394220e7f5554406505"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a3a05f9c24e622394220e7f5554406505">operations_research::math_opt::SolveParameters::node_limit</a></div><div class="ttdeci">std::optional< int64_t > node_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00204">parameters.h:204</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a3b9a899fc3cdf022551dd453c4b7b14f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a3b9a899fc3cdf022551dd453c4b7b14f">operations_research::math_opt::SolveParameters::heuristics</a></div><div class="ttdeci">std::optional< Emphasis > heuristics</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00310">parameters.h:310</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a415d2993b6d4c08587fde450b930f377"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a415d2993b6d4c08587fde450b930f377">operations_research::math_opt::SolveParameters::absolute_gap_tolerance</a></div><div class="ttdeci">std::optional< double > absolute_gap_tolerance</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00271">parameters.h:271</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a5b0ee6745311a111aa402ad6c029c1ff"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a5b0ee6745311a111aa402ad6c029c1ff">operations_research::math_opt::SolveParameters::relative_gap_tolerance</a></div><div class="ttdeci">std::optional< double > relative_gap_tolerance</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00286">parameters.h:286</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a60dcc868cf2c99069fcbcbdefe359f52"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a60dcc868cf2c99069fcbcbdefe359f52">operations_research::math_opt::SolveParameters::lp_algorithm</a></div><div class="ttdeci">std::optional< LPAlgorithm > lp_algorithm</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00294">parameters.h:294</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a6c37a9b3c9533bc192f78ffa2bfe8936"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a6c37a9b3c9533bc192f78ffa2bfe8936">operations_research::math_opt::SolveParameters::presolve</a></div><div class="ttdeci">std::optional< Emphasis > presolve</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00298">parameters.h:298</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a7ca5ca47c6443a869fc42668c88448a2"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a7ca5ca47c6443a869fc42668c88448a2">operations_research::math_opt::SolveParameters::random_seed</a></div><div class="ttdeci">std::optional< int32_t > random_seed</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00258">parameters.h:258</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a8112e07adcce45fb4e3dc39b01aa4875"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a8112e07adcce45fb4e3dc39b01aa4875">operations_research::math_opt::SolveParameters::threads</a></div><div class="ttdeci">std::optional< int32_t > threads</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00243">parameters.h:243</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a94c967b2838f46f9ceb769101242d058"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a94c967b2838f46f9ceb769101242d058">operations_research::math_opt::SolveParameters::FromProto</a></div><div class="ttdeci">static absl::StatusOr< SolveParameters > FromProto(const SolveParametersProto &proto)</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8cc_source.html#l00193">parameters.cc:193</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a967d40e1837a8d1fe03d32bff9a58286"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a967d40e1837a8d1fe03d32bff9a58286">operations_research::math_opt::SolveParameters::gurobi</a></div><div class="ttdeci">GurobiParameters gurobi</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00317">parameters.h:317</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_a9bd12b71646ba8d047a6d58c2688d51f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#a9bd12b71646ba8d047a6d58c2688d51f">operations_research::math_opt::SolveParameters::Proto</a></div><div class="ttdeci">SolveParametersProto Proto() const</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8cc_source.html#l00144">parameters.cc:144</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_ab79d691db3838c51dfafc14a0dc21fd9"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#ab79d691db3838c51dfafc14a0dc21fd9">operations_research::math_opt::SolveParameters::cp_sat</a></div><div class="ttdeci">sat::SatParameters cp_sat</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00319">parameters.h:319</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_acf9855ade06415e74329250380b14a14"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#acf9855ade06415e74329250380b14a14">operations_research::math_opt::SolveParameters::objective_limit</a></div><div class="ttdeci">std::optional< double > objective_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00221">parameters.h:221</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_adb4a58bc44cad2e8baa3a0ed5047adb9"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#adb4a58bc44cad2e8baa3a0ed5047adb9">operations_research::math_opt::SolveParameters::cuts</a></div><div class="ttdeci">std::optional< Emphasis > cuts</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00305">parameters.h:305</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_adef25d8fac985971efcf57bb9f54d96a"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#adef25d8fac985971efcf57bb9f54d96a">operations_research::math_opt::SolveParameters::iteration_limit</a></div><div class="ttdeci">std::optional< int64_t > iteration_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00197">parameters.h:197</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_aee4d634e8c30d7c38bd91a5f35666617"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#aee4d634e8c30d7c38bd91a5f35666617">operations_research::math_opt::SolveParameters::cutoff_limit</a></div><div class="ttdeci">std::optional< double > cutoff_limit</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00217">parameters.h:217</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_parameters_html_af85ee751fe5055e2f22a63fe44524a08"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_parameters.html#af85ee751fe5055e2f22a63fe44524a08">operations_research::math_opt::SolveParameters::glop</a></div><div class="ttdeci">glop::GlopParameters glop</div><div class="ttdef"><b>Definition:</b> <a href="parameters_8h_source.html#l00318">parameters.h:318</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_1defc00030ff81d309105e053121082f.html">math_opt</a></li><li class="navelem"><a class="el" href="dir_dd5645fbbabcdccb47d1d6db92f0f35b.html">cpp</a></li><li class="navelem"><a class="el" href="parameters_8h.html">parameters.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|