615 lines
129 KiB
HTML
615 lines
129 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: solve_result.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('solve__result_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">solve_result.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="solve__result_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_SOLVE_RESULT_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_SOLVE_RESULT_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 <optional></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "ortools/gscip/gscip.pb.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "<a class="code" href="model__storage_8h.html">ortools/math_opt/core/model_storage.h</a>"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</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="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="math__opt_2cpp_2linear__constraint_8h.html">ortools/math_opt/cpp/linear_constraint.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="solution_8h.html">ortools/math_opt/cpp/solution.h</a>"</span> <span class="comment">// IWYU pragma: export</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="variable__and__expressions_8h.html">ortools/math_opt/cpp/variable_and_expressions.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "ortools/math_opt/result.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">// Problem feasibility status as claimed by the solver (solver is not required</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// to return a certificate for the claim).</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7b"> 38</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7b">FeasibilityStatus</a> {</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Solver does not claim a status.</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a801be40a606301461ff812058569ee3ba180f453eb66237810dfc39ee46e04c9a">kUndetermined</a> = FEASIBILITY_STATUS_UNDETERMINED,</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> </div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// Solver claims the problem is feasible.</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a801be40a606301461ff812058569ee3ba6936fc811b6bf3bfd7c65ab1f48e3f1f">kFeasible</a> = FEASIBILITY_STATUS_FEASIBLE,</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Solver claims the problem is infeasible.</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa17b6104527f45be5034e00d3c14249faa4d66aafc8bcba36b995fd8be0483574">kInfeasible</a> = FEASIBILITY_STATUS_INFEASIBLE,</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span>};</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"><a class="line" href="namespaceoperations__research_1_1math__opt.html#afd61e5a9a83580286ce2e9a185642f94"> 49</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#a0b8aaa119fe5d1d7df5c0bedfdc15a7b">FeasibilityStatus</a>, FEASIBILITY_STATUS_UNSPECIFIED);</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">// Feasibility status of the primal problem and its dual (or the dual of a</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// continuous relaxation) as claimed by the solver. The solver is not required</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// to return a certificate for the claim (e.g. the solver may claim primal</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">// feasibility without returning a primal feasible solutuion). This combined</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// status gives a comprehensive description of a solver's claims about</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// feasibility and unboundedness of the solved problem. For instance,</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// * a feasible status for primal and dual problems indicates the primal is</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// feasible and bounded and likely has an optimal solution (guaranteed for</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment">// problems without non-linear constraints).</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment">// * a primal feasible and a dual infeasible status indicates the primal</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">// problem is unbounded (i.e. has arbitrarily good solutions).</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// Note that a dual infeasible status by itself (i.e. accompanied by an</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">// undetermined primal status) does not imply the primal problem is unbounded as</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">// we could have both problems be infeasible. Also, while a primal and dual</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment">// feasible status may imply the existence of an optimal solution, it does not</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment">// guarantee the solver has actually found such optimal solution.</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html"> 67</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_problem_status.html">ProblemStatus</a> {</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// Status for the primal problem.</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html#aa622f404d2ac79ac25cc432630525fda"> 69</a></span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7b">FeasibilityStatus</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_problem_status.html#aa622f404d2ac79ac25cc432630525fda">primal_status</a> = <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7ba180f453eb66237810dfc39ee46e04c9a">FeasibilityStatus::kUndetermined</a>;</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// Status for the dual problem (or for the dual of a continuous relaxation).</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html#a3d66a2dcf598fb5b1006e6ee524406de"> 72</a></span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7b">FeasibilityStatus</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_problem_status.html#a3d66a2dcf598fb5b1006e6ee524406de">dual_status</a> = <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7ba180f453eb66237810dfc39ee46e04c9a">FeasibilityStatus::kUndetermined</a>;</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// If true, the solver claims the primal or dual problem is infeasible, but</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// it does not know which (or if both are infeasible). Can be true only when</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// primal_problem_status = dual_problem_status = kUndetermined. This extra</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// information is often needed when preprocessing determines there is no</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// optimal solution to the problem (but can't determine if it is due to</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// infeasibility, unboundedness, or both).</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html#aad421cd241e09cc3485626c6d8956cd6"> 80</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_problem_status.html#aad421cd241e09cc3485626c6d8956cd6">primal_or_dual_infeasible</a> = <span class="keyword">false</span>;</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"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html#acc2ba2337184066983e9c402967c6373"> 82</a></span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_problem_status.html">ProblemStatus</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_problem_status.html#acc2ba2337184066983e9c402967c6373">FromProto</a>(</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">const</span> ProblemStatusProto& problem_status_proto);</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html#a44a4de2a68ed2e0b23c12fc03cf0eb07"> 85</a></span> ProblemStatusProto <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_problem_status.html#a44a4de2a68ed2e0b23c12fc03cf0eb07">ToProto</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_problem_status.html#a19c380b03cea21d7ac7325136a131ff0"> 86</a></span> std::string <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_problem_status.html#a19c380b03cea21d7ac7325136a131ff0">ToString</a>() <span class="keyword">const</span>;</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> </div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span>std::ostream& <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a2e76538efbebc3745c913d17d09bfa68">operator<<</a>(std::ostream& ostr, <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_problem_status.html">ProblemStatus</a>& <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a>);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html"> 91</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_stats.html">SolveStats</a> {</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// Elapsed wall clock time as measured by math_opt, roughly the time inside</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// Solver::Solve(). Note: this does not include work done building the model.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#adf12c8f61623fcea321cfceaec374b58"> 94</a></span> absl::Duration <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#adf12c8f61623fcea321cfceaec374b58">solve_time</a> = absl::ZeroDuration();</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">// TODO(b/195295177): Update to add clearer contracts once PDLP's bounds</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// contract is clarified.</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">// Solver claims the optimal value is equal or better (smaller for</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// minimization and larger for maximization) than best_primal_bound:</span></div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// * best_primal_bound is trivial (+inf for minimization and -inf</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// maximization) when the solver does not claim to have such bound. This</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// may happen for some solvers (e.g., PDLP, typically continuous solvers)</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// even when returning optimal (solver could terminate with slightly</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// infeasible primal solutions).</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// * best_primal_bound can be closer to the optimal value than the objective</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// of the best primal feasible solution. In particular, best_primal_bound</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// may be non-trivial even when no primal feasible solutions are returned.</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// * best_dual_bound is always better (smaller for minimization and larger</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// for maximization) than best_primal_bound.</span></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"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a8a724eb151b2c82b6829296095d4b846"> 112</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a8a724eb151b2c82b6829296095d4b846">best_primal_bound</a> = 0.0;</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> </div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// Solver claims the optimal value is equal or worse (larger for</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// minimization and smaller for maximization) than best_dual_bound:</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// * best_dual_bound is always better (smaller for minimization and larger</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// for maximization) than best_primal_bound.</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// * best_dual_bound is trivial (-inf for minimization and +inf</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// maximization) when the solver does not claim to have such bound.</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// Similarly to best_primal_bound, this may happen for some solvers even</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// when returning optimal. MIP solvers will typically report a bound even</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// if it is imprecise.</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// * for continuous problems best_dual_bound can be closer to the optimal</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// value than the objective of the best dual feasible solution. For MIP</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// one of the first non-trivial values for best_dual_bound is often the</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// optimal value of the LP relaxation of the MIP.</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ad5489a1319e261d56a57e4218f6702da"> 127</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ad5489a1319e261d56a57e4218f6702da">best_dual_bound</a> = 0.0;</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">// Feasibility statuses for primal and dual problems.</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a43d409ac8198289a1b6e38e62c7fc187"> 130</a></span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_problem_status.html">ProblemStatus</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a43d409ac8198289a1b6e38e62c7fc187">problem_status</a>;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> </div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ae1b2080956100e6f08d33f2d443ca743"> 132</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ae1b2080956100e6f08d33f2d443ca743">simplex_iterations</a> = 0;</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"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a4152d049addc467d3517477238e81bd5"> 134</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a4152d049addc467d3517477238e81bd5">barrier_iterations</a> = 0;</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> </div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#af0fb25f09451da37b687652b68cdc9b5"> 136</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#af0fb25f09451da37b687652b68cdc9b5">first_order_iterations</a> = 0;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> </div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ab5abb737ffd89b661cbcc345019609b0"> 138</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ab5abb737ffd89b661cbcc345019609b0">node_count</a> = 0;</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> </div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Will CHECK fail on invalid input, if problem_status is invalid.</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_stats.html">SolveStats</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#aa1d7d95ad700a668e6239532ec972c57">FromProto</a>(<span class="keyword">const</span> SolveStatsProto& solve_stats_proto);</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> </div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> SolveStatsProto <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#aa9a8e759d14728371d333f6895646779">ToProto</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> std::string <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a19c380b03cea21d7ac7325136a131ff0">ToString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span>};</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span>std::ostream& <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a2e76538efbebc3745c913d17d09bfa68">operator<<</a>(std::ostream& ostr, <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_stats.html">SolveStats</a>& stats);</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// The reason a call to Solve() terminates.</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194"> 150</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194">TerminationReason</a> {</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// A provably optimal solution (up to numerical tolerances) has been found.</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a863253016d36c5dbd9e9f9302b81c5dc">kOptimal</a> = TERMINATION_REASON_OPTIMAL,</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// The primal problem has no feasible solutions.</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa17b6104527f45be5034e00d3c14249faa4d66aafc8bcba36b995fd8be0483574">kInfeasible</a> = TERMINATION_REASON_INFEASIBLE,</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// The primal problem is feasible and arbitrarily good solutions can be</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// found along a primal ray.</span></div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a23ed664a0e17d03024e229f8ef94184d">kUnbounded</a> = TERMINATION_REASON_UNBOUNDED,</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> <span class="comment">// The primal problem is either infeasible or unbounded. More details on the</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// problem status may be available in solve_stats.problem_status. Note that</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// Gurobi's unbounded status may be mapped here as explained in</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// go/mathopt-solver-specific#gurobi-inf-or-unb.</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a7df6131c263c532b82e1525e06e7778a">kInfeasibleOrUnbounded</a> = TERMINATION_REASON_INFEASIBLE_OR_UNBOUNDED,</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// The problem was solved to one of the criteria above (Optimal, Infeasible,</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// Unbounded, or InfeasibleOrUnbounded), but one or more tolerances was not</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// met. Some primal/dual solutions/rays be present, but either they will be</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// slightly infeasible, or (if the problem was nearly optimal) their may be</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// a gap between the best solution objective and best objective bound.</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">// Users can still query primal/dual solutions/rays and solution stats, but</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// they are responsible for dealing with the numerical imprecision.</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194aa2e9430dc6f4c82d5766b5ce4c36820a">kImprecise</a> = TERMINATION_REASON_IMPRECISE,</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// The optimizer reached some kind of limit and a primal feasible solution</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// is returned. See SolveResultProto.limit_detail for detailed description of</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// the kind of limit that was reached.</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a801be40a606301461ff812058569ee3ba6936fc811b6bf3bfd7c65ab1f48e3f1f">kFeasible</a> = TERMINATION_REASON_FEASIBLE,</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// The optimizer reached some kind of limit and it did not find a primal</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// feasible solution. See SolveResultProto.limit_detail for detailed</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// description of the kind of limit that was reached.</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a7dbb41ec30548b5703863365ae83a5dc">kNoSolutionFound</a> = TERMINATION_REASON_NO_SOLUTION_FOUND,</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> </div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// The algorithm stopped because it encountered unrecoverable numerical</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// error. No solution information is available.</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a631fe1d70108dee6ae7d6acde27f76ef">kNumericalError</a> = TERMINATION_REASON_NUMERICAL_ERROR,</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> </div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// The algorithm stopped because of an error not covered by one of the</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// statuses defined above. No solution information is available.</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a298223b78cd88f4983fbc5ae093136ca">kOtherError</a> = TERMINATION_REASON_OTHER_ERROR</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span>};</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> </div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#abac41abdbb7a6ee0f536d9b4a5ba6579"> 196</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#ad02e69a0531469b463df907c7b2ad194">TerminationReason</a>, TERMINATION_REASON_UNSPECIFIED);</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">// When a Solve() stops early with TerminationReason kFeasible or</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span><span class="comment">// kNoSolutionFound, the specific limit that was hit.</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0"> 200</a></span><span class="keyword">enum class</span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">Limit</a> {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// Used if the underlying solver cannot determine which limit was reached, or</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// as a null value when we terminated not from a limit (e.g. kOptimal).</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a801be40a606301461ff812058569ee3ba180f453eb66237810dfc39ee46e04c9a">kUndetermined</a> = LIMIT_UNDETERMINED,</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// An iterative algorithm stopped after conducting the maximum number of</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// iterations (e.g. simplex or barrier iterations).</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0ad34bbd256ac1d726ac51c93fe2c7498e">kIteration</a> = LIMIT_ITERATION,</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> </div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// The algorithm stopped after a user-specified computation time.</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a4fbae144eab5d83a51adcf4d6542805a">kTime</a> = LIMIT_TIME,</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// A branch-and-bound algorithm stopped because it explored a maximum number</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="comment">// of nodes in the branch-and-bound tree.</span></div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0abd4d2eef8f039ed1f560c869f6f9520e">kNode</a> = LIMIT_NODE,</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> </div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// The algorithm stopped because it found the required number of solutions.</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="comment">// This is often used in MIPs to get the solver to return the first feasible</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// solution it encounters.</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a3d1746ee2f8feac18bfb0771113ee040">kSolution</a> = LIMIT_SOLUTION,</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> </div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// The algorithm stopped because it ran out of memory.</span></div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a10bc3eeea6471cd730616a1dda9e2cd4">kMemory</a> = LIMIT_MEMORY,</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> </div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// The solver was run with a cutoff (e.g. SolveParameters.cutoff_limit was</span></div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// set) on the objective, indicating that the user did not want any solution</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// worse than the cutoff, and the solver concluded there were no solutions at</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// least as good as the cutoff. Typically no further solution information is</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// provided.</span></div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0abd95ac9f4bb763606a8ae6aba3478c81">kCutoff</a> = LIMIT_CUTOFF,</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> </div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// The algorithm stopped because it found a solution better than a minimum</span></div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// limit set by the user.</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0ad320be41a43fd2b750ca8e0979d26f1b">kObjective</a> = LIMIT_OBJECTIVE,</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> </div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// The algorithm stopped because the norm of an iterate became too large.</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a8fa6af6fde54f427a1b9671a8dc305a7">kNorm</a> = LIMIT_NORM,</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> </div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// The algorithm stopped because of an interrupt signal or a user interrupt</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// request.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a6173092b28607c1559db94a72048616b">kInterrupted</a> = LIMIT_INTERRUPTED,</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">// The algorithm stopped because it was unable to continue making progress</span></div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="comment">// towards the solution.</span></div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0abea657328ccb0889a57535b265097d90">kSlowProgress</a> = LIMIT_SLOW_PROGRESS,</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> </div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// The algorithm stopped due to a limit not covered by one of the above. Note</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// that kUndetermined is used when the reason cannot be determined, and kOther</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// is used when the reason is known but does not fit into any of the above</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// alternatives.</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <a class="code hl_enumvalue" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a341b8a8f03cf33821c46aa5c3aad4b7a">kOther</a> = LIMIT_OTHER</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span>};</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> </div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1math__opt.html#ad80f0acad4ffc70b0438653db4503bf5"> 253</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#a52355a6466a0191b48c41bc3521207a0">Limit</a>, LIMIT_UNSPECIFIED);</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> </div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span><span class="comment">// All information regarding why a call to Solve() terminated.</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_termination.html"> 256</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_termination.html">Termination</a> {</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// When the reason is kFeasible or kNoSolutionFound, please use the static</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// functions Feasible and NoSolutionFound.</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="keyword">explicit</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#a6061a7748ed60136b17b65a73f8fa253">Termination</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194">TerminationReason</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a36d5365d462f57468ba3a9d8ae6bbec9">reason</a>, std::string <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a06f18b7e05b64c4ff0d03f07ae379a68">detail</a> = {});</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> </div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_termination.html#a36d5365d462f57468ba3a9d8ae6bbec9"> 261</a></span> <a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194">TerminationReason</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a36d5365d462f57468ba3a9d8ae6bbec9">reason</a>;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="comment">// Is set iff reason is kFeasible or kNoSolutionFound.</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_termination.html#a716121b3b7000e72df76b9451747f772"> 264</a></span> std::optional<Limit> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a716121b3b7000e72df76b9451747f772">limit</a>;</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> </div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// Additional typically solver specific information about termination.</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// Not all solvers can always determine the limit which caused termination,</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// Limit::kUndetermined is used when the cause cannot be determined.</span></div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_termination.html#a06f18b7e05b64c4ff0d03f07ae379a68"> 269</a></span> std::string <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a06f18b7e05b64c4ff0d03f07ae379a68">detail</a>;</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> <span class="comment">// Returns true if a limit was reached (i.e. if reason is kFeasible or</span></div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// kNoSolutionFound, and limit is not empty).</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#a68c433e3442a5efad6ddfd3bf58676de">limit_reached</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// Will CHECK fail on invalid input, if reason is unspecified, if limit is</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// set when reason is not TERMINATION_REASON_FEASIBLE or</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// TERMINATION_REASON_NO_SOLUTION_FOUND, or if limit is unspecified when</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// reason is TERMINATION_REASON_FEASIBLE or</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// TERMINATION_REASON_NO_SOLUTION_FOUND (see solution_validator.h).</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_termination.html">Termination</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#a74d8374f91aea2ed483e7dee012eac69">FromProto</a>(<span class="keyword">const</span> TerminationProto& termination_proto);</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// Sets the reason to kFeasible</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_termination.html">Termination</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#ad72869988b927ea6fac876b976248829">Feasible</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">Limit</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a716121b3b7000e72df76b9451747f772">limit</a>, std::string <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a06f18b7e05b64c4ff0d03f07ae379a68">detail</a> = {});</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> </div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Sets the reason to kNoSolutionFound</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_termination.html">Termination</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#aed022119fc9ab5f13bf9f95cde4dd1e0">NoSolutionFound</a>(<a class="code hl_enumeration" href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">Limit</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a716121b3b7000e72df76b9451747f772">limit</a>, std::string <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_termination.html#a06f18b7e05b64c4ff0d03f07ae379a68">detail</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> TerminationProto <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#a2abf4fd951d9a06c8a3dd568b3e3d0ff">ToProto</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> std::string <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_termination.html#a19c380b03cea21d7ac7325136a131ff0">ToString</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span>};</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> </div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span>std::ostream& <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a2e76538efbebc3745c913d17d09bfa68">operator<<</a>(std::ostream& ostr, <span class="keyword">const</span> Termination& termination);</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> </div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span><span class="comment">// The result of solving an optimization problem with Solve().</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html"> 295</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_result.html">SolveResult</a> {</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#aaf5aad6549becec25341b1fd69a3e983"> 296</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#aaf5aad6549becec25341b1fd69a3e983">SolveResult</a>(<a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_termination.html">Termination</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a77d1ea96211300e9417b965981953c81">termination</a>)</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> : <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a77d1ea96211300e9417b965981953c81">termination</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a77d1ea96211300e9417b965981953c81">termination</a>)) {}</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// The reason the solver stopped.</span></div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a77d1ea96211300e9417b965981953c81"> 300</a></span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_termination.html">Termination</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a77d1ea96211300e9417b965981953c81">termination</a>;</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">// Statistics on the solve process, e.g. running time, iterations.</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a330653218e189fba7a1264117476eb39"> 303</a></span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_stats.html">SolveStats</a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a330653218e189fba7a1264117476eb39">solve_stats</a>;</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> </div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="comment">// Basic solutions use, as of Nov 2021:</span></div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="comment">// * All convex optimization solvers (LP, convex QP) return only one</span></div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="comment">// solution as a primal dual pair.</span></div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// * Only MI(Q)P solvers return more than one solution. MIP solvers do not</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="comment">// return any dual information, or primal infeasible solutions. Solutions</span></div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="comment">// are returned in order of best primal objective first. Gurobi solves</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// nonconvex QP (integer or continuous) as MIQP.</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> </div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// The general contract for the order of solutions that future solvers should</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="comment">// implement is to order by:</span></div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="comment">// 1. The solutions with a primal feasible solution, ordered by best primal</span></div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="comment">// objective first.</span></div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// 2. The solutions with a dual feasible solution, ordered by best dual</span></div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="comment">// objective (unknown dual objective is worst)</span></div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <span class="comment">// 3. All remaining solutions can be returned in any order.</span></div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac34a591a8d4c97450093d81ecf9cfae3"> 320</a></span> std::vector<Solution> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac34a591a8d4c97450093d81ecf9cfae3">solutions</a>;</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> </div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="comment">// Directions of unbounded primal improvement, or equivalently, dual</span></div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="comment">// infeasibility certificates. Typically provided for TerminationReasons</span></div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="comment">// kUnbounded and kInfeasibleOrUnbounded.</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8"> 325</a></span> std::vector<PrimalRay> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">primal_rays</a>;</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> </div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="comment">// Directions of unbounded dual improvement, or equivalently, primal</span></div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="comment">// infeasibility certificates. Typically provided for TerminationReason</span></div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// kInfeasible.</span></div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#af8a0308f391215b9c41b855832504054"> 330</a></span> std::vector<DualRay> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#af8a0308f391215b9c41b855832504054">dual_rays</a>;</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> </div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="comment">// Solver specific output from Gscip. Only populated if Gscip is used.</span></div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ad13334bfa3f4b8439d1b6dc9fab7a354"> 333</a></span> GScipOutput <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ad13334bfa3f4b8439d1b6dc9fab7a354">gscip_solver_specific_output</a>;</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> </div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <span class="keyword">static</span> <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_solve_result.html">SolveResult</a> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a90cc7416f078ff7f824bfd2e8fe7d4b5">FromProto</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_model_storage.html">ModelStorage</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="keyword">const</span> SolveResultProto& solve_result_proto);</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> </div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a2dc761880474e791f59285a792f7d1bb"> 338</a></span> absl::Duration <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a2dc761880474e791f59285a792f7d1bb">solve_time</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a330653218e189fba7a1264117476eb39">solve_stats</a>.<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_stats.html#adf12c8f61623fcea321cfceaec374b58">solve_time</a>; }</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> </div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="comment">// Indicates if at least one primal feasible solution is available.</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// When termination.reason is TerminationReason::kOptimal, this is guaranteed</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="comment">// to be true and need not be checked.</span></div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ae2def0e7b145027ec5ffd27db10f0fdb">has_primal_feasible_solution</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> </div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// The objective value of the best primal feasible solution. Will CHECK fail</span></div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="comment">// if there are no primal feasible solutions.</span></div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordtype">double</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a84f066c304d8bcbb9567be094feb9b08">objective_value</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> </div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="comment">// A bound on the best possible objective value.</span></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keywordtype">double</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a084d42f2437a4d0666990dc4681e68ec">best_objective_bound</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="comment">// The variable values from the best primal feasible solution. Will CHECK fail</span></div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// if there are no primal feasible solutions.</span></div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac4a6e078f25aa73eec5271d449a12532">variable_values</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> </div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// Returns true only if the problem has been shown to be feasible and bounded.</span></div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac50528105e4a1763e2a8d79868c77448">bounded</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> </div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="comment">// Indicates if at least one primal ray is available.</span></div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="comment">// This is NOT guaranteed to be true when termination.reason is</span></div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="comment">// TerminationReason::kUnbounded or TerminationReason::kInfeasibleOrUnbounded.</span></div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a92d19a5e106290c1b90a5184a4826936"> 364</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a92d19a5e106290c1b90a5184a4826936">has_ray</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">primal_rays</a>.empty(); }</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> </div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> <span class="comment">// The variable values from the first primal ray. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="comment">// are no primal rays.</span></div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a111ca69b2f4a515754ff424f8214efe6">ray_variable_values</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> </div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// Indicates if the best primal solution has an associated dual feasible</span></div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="comment">// solution.</span></div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// This is NOT guaranteed to be true when termination.reason is</span></div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="comment">// TerminationReason::kOptimal. It also may be true even when the best primal</span></div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="comment">// solution is not feasible.</span></div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a35cafd54aea7eb0aecf1cb6fa4b33273">has_dual_feasible_solution</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> </div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="comment">// The dual values from the best dual solution. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="comment">// are no dual solutions.</span></div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<double></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a116b227550e648d43bfbaccf9557ce42">dual_values</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> </div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// The reduced from the best dual solution. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="comment">// are no dual solutions.</span></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#acc1f8f5ed04e9ea770b526fa34d6076c">reduced_costs</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> </div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="comment">// Indicates if at least one dual ray is available.</span></div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="comment">// This is NOT guaranteed to be true when termination.reason is</span></div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="comment">// TerminationReason::kInfeasible.</span></div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a240b106da863fbff10545e97c2c72007"> 390</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a240b106da863fbff10545e97c2c72007">has_dual_ray</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_solve_result.html#af8a0308f391215b9c41b855832504054">dual_rays</a>.empty(); }</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> </div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="comment">// The dual values from the first dual ray. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="comment">// are no dual rays.</span></div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<double></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a5511ef5b247197964fac748cc4a8de1f">ray_dual_values</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> </div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="comment">// The reduced from the first dual ray. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="comment">// are no dual rays.</span></div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#aafa2eea97d94bf02b53add568f96a5b7">ray_reduced_costs</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> </div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="comment">// Indicates if at least one basis is available.</span></div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a62c089ac76f862b590837a1e3222255a">has_basis</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> </div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="comment">// The constraint basis status for the first primal/dual pair.</span></div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<BasisStatus></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#ab62d9dad5e21d92465fbe8c1d4b34369">constraint_status</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> </div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <span class="comment">// The variable basis status for the first primal/dual pair.</span></div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<BasisStatus></a>& <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_solve_result.html#a1e2301bdfac3bd250b16fe5ba4b22190">variable_status</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span>};</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> </div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span>} <span class="comment">// namespace math_opt</span></div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> </div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_MATH_OPT_CPP_SOLVE_RESULT_H_</span></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_id_map_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_id_map.html">operations_research::math_opt::IdMap</a></div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00053">id_map.h:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_model_storage_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_model_storage.html">operations_research::math_opt::ModelStorage</a></div><div class="ttdef"><b>Definition:</b> <a href="model__storage_8h_source.html#l00155">model_storage.h:155</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="ag__gurobi_8cc_html_a2237393c7ae7ad7344c9885066d5ab6d"><div class="ttname"><a href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a></div><div class="ttdeci">absl::Status status</div><div class="ttdef"><b>Definition:</b> <a href="g__gurobi_8cc_source.html#l00035">g_gurobi.cc:35</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="amath__opt_2cpp_2linear__constraint_8h_html"><div class="ttname"><a href="math__opt_2cpp_2linear__constraint_8h.html">linear_constraint.h</a></div></div>
|
|
<div class="ttc" id="amodel__storage_8h_html"><div class="ttname"><a href="model__storage_8h.html">model_storage.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_a0b8aaa119fe5d1d7df5c0bedfdc15a7b"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7b">operations_research::math_opt::FeasibilityStatus</a></div><div class="ttdeci">FeasibilityStatus</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00038">solve_result.h:38</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a0b8aaa119fe5d1d7df5c0bedfdc15a7ba180f453eb66237810dfc39ee46e04c9a"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a0b8aaa119fe5d1d7df5c0bedfdc15a7ba180f453eb66237810dfc39ee46e04c9a">operations_research::math_opt::FeasibilityStatus::kUndetermined</a></div><div class="ttdeci">@ kUndetermined</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a2e76538efbebc3745c913d17d09bfa68"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a2e76538efbebc3745c913d17d09bfa68">operations_research::math_opt::operator<<</a></div><div class="ttdeci">std::ostream & operator<<(std::ostream &out, const E value)</div><div class="ttdef"><b>Definition:</b> <a href="enums_8h_source.html#l00231">enums.h:231</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0">operations_research::math_opt::Limit</a></div><div class="ttdeci">Limit</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00200">solve_result.h:200</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0a10bc3eeea6471cd730616a1dda9e2cd4"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a10bc3eeea6471cd730616a1dda9e2cd4">operations_research::math_opt::Limit::kMemory</a></div><div class="ttdeci">@ kMemory</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0a341b8a8f03cf33821c46aa5c3aad4b7a"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a341b8a8f03cf33821c46aa5c3aad4b7a">operations_research::math_opt::Limit::kOther</a></div><div class="ttdeci">@ kOther</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0a3d1746ee2f8feac18bfb0771113ee040"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a3d1746ee2f8feac18bfb0771113ee040">operations_research::math_opt::Limit::kSolution</a></div><div class="ttdeci">@ kSolution</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0a4fbae144eab5d83a51adcf4d6542805a"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a4fbae144eab5d83a51adcf4d6542805a">operations_research::math_opt::Limit::kTime</a></div><div class="ttdeci">@ kTime</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0a6173092b28607c1559db94a72048616b"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a6173092b28607c1559db94a72048616b">operations_research::math_opt::Limit::kInterrupted</a></div><div class="ttdeci">@ kInterrupted</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0a8fa6af6fde54f427a1b9671a8dc305a7"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0a8fa6af6fde54f427a1b9671a8dc305a7">operations_research::math_opt::Limit::kNorm</a></div><div class="ttdeci">@ kNorm</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0abd4d2eef8f039ed1f560c869f6f9520e"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0abd4d2eef8f039ed1f560c869f6f9520e">operations_research::math_opt::Limit::kNode</a></div><div class="ttdeci">@ kNode</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0abd95ac9f4bb763606a8ae6aba3478c81"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0abd95ac9f4bb763606a8ae6aba3478c81">operations_research::math_opt::Limit::kCutoff</a></div><div class="ttdeci">@ kCutoff</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0abea657328ccb0889a57535b265097d90"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0abea657328ccb0889a57535b265097d90">operations_research::math_opt::Limit::kSlowProgress</a></div><div class="ttdeci">@ kSlowProgress</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0ad320be41a43fd2b750ca8e0979d26f1b"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0ad320be41a43fd2b750ca8e0979d26f1b">operations_research::math_opt::Limit::kObjective</a></div><div class="ttdeci">@ kObjective</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a52355a6466a0191b48c41bc3521207a0ad34bbd256ac1d726ac51c93fe2c7498e"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a52355a6466a0191b48c41bc3521207a0ad34bbd256ac1d726ac51c93fe2c7498e">operations_research::math_opt::Limit::kIteration</a></div><div class="ttdeci">@ kIteration</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_a801be40a606301461ff812058569ee3ba180f453eb66237810dfc39ee46e04c9a"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a801be40a606301461ff812058569ee3ba180f453eb66237810dfc39ee46e04c9a">operations_research::math_opt::SolutionStatus::kUndetermined</a></div><div class="ttdeci">@ kUndetermined</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a801be40a606301461ff812058569ee3ba6936fc811b6bf3bfd7c65ab1f48e3f1f"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a801be40a606301461ff812058569ee3ba6936fc811b6bf3bfd7c65ab1f48e3f1f">operations_research::math_opt::SolutionStatus::kFeasible</a></div><div class="ttdeci">@ kFeasible</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194">operations_research::math_opt::TerminationReason</a></div><div class="ttdeci">TerminationReason</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00150">solve_result.h:150</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194a23ed664a0e17d03024e229f8ef94184d"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a23ed664a0e17d03024e229f8ef94184d">operations_research::math_opt::TerminationReason::kUnbounded</a></div><div class="ttdeci">@ kUnbounded</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194a298223b78cd88f4983fbc5ae093136ca"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a298223b78cd88f4983fbc5ae093136ca">operations_research::math_opt::TerminationReason::kOtherError</a></div><div class="ttdeci">@ kOtherError</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194a631fe1d70108dee6ae7d6acde27f76ef"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a631fe1d70108dee6ae7d6acde27f76ef">operations_research::math_opt::TerminationReason::kNumericalError</a></div><div class="ttdeci">@ kNumericalError</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194a7dbb41ec30548b5703863365ae83a5dc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a7dbb41ec30548b5703863365ae83a5dc">operations_research::math_opt::TerminationReason::kNoSolutionFound</a></div><div class="ttdeci">@ kNoSolutionFound</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194a7df6131c263c532b82e1525e06e7778a"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a7df6131c263c532b82e1525e06e7778a">operations_research::math_opt::TerminationReason::kInfeasibleOrUnbounded</a></div><div class="ttdeci">@ kInfeasibleOrUnbounded</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194a863253016d36c5dbd9e9f9302b81c5dc"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194a863253016d36c5dbd9e9f9302b81c5dc">operations_research::math_opt::TerminationReason::kOptimal</a></div><div class="ttdeci">@ kOptimal</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad02e69a0531469b463df907c7b2ad194aa2e9430dc6f4c82d5766b5ce4c36820a"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad02e69a0531469b463df907c7b2ad194aa2e9430dc6f4c82d5766b5ce4c36820a">operations_research::math_opt::TerminationReason::kImprecise</a></div><div class="ttdeci">@ kImprecise</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_aa17b6104527f45be5034e00d3c14249faa4d66aafc8bcba36b995fd8be0483574"><div class="ttname"><a href="namespaceoperations__research.html#aa17b6104527f45be5034e00d3c14249faa4d66aafc8bcba36b995fd8be0483574">operations_research::GScipHintResult::kInfeasible</a></div><div class="ttdeci">@ kInfeasible</div></div>
|
|
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
|
<div class="ttc" id="asolution_8h_html"><div class="ttname"><a href="solution_8h.html">solution.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html">operations_research::math_opt::ProblemStatus</a></div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00067">solve_result.h:67</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html_a19c380b03cea21d7ac7325136a131ff0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html#a19c380b03cea21d7ac7325136a131ff0">operations_research::math_opt::ProblemStatus::ToString</a></div><div class="ttdeci">std::string ToString() const</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html_a3d66a2dcf598fb5b1006e6ee524406de"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html#a3d66a2dcf598fb5b1006e6ee524406de">operations_research::math_opt::ProblemStatus::dual_status</a></div><div class="ttdeci">FeasibilityStatus dual_status</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00072">solve_result.h:72</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html_a44a4de2a68ed2e0b23c12fc03cf0eb07"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html#a44a4de2a68ed2e0b23c12fc03cf0eb07">operations_research::math_opt::ProblemStatus::ToProto</a></div><div class="ttdeci">ProblemStatusProto ToProto() const</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html_aa622f404d2ac79ac25cc432630525fda"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html#aa622f404d2ac79ac25cc432630525fda">operations_research::math_opt::ProblemStatus::primal_status</a></div><div class="ttdeci">FeasibilityStatus primal_status</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00069">solve_result.h:69</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html_aad421cd241e09cc3485626c6d8956cd6"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html#aad421cd241e09cc3485626c6d8956cd6">operations_research::math_opt::ProblemStatus::primal_or_dual_infeasible</a></div><div class="ttdeci">bool primal_or_dual_infeasible</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00080">solve_result.h:80</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_problem_status_html_acc2ba2337184066983e9c402967c6373"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_problem_status.html#acc2ba2337184066983e9c402967c6373">operations_research::math_opt::ProblemStatus::FromProto</a></div><div class="ttdeci">static ProblemStatus FromProto(const ProblemStatusProto &problem_status_proto)</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html">operations_research::math_opt::SolveResult</a></div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00295">solve_result.h:295</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a084d42f2437a4d0666990dc4681e68ec"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a084d42f2437a4d0666990dc4681e68ec">operations_research::math_opt::SolveResult::best_objective_bound</a></div><div class="ttdeci">double best_objective_bound() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00354">solve_result.cc:354</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a111ca69b2f4a515754ff424f8214efe6"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a111ca69b2f4a515754ff424f8214efe6">operations_research::math_opt::SolveResult::ray_variable_values</a></div><div class="ttdeci">const VariableMap< double > & ray_variable_values() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00374">solve_result.cc:374</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a116b227550e648d43bfbaccf9557ce42"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a116b227550e648d43bfbaccf9557ce42">operations_research::math_opt::SolveResult::dual_values</a></div><div class="ttdeci">const LinearConstraintMap< double > & dual_values() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00385">solve_result.cc:385</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a1e2301bdfac3bd250b16fe5ba4b22190"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a1e2301bdfac3bd250b16fe5ba4b22190">operations_research::math_opt::SolveResult::variable_status</a></div><div class="ttdeci">const VariableMap< BasisStatus > & variable_status() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00413">solve_result.cc:413</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a240b106da863fbff10545e97c2c72007"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a240b106da863fbff10545e97c2c72007">operations_research::math_opt::SolveResult::has_dual_ray</a></div><div class="ttdeci">bool has_dual_ray() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00390">solve_result.h:390</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a2dc761880474e791f59285a792f7d1bb"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a2dc761880474e791f59285a792f7d1bb">operations_research::math_opt::SolveResult::solve_time</a></div><div class="ttdeci">absl::Duration solve_time() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00338">solve_result.h:338</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a330653218e189fba7a1264117476eb39"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a330653218e189fba7a1264117476eb39">operations_research::math_opt::SolveResult::solve_stats</a></div><div class="ttdeci">SolveStats solve_stats</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00303">solve_result.h:303</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a35cafd54aea7eb0aecf1cb6fa4b33273"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a35cafd54aea7eb0aecf1cb6fa4b33273">operations_research::math_opt::SolveResult::has_dual_feasible_solution</a></div><div class="ttdeci">bool has_dual_feasible_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00379">solve_result.cc:379</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a5511ef5b247197964fac748cc4a8de1f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a5511ef5b247197964fac748cc4a8de1f">operations_research::math_opt::SolveResult::ray_dual_values</a></div><div class="ttdeci">const LinearConstraintMap< double > & ray_dual_values() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00394">solve_result.cc:394</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a62c089ac76f862b590837a1e3222255a"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a62c089ac76f862b590837a1e3222255a">operations_research::math_opt::SolveResult::has_basis</a></div><div class="ttdeci">bool has_basis() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00404">solve_result.cc:404</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a6e4b0ba0339c6172e9bfa3df9f8c61d8"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">operations_research::math_opt::SolveResult::primal_rays</a></div><div class="ttdeci">std::vector< PrimalRay > primal_rays</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00325">solve_result.h:325</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a77d1ea96211300e9417b965981953c81"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a77d1ea96211300e9417b965981953c81">operations_research::math_opt::SolveResult::termination</a></div><div class="ttdeci">Termination termination</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00300">solve_result.h:300</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a84f066c304d8bcbb9567be094feb9b08"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a84f066c304d8bcbb9567be094feb9b08">operations_research::math_opt::SolveResult::objective_value</a></div><div class="ttdeci">double objective_value() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00358">solve_result.cc:358</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a90cc7416f078ff7f824bfd2e8fe7d4b5"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a90cc7416f078ff7f824bfd2e8fe7d4b5">operations_research::math_opt::SolveResult::FromProto</a></div><div class="ttdeci">static SolveResult FromProto(const ModelStorage *model, const SolveResultProto &solve_result_proto)</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00327">solve_result.cc:327</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_a92d19a5e106290c1b90a5184a4826936"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#a92d19a5e106290c1b90a5184a4826936">operations_research::math_opt::SolveResult::has_ray</a></div><div class="ttdeci">bool has_ray() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00364">solve_result.h:364</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_aaf5aad6549becec25341b1fd69a3e983"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#aaf5aad6549becec25341b1fd69a3e983">operations_research::math_opt::SolveResult::SolveResult</a></div><div class="ttdeci">SolveResult(Termination termination)</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00296">solve_result.h:296</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_aafa2eea97d94bf02b53add568f96a5b7"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#aafa2eea97d94bf02b53add568f96a5b7">operations_research::math_opt::SolveResult::ray_reduced_costs</a></div><div class="ttdeci">const VariableMap< double > & ray_reduced_costs() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00399">solve_result.cc:399</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_ab62d9dad5e21d92465fbe8c1d4b34369"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#ab62d9dad5e21d92465fbe8c1d4b34369">operations_research::math_opt::SolveResult::constraint_status</a></div><div class="ttdeci">const LinearConstraintMap< BasisStatus > & constraint_status() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00408">solve_result.cc:408</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_ac34a591a8d4c97450093d81ecf9cfae3"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac34a591a8d4c97450093d81ecf9cfae3">operations_research::math_opt::SolveResult::solutions</a></div><div class="ttdeci">std::vector< Solution > solutions</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00320">solve_result.h:320</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_ac4a6e078f25aa73eec5271d449a12532"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac4a6e078f25aa73eec5271d449a12532">operations_research::math_opt::SolveResult::variable_values</a></div><div class="ttdeci">const VariableMap< double > & variable_values() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00369">solve_result.cc:369</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_ac50528105e4a1763e2a8d79868c77448"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#ac50528105e4a1763e2a8d79868c77448">operations_research::math_opt::SolveResult::bounded</a></div><div class="ttdeci">bool bounded() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00363">solve_result.cc:363</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_acc1f8f5ed04e9ea770b526fa34d6076c"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#acc1f8f5ed04e9ea770b526fa34d6076c">operations_research::math_opt::SolveResult::reduced_costs</a></div><div class="ttdeci">const VariableMap< double > & reduced_costs() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00390">solve_result.cc:390</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_ad13334bfa3f4b8439d1b6dc9fab7a354"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#ad13334bfa3f4b8439d1b6dc9fab7a354">operations_research::math_opt::SolveResult::gscip_solver_specific_output</a></div><div class="ttdeci">GScipOutput gscip_solver_specific_output</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00333">solve_result.h:333</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_ae2def0e7b145027ec5ffd27db10f0fdb"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#ae2def0e7b145027ec5ffd27db10f0fdb">operations_research::math_opt::SolveResult::has_primal_feasible_solution</a></div><div class="ttdeci">bool has_primal_feasible_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00348">solve_result.cc:348</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_result_html_af8a0308f391215b9c41b855832504054"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_result.html#af8a0308f391215b9c41b855832504054">operations_research::math_opt::SolveResult::dual_rays</a></div><div class="ttdeci">std::vector< DualRay > dual_rays</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00330">solve_result.h:330</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html">operations_research::math_opt::SolveStats</a></div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00091">solve_result.h:91</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_a19c380b03cea21d7ac7325136a131ff0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a19c380b03cea21d7ac7325136a131ff0">operations_research::math_opt::SolveStats::ToString</a></div><div class="ttdeci">std::string ToString() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00321">solve_result.cc:321</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_a4152d049addc467d3517477238e81bd5"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a4152d049addc467d3517477238e81bd5">operations_research::math_opt::SolveStats::barrier_iterations</a></div><div class="ttdeci">int barrier_iterations</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00134">solve_result.h:134</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_a43d409ac8198289a1b6e38e62c7fc187"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a43d409ac8198289a1b6e38e62c7fc187">operations_research::math_opt::SolveStats::problem_status</a></div><div class="ttdeci">ProblemStatus problem_status</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00130">solve_result.h:130</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_a8a724eb151b2c82b6829296095d4b846"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#a8a724eb151b2c82b6829296095d4b846">operations_research::math_opt::SolveStats::best_primal_bound</a></div><div class="ttdeci">double best_primal_bound</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00112">solve_result.h:112</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_aa1d7d95ad700a668e6239532ec972c57"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#aa1d7d95ad700a668e6239532ec972c57">operations_research::math_opt::SolveStats::FromProto</a></div><div class="ttdeci">static SolveStats FromProto(const SolveStatsProto &solve_stats_proto)</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00293">solve_result.cc:293</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_aa9a8e759d14728371d333f6895646779"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#aa9a8e759d14728371d333f6895646779">operations_research::math_opt::SolveStats::ToProto</a></div><div class="ttdeci">SolveStatsProto ToProto() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00279">solve_result.cc:279</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_ab5abb737ffd89b661cbcc345019609b0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ab5abb737ffd89b661cbcc345019609b0">operations_research::math_opt::SolveStats::node_count</a></div><div class="ttdeci">int node_count</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00138">solve_result.h:138</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_ad5489a1319e261d56a57e4218f6702da"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ad5489a1319e261d56a57e4218f6702da">operations_research::math_opt::SolveStats::best_dual_bound</a></div><div class="ttdeci">double best_dual_bound</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00127">solve_result.h:127</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_adf12c8f61623fcea321cfceaec374b58"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#adf12c8f61623fcea321cfceaec374b58">operations_research::math_opt::SolveStats::solve_time</a></div><div class="ttdeci">absl::Duration solve_time</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00094">solve_result.h:94</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_ae1b2080956100e6f08d33f2d443ca743"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#ae1b2080956100e6f08d33f2d443ca743">operations_research::math_opt::SolveStats::simplex_iterations</a></div><div class="ttdeci">int simplex_iterations</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00132">solve_result.h:132</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_solve_stats_html_af0fb25f09451da37b687652b68cdc9b5"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_solve_stats.html#af0fb25f09451da37b687652b68cdc9b5">operations_research::math_opt::SolveStats::first_order_iterations</a></div><div class="ttdeci">int first_order_iterations</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00136">solve_result.h:136</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html">operations_research::math_opt::Termination</a></div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00256">solve_result.h:256</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a06f18b7e05b64c4ff0d03f07ae379a68"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a06f18b7e05b64c4ff0d03f07ae379a68">operations_research::math_opt::Termination::detail</a></div><div class="ttdeci">std::string detail</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00269">solve_result.h:269</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a19c380b03cea21d7ac7325136a131ff0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a19c380b03cea21d7ac7325136a131ff0">operations_research::math_opt::Termination::ToString</a></div><div class="ttdeci">std::string ToString() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00232">solve_result.cc:232</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a2abf4fd951d9a06c8a3dd568b3e3d0ff"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a2abf4fd951d9a06c8a3dd568b3e3d0ff">operations_research::math_opt::Termination::ToProto</a></div><div class="ttdeci">TerminationProto ToProto() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00176">solve_result.cc:176</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a36d5365d462f57468ba3a9d8ae6bbec9"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a36d5365d462f57468ba3a9d8ae6bbec9">operations_research::math_opt::Termination::reason</a></div><div class="ttdeci">TerminationReason reason</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00261">solve_result.h:261</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a6061a7748ed60136b17b65a73f8fa253"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a6061a7748ed60136b17b65a73f8fa253">operations_research::math_opt::Termination::Termination</a></div><div class="ttdeci">Termination(TerminationReason reason, std::string detail={})</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00160">solve_result.cc:160</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a68c433e3442a5efad6ddfd3bf58676de"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a68c433e3442a5efad6ddfd3bf58676de">operations_research::math_opt::Termination::limit_reached</a></div><div class="ttdeci">bool limit_reached() const</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00186">solve_result.cc:186</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a716121b3b7000e72df76b9451747f772"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a716121b3b7000e72df76b9451747f772">operations_research::math_opt::Termination::limit</a></div><div class="ttdeci">std::optional< Limit > limit</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8h_source.html#l00264">solve_result.h:264</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_a74d8374f91aea2ed483e7dee012eac69"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#a74d8374f91aea2ed483e7dee012eac69">operations_research::math_opt::Termination::FromProto</a></div><div class="ttdeci">static Termination FromProto(const TerminationProto &termination_proto)</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00191">solve_result.cc:191</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_ad72869988b927ea6fac876b976248829"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#ad72869988b927ea6fac876b976248829">operations_research::math_opt::Termination::Feasible</a></div><div class="ttdeci">static Termination Feasible(Limit limit, std::string detail={})</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00163">solve_result.cc:163</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_termination_html_aed022119fc9ab5f13bf9f95cde4dd1e0"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_termination.html#aed022119fc9ab5f13bf9f95cde4dd1e0">operations_research::math_opt::Termination::NoSolutionFound</a></div><div class="ttdeci">static Termination NoSolutionFound(Limit limit, std::string detail={})</div><div class="ttdef"><b>Definition:</b> <a href="solve__result_8cc_source.html#l00169">solve_result.cc:169</a></div></div>
|
|
<div class="ttc" id="avariable__and__expressions_8h_html"><div class="ttname"><a href="variable__and__expressions_8h.html">variable_and_expressions.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_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="solve__result_8h.html">solve_result.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>
|