always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
560826496b0f15793ce2ee3dfffb3bee2abfddec
ortools-clone/docs/cpp/lp__solver_8h_source.html
Mizux Seiha 17edcf0e25 Update doc
2021-09-30 01:28:18 +02:00

420 lines
73 KiB
HTML
Raw Blame History

<!-- 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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: lp_solver.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
&#160;<span id="projectnumber">9.1</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;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&amp;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&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('lp__solver_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">lp_solver.h</div></div>
</div><!--header-->
<div class="contents">
<a href="lp__solver_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 &quot;License&quot;);</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 &quot;AS IS&quot; 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_GLOP_LP_SOLVER_H_</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_GLOP_LP_SOLVER_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 &lt;memory&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include &quot;<a class="code" href="parameters_8pb_8h.html">ortools/glop/parameters.pb.h</a>&quot;</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include &quot;<a class="code" href="preprocessor_8h.html">ortools/glop/preprocessor.h</a>&quot;</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include &quot;<a class="code" href="lp__data_8h.html">ortools/lp_data/lp_data.h</a>&quot;</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &quot;<a class="code" href="lp__types_8h.html">ortools/lp_data/lp_types.h</a>&quot;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &quot;<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>&quot;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword">namespace </span>glop {</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment">// A full-fledged linear programming solver.</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html"> 29</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1glop_1_1_l_p_solver.html">LPSolver</a> {</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a1a5c13133724d1d457de6c3c7ce9df85">LPSolver</a>();</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="comment">// Sets and gets the solver parameters.</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// See the proto for an extensive documentation.</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae7202d055b6b172a8a1da4f5b136f9ea">SetParameters</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_glop_parameters.html">GlopParameters</a>&amp; <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_glop_parameters.html">GlopParameters</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a01f64f8af66c6c5a66d3b4ebc868cab6">GetParameters</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_glop_parameters.html">GlopParameters</a>* <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a71b04920d660067fdb3d2f4eaa5c7dc0">GetMutableParameters</a>();</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Solves the given linear program and returns the solve status. See the</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// ProblemStatus documentation for a description of the different values.</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">//</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// The solution can be retrieved afterwards using the getter functions below.</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// Note that depending on the returned ProblemStatus the solution values may</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// not mean much, so it is important to check the returned status.</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">// Incrementality: From one Solve() call to the next, the internal state is</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// not cleared and the solver may take advantage of its current state if the</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// given lp is only slightly modified. If the modification is too important,</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// or if the solver does not see how to reuse the previous state efficiently,</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// it will just solve the problem from scratch. On the other hand, if the lp</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// is the same, calling Solve() again should basically resume the solve from</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// the last position. To disable this behavior, simply call Clear() before.</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> ABSL_MUST_USE_RESULT <a class="code hl_enumeration" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">ProblemStatus</a> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad0677fd7b636de2bffe3cffca65dcd20">Solve</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// Same as Solve() but use the given time limit rather than constructing a new</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// one from the current GlopParameters.</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> ABSL_MUST_USE_RESULT <a class="code hl_enumeration" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">ProblemStatus</a> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae3f158ad37c1fe375d465875fb8130f2">SolveWithTimeLimit</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>);</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// Puts the solver in a clean state.</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">//</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// Calling Solve() for the first time, or calling Clear() then Solve() on the</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// same problem is guaranted to be deterministic and to always give the same</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// result, assuming that no time limit was specified.</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// Advanced usage. This should be called before calling Solve(). It will</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// configure the solver to try to start from the given point for the next</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Solve() only. Note that calling Clear() will invalidate this information.</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">//</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// If the set of variables/constraints with a BASIC status does not form a</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// basis a warning will be logged and the code will ignore it. Otherwise, the</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// non-basic variables will be initialized to their given status and solving</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// will start from there (even if the solution is not primal/dual feasible).</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">//</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// Important: There is no facility to transform this information in sync with</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// presolve. So you should probably disable presolve when using this since</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// otherwise there is a good chance that the matrix will change and that the</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// given basis will make no sense. Even worse if it happens to be factorizable</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// but doesn&#39;t correspond to what was intended.</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a2b709dbbb97458a4e417e9af9d57f0de">SetInitialBasis</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">VariableStatusRow</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a587e99631d7ffd6bbf51d9fa472e7a57">variable_statuses</a>,</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">ConstraintStatusColumn</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a89f0453d28020b22404863dbe8edc61d">constraint_statuses</a>);</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// This loads a given solution and computes related quantities so that the</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// getters below will refer to it.</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="comment">//</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// Depending on the given solution status, this also checks the solution</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// feasibility or optimality. The exact behavior and tolerances are controlled</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// by the solver parameters. Because of this, the returned ProblemStatus may</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// be changed from the one passed in the ProblemSolution to ABNORMAL or</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// IMPRECISE. Note that this is the same logic as the one used by Solve() to</span></div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// verify the solver solution.</span></div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">ProblemStatus</a> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ab602b3b0fbd3d46d7ed5aefa466b2122">LoadAndVerifySolution</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1glop_1_1_problem_solution.html">ProblemSolution</a>&amp; solution);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// Returns the objective value of the solution with its offset and scaling.</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a96c1f660991b5007ca24564f69cd27b8">GetObjectiveValue</a>() <span class="keyword">const</span>;</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">// Accessors to information related to variables.</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ac5d36607cb29127a9ce5f6d6e7c140eb"> 100</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseRow</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ac5d36607cb29127a9ce5f6d6e7c140eb">variable_values</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> primal_values_; }</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad051b9aae6b4998741c4aae97a458572"> 101</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseRow</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad051b9aae6b4998741c4aae97a458572">reduced_costs</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> reduced_costs_; }</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a587e99631d7ffd6bbf51d9fa472e7a57"> 102</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">VariableStatusRow</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a587e99631d7ffd6bbf51d9fa472e7a57">variable_statuses</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">return</span> variable_statuses_;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> }</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// Accessors to information related to constraints. The activity of a</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// constraint is the sum of its linear terms evaluated with variables taking</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// their values at the current solution.</span></div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">//</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// Note that the dual_values() do not take into account an eventual objective</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// scaling of the solved LinearProgram.</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a4eed9d69f6b1a5eb13257065c6d3beb1"> 112</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseColumn</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a4eed9d69f6b1a5eb13257065c6d3beb1">dual_values</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dual_values_; }</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html#aff475d9f1b231153860991e0e981b10e"> 113</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseColumn</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#aff475d9f1b231153860991e0e981b10e">constraint_activities</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="keywordflow">return</span> constraint_activities_;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> }</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a89f0453d28020b22404863dbe8edc61d"> 116</a></span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">ConstraintStatusColumn</a>&amp; <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a89f0453d28020b22404863dbe8edc61d">constraint_statuses</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> constraint_statuses_;</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// Returns the primal maximum infeasibility of the solution.</span></div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// This indicates by how much the variable and constraint bounds are violated.</span></div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a93c5d1b426be6c8173f4f0efbdcf2132">GetMaximumPrimalInfeasibility</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// Returns the dual maximum infeasibility of the solution.</span></div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// This indicates by how much the variable costs (i.e. objective) should be</span></div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// modified for the solution to be an exact optimal solution.</span></div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a7767c9dc7ffc1643260017dd5817d6d3">GetMaximumDualInfeasibility</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// Returns true if the solution status was OPTIMAL and it seems that there is</span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// more than one basic optimal solution. Note that this solver always returns</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// an optimal BASIC solution and that there is only a finite number of them.</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// Moreover, given one basic solution, since the basis is always refactorized</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// at optimality before reporting the numerical result, then all the</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// quantities (even the floating point ones) should be always the same.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">//</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// TODO(user): Test this behavior extensively if a client relies on it.</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#a41d6e69ea587dda35dbe4b5f07dd6bd8">MayHaveMultipleOptimalSolutions</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// Returns the number of simplex iterations used by the last Solve().</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#af4b325af2d4c849c39bd4a02f32f9cae">GetNumberOfSimplexIterations</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// Returns the &quot;deterministic time&quot; since the creation of the solver. Note</span></div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// That this time is only increased when some operations take place in this</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// class.</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">//</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// TODO(user): Currently, this is only modified when the simplex code is</span></div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// executed.</span></div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">//</span></div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// TODO(user): Improve the correlation with the running time.</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1glop_1_1_l_p_solver.html#aeccc8138b268e621d96d105e0ddd474a">DeterministicTime</a>() <span class="keyword">const</span>;</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> </div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Resizes all the solution vectors to the given sizes.</span></div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// This is used in case of error to make sure all the getter functions will</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// not crash when given row/col inside the initial linear program dimension.</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">void</span> ResizeSolution(RowIndex num_rows, ColIndex num_cols);</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> </div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// Make sure the primal and dual values are within their bounds in order to</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// have a strong guarantee on the optimal solution. See</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// provide_strong_optimal_guarantee in the GlopParameters proto.</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordtype">void</span> MovePrimalValuesWithinBounds(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordtype">void</span> MoveDualValuesWithinBounds(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> </div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// Runs the revised simplex algorithm if needed (i.e. if the program was not</span></div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// already solved by the preprocessors).</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordtype">void</span> RunRevisedSimplexIfNeeded(<a class="code hl_struct" href="structoperations__research_1_1glop_1_1_problem_solution.html">ProblemSolution</a>* solution,</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> </div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// Checks that the returned solution values and statuses are consistent.</span></div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// Returns true if this is the case. See the code for the exact check</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// performed.</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordtype">bool</span> IsProblemSolutionConsistent(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1glop_1_1_problem_solution.html">ProblemSolution</a>&amp; solution) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// Returns true if there may be multiple optimal solutions.</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// The return value is true if:</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// - a non-fixed variable, at one of its boumds, has its reduced</span></div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// cost close to zero.</span></div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// or if:</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// - a non-equality constraint (i.e. l &lt;= a.x &lt;= r, with l != r), is at one of</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// its bounds (a.x = r or a.x = l) and has its dual value close to zero.</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordtype">bool</span> IsOptimalSolutionOnFacet(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</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">// Computes derived quantities from the solution.</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordtype">void</span> ComputeReducedCosts(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordtype">void</span> ComputeConstraintActivities(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> </div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// Computes the primal/dual objectives (without the offset). Note that the</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// dual objective needs the reduced costs in addition to the dual values.</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordtype">double</span> ComputeObjective(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keywordtype">double</span> ComputeDualObjective(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> </div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// Given a relative precision on the primal values of up to</span></div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// solution_feasibility_tolerance(), this returns an upper bound on the</span></div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// expected precision of the objective.</span></div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keywordtype">double</span> ComputeMaxExpectedObjectiveError(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp);</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// Returns the max absolute cost pertubation (resp. rhs perturbation) so that</span></div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// the pair (primal values, dual values) is an EXACT optimal solution to the</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// perturbed problem. Note that this assumes that</span></div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// MovePrimalValuesWithinBounds() and MoveDualValuesWithinBounds() have</span></div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// already been called. The Boolean is_too_large is set to true if any of the</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// perturbation exceed the tolerance (which depends of the coordinate).</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="comment">//</span></div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// These bounds are computed using the variable and constraint statuses by</span></div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// enforcing the complementary slackness optimal conditions. Note that they</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="comment">// are almost the same as ComputeActivityInfeasibility() and</span></div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// ComputeReducedCostInfeasibility() but looks for optimality rather than just</span></div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// feasibility.</span></div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">//</span></div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// Note(user): We could get EXACT bounds on these perturbations by changing</span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// the rounding mode appropriately during these computations. But this is</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// probably not needed.</span></div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> ComputeMaxCostPerturbationToEnforceOptimality(</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp, <span class="keywordtype">bool</span>* is_too_large);</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> ComputeMaxRhsPerturbationToEnforceOptimality(</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp, <span class="keywordtype">bool</span>* is_too_large);</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">// Computes the maximum of the infeasibilities associated with each values.</span></div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// The returned infeasibilities are the maximum of the &quot;absolute&quot; errors of</span></div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// each vector coefficients.</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">//</span></div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// These function also set is_too_large to true if any infeasibility is</span></div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// greater than the tolerance (which depends of the coordinate).</span></div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordtype">double</span> ComputePrimalValueInfeasibility(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordtype">bool</span>* is_too_large);</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">double</span> ComputeActivityInfeasibility(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordtype">bool</span>* is_too_large);</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordtype">double</span> ComputeDualValueInfeasibility(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordtype">bool</span>* is_too_large);</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordtype">double</span> ComputeReducedCostInfeasibility(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a>&amp; lp,</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="keywordtype">bool</span>* is_too_large);</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> </div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// On a call to Solve(), this is initialized to an exact copy of the given</span></div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// linear program. It is later modified by the preprocessors and then solved</span></div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// by the revised simplex.</span></div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="comment">//</span></div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// This is not efficient memory-wise but allows to check optimality with</span></div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// respect to the given LinearProgram that is guaranteed to not have been</span></div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// modified. It also allows for a nicer Solve() API with a const</span></div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// LinearProgram&amp; input.</span></div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_linear_program.html">LinearProgram</a> current_linear_program_;</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="comment">// The revised simplex solver.</span></div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> std::unique_ptr&lt;RevisedSimplex&gt; revised_simplex_;</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> </div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// The number of revised simplex iterations used by the last Solve().</span></div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordtype">int</span> num_revised_simplex_iterations_;</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> </div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// The current ProblemSolution.</span></div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// TODO(user): use a ProblemSolution directly?</span></div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseRow</a> primal_values_;</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseColumn</a> dual_values_;</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">VariableStatusRow</a> variable_statuses_;</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">ConstraintStatusColumn</a> constraint_statuses_;</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> </div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// Quantities computed from the solution and the linear program.</span></div>
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseRow</a> reduced_costs_;</div>
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">DenseColumn</a> constraint_activities_;</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> problem_objective_value_;</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keywordtype">bool</span> may_have_multiple_solutions_;</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> max_absolute_primal_infeasibility_;</div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <a class="code hl_typedef" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> max_absolute_dual_infeasibility_;</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> </div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// Proto holding all the parameters of the algorithm.</span></div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_glop_parameters.html">GlopParameters</a> parameters_;</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> </div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// The number of times Solve() was called. Used to number dump files.</span></div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordtype">int</span> num_solves_;</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> </div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> DISALLOW_COPY_AND_ASSIGN(<a class="code hl_class" href="classoperations__research_1_1glop_1_1_l_p_solver.html">LPSolver</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> </div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span>} <span class="comment">// namespace glop</span></div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span>} <span class="comment">// namespace operations_research</span></div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> </div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_GLOP_LP_SOLVER_H_</span></div>
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_glop_parameters_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_glop_parameters.html">operations_research::glop::GlopParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="parameters_8pb_8h_source.html#l00194">parameters.pb.h:195</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html">operations_research::glop::LPSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00029">lp_solver.h:29</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a01f64f8af66c6c5a66d3b4ebc868cab6"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a01f64f8af66c6c5a66d3b4ebc868cab6">operations_research::glop::LPSolver::GetParameters</a></div><div class="ttdeci">const GlopParameters &amp; GetParameters() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00128">lp_solver.cc:128</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a1a5c13133724d1d457de6c3c7ce9df85"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a1a5c13133724d1d457de6c3c7ce9df85">operations_research::glop::LPSolver::LPSolver</a></div><div class="ttdeci">LPSolver()</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00114">lp_solver.cc:114</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a2b709dbbb97458a4e417e9af9d57f0de"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a2b709dbbb97458a4e417e9af9d57f0de">operations_research::glop::LPSolver::SetInitialBasis</a></div><div class="ttdeci">void SetInitialBasis(const VariableStatusRow &amp;variable_statuses, const ConstraintStatusColumn &amp;constraint_statuses)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00241">lp_solver.cc:241</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a41d6e69ea587dda35dbe4b5f07dd6bd8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a41d6e69ea587dda35dbe4b5f07dd6bd8">operations_research::glop::LPSolver::MayHaveMultipleOptimalSolutions</a></div><div class="ttdeci">bool MayHaveMultipleOptimalSolutions() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00499">lp_solver.cc:499</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a4eed9d69f6b1a5eb13257065c6d3beb1"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a4eed9d69f6b1a5eb13257065c6d3beb1">operations_research::glop::LPSolver::dual_values</a></div><div class="ttdeci">const DenseColumn &amp; dual_values() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00112">lp_solver.h:112</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a587e99631d7ffd6bbf51d9fa472e7a57"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a587e99631d7ffd6bbf51d9fa472e7a57">operations_research::glop::LPSolver::variable_statuses</a></div><div class="ttdeci">const VariableStatusRow &amp; variable_statuses() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00102">lp_solver.h:102</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a71b04920d660067fdb3d2f4eaa5c7dc0"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a71b04920d660067fdb3d2f4eaa5c7dc0">operations_research::glop::LPSolver::GetMutableParameters</a></div><div class="ttdeci">GlopParameters * GetMutableParameters()</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00130">lp_solver.cc:130</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a7767c9dc7ffc1643260017dd5817d6d3"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a7767c9dc7ffc1643260017dd5817d6d3">operations_research::glop::LPSolver::GetMaximumDualInfeasibility</a></div><div class="ttdeci">Fractional GetMaximumDualInfeasibility() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00495">lp_solver.cc:495</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a89f0453d28020b22404863dbe8edc61d"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a89f0453d28020b22404863dbe8edc61d">operations_research::glop::LPSolver::constraint_statuses</a></div><div class="ttdeci">const ConstraintStatusColumn &amp; constraint_statuses() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00116">lp_solver.h:116</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a93c5d1b426be6c8173f4f0efbdcf2132"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a93c5d1b426be6c8173f4f0efbdcf2132">operations_research::glop::LPSolver::GetMaximumPrimalInfeasibility</a></div><div class="ttdeci">Fractional GetMaximumPrimalInfeasibility() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00491">lp_solver.cc:491</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_a96c1f660991b5007ca24564f69cd27b8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#a96c1f660991b5007ca24564f69cd27b8">operations_research::glop::LPSolver::GetObjectiveValue</a></div><div class="ttdeci">Fractional GetObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00487">lp_solver.cc:487</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::glop::LPSolver::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00236">lp_solver.cc:236</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ab602b3b0fbd3d46d7ed5aefa466b2122"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ab602b3b0fbd3d46d7ed5aefa466b2122">operations_research::glop::LPSolver::LoadAndVerifySolution</a></div><div class="ttdeci">ProblemStatus LoadAndVerifySolution(const LinearProgram &amp;lp, const ProblemSolution &amp;solution)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00295">lp_solver.cc:295</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ac5d36607cb29127a9ce5f6d6e7c140eb"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ac5d36607cb29127a9ce5f6d6e7c140eb">operations_research::glop::LPSolver::variable_values</a></div><div class="ttdeci">const DenseRow &amp; variable_values() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00100">lp_solver.h:100</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ad051b9aae6b4998741c4aae97a458572"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad051b9aae6b4998741c4aae97a458572">operations_research::glop::LPSolver::reduced_costs</a></div><div class="ttdeci">const DenseRow &amp; reduced_costs() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00101">lp_solver.h:101</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ad0677fd7b636de2bffe3cffca65dcd20"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ad0677fd7b636de2bffe3cffca65dcd20">operations_research::glop::LPSolver::Solve</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT ProblemStatus Solve(const LinearProgram &amp;lp)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00132">lp_solver.cc:132</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ae3f158ad37c1fe375d465875fb8130f2"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae3f158ad37c1fe375d465875fb8130f2">operations_research::glop::LPSolver::SolveWithTimeLimit</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT ProblemStatus SolveWithTimeLimit(const LinearProgram &amp;lp, TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00138">lp_solver.cc:138</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_ae7202d055b6b172a8a1da4f5b136f9ea"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#ae7202d055b6b172a8a1da4f5b136f9ea">operations_research::glop::LPSolver::SetParameters</a></div><div class="ttdeci">void SetParameters(const GlopParameters &amp;parameters)</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00116">lp_solver.cc:116</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_aeccc8138b268e621d96d105e0ddd474a"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#aeccc8138b268e621d96d105e0ddd474a">operations_research::glop::LPSolver::DeterministicTime</a></div><div class="ttdeci">double DeterministicTime() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00507">lp_solver.cc:507</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_af4b325af2d4c849c39bd4a02f32f9cae"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#af4b325af2d4c849c39bd4a02f32f9cae">operations_research::glop::LPSolver::GetNumberOfSimplexIterations</a></div><div class="ttdeci">int GetNumberOfSimplexIterations() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8cc_source.html#l00503">lp_solver.cc:503</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_l_p_solver_html_aff475d9f1b231153860991e0e981b10e"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_l_p_solver.html#aff475d9f1b231153860991e0e981b10e">operations_research::glop::LPSolver::constraint_activities</a></div><div class="ttdeci">const DenseColumn &amp; constraint_activities() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__solver_8h_source.html#l00113">lp_solver.h:113</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_linear_program_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html">operations_research::glop::LinearProgram</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00055">lp_data.h:55</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_strict_i_t_i_vector_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html">operations_research::glop::StrictITIVector&lt; ColIndex, VariableStatus &gt;</a></div></div>
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00116">cp_model_fz_solver.cc:116</a></div></div>
<div class="ttc" id="acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21"><div class="ttname"><a href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a></div><div class="ttdeci">ModelSharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02013">cp_model_solver.cc:2013</a></div></div>
<div class="ttc" id="alp__data_8h_html"><div class="ttname"><a href="lp__data_8h.html">lp_data.h</a></div></div>
<div class="ttc" id="alp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a733947145e3e1631165b618b05c9ccb7"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">operations_research::glop::Fractional</a></div><div class="ttdeci">double Fractional</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00078">lp_types.h:78</a></div></div>
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493">operations_research::glop::ProblemStatus</a></div><div class="ttdeci">ProblemStatus</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00102">lp_types.h:102</a></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="aparameters_8pb_8h_html"><div class="ttname"><a href="parameters_8pb_8h.html">parameters.pb.h</a></div></div>
<div class="ttc" id="apreprocessor_8h_html"><div class="ttname"><a href="preprocessor_8h.html">preprocessor.h</a></div></div>
<div class="ttc" id="astructoperations__research_1_1glop_1_1_problem_solution_html"><div class="ttname"><a href="structoperations__research_1_1glop_1_1_problem_solution.html">operations_research::glop::ProblemSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00657">lp_data.h:657</a></div></div>
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</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_747248fa8ec2ebcb4d8ad85ced34db0b.html">glop</a></li><li class="navelem"><a class="el" href="lp__solver_8h.html">lp_solver.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.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink