472 lines
94 KiB
HTML
472 lines
94 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.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: 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.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&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('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">result.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="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_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_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 <string></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</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="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include "absl/status/statusor.h"</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "<a class="code" href="indexed__model_8h.html">ortools/math_opt/core/indexed_model.h</a>"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</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="l00025" name="l00025"></a><span class="lineno"> 25</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="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "ortools/math_opt/result.pb.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "ortools/math_opt/solution.pb.h"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="protoutil_8h.html">ortools/base/protoutil.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span>math_opt {</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment">// The result of solving an optimization problem with MathOpt::Solve.</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment">// TODO(b/172211596): there is already a parallel proto named solve result, the</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">// naming convention should be more consistent.</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html"> 37</a></span><span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_result.html">Result</a> {</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// A solution to an optimization problem.</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// E.g. consider a simple linear program:</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// min c * x</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// s.t. A * x >= b</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// x >= 0.</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// A primal solution is assignment values to x. It is feasible if it satisfies</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// A * x >= b and x >= 0 from above. In the class PrimalSolution below,</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// variable_values is x and objective_value is c * x.</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// For the general case of a MathOpt optimization model, see</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// go/mathopt-solutions for details.</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html"> 50</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html">PrimalSolution</a> {</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a91266736c5b498ef3e128f7af8154024"> 51</a></span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a91266736c5b498ef3e128f7af8154024">PrimalSolution</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a91266736c5b498ef3e128f7af8154024">PrimalSolution</a>(<a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html">IndexedPrimalSolution</a> indexed_solution);</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a217b557acea6edff9d4174403dc2f2ff"> 54</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a217b557acea6edff9d4174403dc2f2ff">variable_values</a>;</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a69703b8569462134ad4e22ab0133e418"> 55</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a69703b8569462134ad4e22ab0133e418">objective_value</a> = 0.0;</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> };</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// A direction of unbounded improvement to an optimization problem;</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// equivalently, a certificate of infeasibility for the dual of the</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// optimization problem.</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// E.g. consider a simple linear program:</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// min c * x</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// s.t. A * x >= b</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// x >= 0</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// A primal ray is an x that satisfies:</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// c * x < 0</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// A * x >= 0</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// x >= 0</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Observe that given a feasible solution, any positive multiple of the primal</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// ray plus that solution is still feasible, and gives a better objective</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// value. A primal ray also proves the dual optimization problem infeasible.</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// In the class PrimalRay below, variable_values is this x.</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// For the general case of a MathOpt optimization model, see</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// go/mathopt-solutions for details.</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html"> 78</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html">PrimalRay</a> {</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html#a9ea206117e5ce3c7ee6896953f3f84c3"> 79</a></span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html#a9ea206117e5ce3c7ee6896953f3f84c3">PrimalRay</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html#a9ea206117e5ce3c7ee6896953f3f84c3">PrimalRay</a>(<a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_indexed_primal_ray.html">IndexedPrimalRay</a> indexed_ray);</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_result_1_1_primal_ray.html#a217b557acea6edff9d4174403dc2f2ff"> 82</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html#a217b557acea6edff9d4174403dc2f2ff">variable_values</a>;</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> };</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// A solution to the dual of an optimization problem.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// E.g. consider the primal dual pair linear program pair:</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// (Primal) (Dual)</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// min c * x max b * y</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// s.t. A * x >= b s.t. y * A + r = c</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// x >= 0 y, r >= 0.</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// The dual solution is the pair (y, r). It is feasible if it satisfies the</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// constraints from (Dual) above.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// Below, y is dual_values, r is reduced_costs, and b * y is objective value.</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// For the general case, see go/mathopt-solutions and go/mathopt-dual (and</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// note that the dual objective depends on r in the general case).</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html"> 99</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html">DualSolution</a> {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a26aa149207b76b4758e3374bbb0bfc6a"> 100</a></span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a26aa149207b76b4758e3374bbb0bfc6a">DualSolution</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a26aa149207b76b4758e3374bbb0bfc6a">DualSolution</a>(<a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html">IndexedDualSolution</a> indexed_solution);</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a801b3639c3daff80850bf450a95fab3d"> 103</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<double></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a801b3639c3daff80850bf450a95fab3d">dual_values</a>;</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a8c59e260c5341833e0c29dfbeb4b92a3"> 104</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a8c59e260c5341833e0c29dfbeb4b92a3">reduced_costs</a>;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a69703b8569462134ad4e22ab0133e418"> 105</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a69703b8569462134ad4e22ab0133e418">objective_value</a> = 0.0;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> };</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// A direction of unbounded improvement to the dual of an optimization,</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// problem; equivalently, a certificate of primal infeasibility.</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// E.g. consider the primal dual pair linear program pair:</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// (Primal) (Dual)</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// min c * x max b * y</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// s.t. A * x >= b s.t. y * A + r = c</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// x >= 0 y, r >= 0.</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// The dual ray is the pair (y, r) satisfying:</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// b * y > 0</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// y * A + r = 0</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// y, r >= 0</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// Observe that adding a positive multiple of (y, r) to dual feasible solution</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// maintains dual feasibility and improves the objective (proving the dual is</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// unbounded). The dual ray also proves the primal problem is infeasible.</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// In the class DualRay below, y is dual_values and r is reduced_costs.</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// For the general case, see go/mathopt-solutions and go/mathopt-dual (and</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// note that the dual objective depends on r in the general case).</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html"> 128</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html">DualRay</a> {</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a2b3653881f60f4bf506f6c7b95af3ef2"> 129</a></span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a2b3653881f60f4bf506f6c7b95af3ef2">DualRay</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a2b3653881f60f4bf506f6c7b95af3ef2">DualRay</a>(<a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html">IndexedDualRay</a> indexed_ray);</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_result_1_1_dual_ray.html#a801b3639c3daff80850bf450a95fab3d"> 132</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<double></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a801b3639c3daff80850bf450a95fab3d">dual_values</a>;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a8c59e260c5341833e0c29dfbeb4b92a3"> 133</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<double></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a8c59e260c5341833e0c29dfbeb4b92a3">reduced_costs</a>;</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> };</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> </div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// A combinatorial characterization for a solution to a linear program.</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// The simplex method for solving linear programs always returns a "basic</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// feasible solution" which can be described combinatorially as a Basis. A</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// basis assigns a BasisStatus for every variable and linear constraint.</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// E.g. consider a standard form LP:</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// min c * x</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// s.t. A * x = b</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// x >= 0</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// that has more variables than constraints and with full row rank A.</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// Let n be the number of variables and m the number of linear constraints. A</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// valid basis for this problem can be constructed as follows:</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// * All constraints will have basis status FIXED.</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// * Pick m variables such that the columns of A are linearly independent and</span></div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// assign the status BASIC.</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// * Assign the status AT_LOWER for the remaining n - m variables.</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// The basic solution for this basis is the unique solution of A * x = b that</span></div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// has all variables with status AT_LOWER fixed to their lower bounds (all</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// zero). The resulting solution is called a basic feasible solution if it</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// also satisfies x >= 0.</span></div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// See go/mathopt-basis for treatment of the general case and an explanation</span></div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// of how a dual solution is determined for a basis.</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html"> 162</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html">Basis</a> {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#aa26f5c33c4803f6f86e352b35c0d0c54"> 163</a></span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#aa26f5c33c4803f6f86e352b35c0d0c54">Basis</a>() = <span class="keywordflow">default</span>;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#aa26f5c33c4803f6f86e352b35c0d0c54">Basis</a>(<a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_struct" href="structoperations__research_1_1math__opt_1_1_indexed_basis.html">IndexedBasis</a> indexed_basis);</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> </div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#a861aab8e91d4e8a0201d4de3154cf01f"> 166</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">LinearConstraintMap<BasisStatus></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#a861aab8e91d4e8a0201d4de3154cf01f">constraint_status</a>;</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#a5dc49f0eb9f9a7a1f0d1a0e93a823bc5"> 167</a></span> <a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_id_map.html">VariableMap<BasisStatus></a> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#a5dc49f0eb9f9a7a1f0d1a0e93a823bc5">variable_status</a>;</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> };</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#ac4f68c0ccada9fb3ecb536dc47843d40">Result</a>(<a class="code hl_class" href="classoperations__research_1_1math__opt_1_1_indexed_model.html">IndexedModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="keyword">const</span> SolveResultProto& solve_result);</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// The objective value of the best primal solution. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// are no primal solutions.</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a84f066c304d8bcbb9567be094feb9b08"> 174</a></span> <span class="keywordtype">double</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a84f066c304d8bcbb9567be094feb9b08">objective_value</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a712271fcdb3e50439c4802d9983f93de">has_solution</a>());</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a195a613e6f4f428a13f8da84725a197f">primal_solutions</a>[0].objective_value;</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> }</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a2dc761880474e791f59285a792f7d1bb"> 179</a></span> absl::Duration <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a2dc761880474e791f59285a792f7d1bb">solve_time</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceutil__time.html#a801584734c5b3898f94cf932202b2eb7">util_time::DecodeGoogleApiProto</a>(<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a6183bb2e39fee640317587be62b8a5e6">solve_stats</a>.solve_time()).value();</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> </div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// Indicates if at least one primal feasible solution is available.</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// When termination_reason is TERMINATION_REASON_OPTIMAL, this is guaranteed</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// to be true and need not be checked.</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a712271fcdb3e50439c4802d9983f93de"> 187</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a712271fcdb3e50439c4802d9983f93de">has_solution</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a195a613e6f4f428a13f8da84725a197f">primal_solutions</a>.empty(); }</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> </div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// The variable values from the best primal solution. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// are no primal solutions.</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#ac4a6e078f25aa73eec5271d449a12532"> 191</a></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_result.html#ac4a6e078f25aa73eec5271d449a12532">variable_values</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a712271fcdb3e50439c4802d9983f93de">has_solution</a>());</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a195a613e6f4f428a13f8da84725a197f">primal_solutions</a>[0].variable_values;</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"> 196</span> <span class="comment">// Indicates if at least one primal ray is available.</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="comment">// This is NOT guaranteed to be true when termination_reason is</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// UNBOUNDED or DUAL_INFEASIBLE.</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a92d19a5e106290c1b90a5184a4826936"> 200</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_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_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">primal_rays</a>.empty(); }</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> </div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// The variable values from the first primal ray. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// are no primal rays.</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a111ca69b2f4a515754ff424f8214efe6"> 204</a></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_result.html#a111ca69b2f4a515754ff424f8214efe6">ray_variable_values</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a92d19a5e106290c1b90a5184a4826936">has_ray</a>());</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">primal_rays</a>[0].variable_values;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</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">// Indicates if at least one dual solution is available.</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// This is NOT guaranteed to be true when termination_reason is</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// TERMINATION_REASON_OPTIMAL.</span></div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#ae649adda3768ef9a888061f9396903de"> 213</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#ae649adda3768ef9a888061f9396903de">has_dual_solution</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#add1943472845692060a2649cea91b9e5">dual_solutions</a>.empty(); }</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> </div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// The dual values from the best dual solution. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">// are no dual solutions.</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a116b227550e648d43bfbaccf9557ce42"> 217</a></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_result.html#a116b227550e648d43bfbaccf9557ce42">dual_values</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#ae649adda3768ef9a888061f9396903de">has_dual_solution</a>());</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#add1943472845692060a2649cea91b9e5">dual_solutions</a>[0].dual_values;</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> </div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// The reduced from the best dual solution. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// are no dual solutions.</span></div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// TODO(b/174564572): if reduced_costs in DualSolution was something like</span></div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// dual_reduced cost it would help prevent people forgetting to call</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// has_dual_solution().</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#acc1f8f5ed04e9ea770b526fa34d6076c"> 227</a></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_result.html#acc1f8f5ed04e9ea770b526fa34d6076c">reduced_costs</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#ae649adda3768ef9a888061f9396903de">has_dual_solution</a>());</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#add1943472845692060a2649cea91b9e5">dual_solutions</a>[0].reduced_costs;</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> </div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// Indicates if at least one dual ray is available.</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// This is NOT guaranteed to be true when termination_reason is</span></div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// INFEASIBLE.</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a240b106da863fbff10545e97c2c72007"> 236</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_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_result.html#af8a0308f391215b9c41b855832504054">dual_rays</a>.empty(); }</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 dual values from the first dual ray. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// are no dual rays.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// TODO(b/174564572): note the redunancy of the "double" dual and the</span></div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// inconsistency with `dual_values` in the proto.</span></div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a5511ef5b247197964fac748cc4a8de1f"> 242</a></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_result.html#a5511ef5b247197964fac748cc4a8de1f">ray_dual_values</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a240b106da863fbff10545e97c2c72007">has_dual_ray</a>());</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#af8a0308f391215b9c41b855832504054">dual_rays</a>[0].dual_values;</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> </div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// The reduced from the first dual ray. Will CHECK fail if there</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="comment">// are no dual rays.</span></div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#aafa2eea97d94bf02b53add568f96a5b7"> 249</a></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_result.html#aafa2eea97d94bf02b53add568f96a5b7">ray_reduced_costs</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a240b106da863fbff10545e97c2c72007">has_dual_ray</a>());</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#af8a0308f391215b9c41b855832504054">dual_rays</a>[0].reduced_costs;</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"> 253</span> </div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// Indicates if at least one basis is available.</span></div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a62c089ac76f862b590837a1e3222255a"> 255</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a62c089ac76f862b590837a1e3222255a">has_basis</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !<a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#affcbde612045e8c0013c9c8b8c571aa4">basis</a>.empty(); }</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> </div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// The constraint basis status for the first primal/dual pair.</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#ab62d9dad5e21d92465fbe8c1d4b34369"> 258</a></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_result.html#ab62d9dad5e21d92465fbe8c1d4b34369">constraint_status</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a62c089ac76f862b590837a1e3222255a">has_basis</a>());</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#affcbde612045e8c0013c9c8b8c571aa4">basis</a>[0].constraint_status;</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> }</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">// The variable basis status for the first primal/dual pair.</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_result.html#a1e2301bdfac3bd250b16fe5ba4b22190"> 264</a></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_result.html#a1e2301bdfac3bd250b16fe5ba4b22190">variable_status</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_function" href="structoperations__research_1_1math__opt_1_1_result.html#a62c089ac76f862b590837a1e3222255a">has_basis</a>());</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#affcbde612045e8c0013c9c8b8c571aa4">basis</a>[0].variable_status;</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> }</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> </div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a348ba125b5dd1e6ee310de01c8ae4c54"> 269</a></span> std::vector<std::string> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a348ba125b5dd1e6ee310de01c8ae4c54">warnings</a>;</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#aa40f46a9ffd7e5e740dd07f990d57078"> 270</a></span> SolveResultProto::TerminationReason <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#aa40f46a9ffd7e5e740dd07f990d57078">termination_reason</a> =</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> SolveResultProto::TERMINATION_REASON_UNSPECIFIED;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a7427661813c1b5a8a05d02b913eadfc9"> 272</a></span> std::string <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a7427661813c1b5a8a05d02b913eadfc9">termination_detail</a>;</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a6183bb2e39fee640317587be62b8a5e6"> 273</a></span> SolveStatsProto <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a6183bb2e39fee640317587be62b8a5e6">solve_stats</a>;</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">// Primal solutions should be ordered best objective value first.</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a195a613e6f4f428a13f8da84725a197f"> 276</a></span> std::vector<PrimalSolution> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a195a613e6f4f428a13f8da84725a197f">primal_solutions</a>;</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8"> 277</a></span> std::vector<PrimalRay> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">primal_rays</a>;</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> </div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// Dual solutions should be ordered best objective value first.</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#add1943472845692060a2649cea91b9e5"> 280</a></span> std::vector<DualSolution> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#add1943472845692060a2649cea91b9e5">dual_solutions</a>;</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#af8a0308f391215b9c41b855832504054"> 281</a></span> std::vector<DualRay> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#af8a0308f391215b9c41b855832504054">dual_rays</a>;</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> </div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="comment">// basis[i] corresponds to the primal dual pair:</span></div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="comment">// {primal_solutions[i], dual_solutions[i]}. These fields must have at least</span></div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// as many elements as basis. Basis will only be populated for LPs, and may</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="comment">// not be populated.</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#affcbde612045e8c0013c9c8b8c571aa4"> 287</a></span> std::vector<Basis> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#affcbde612045e8c0013c9c8b8c571aa4">basis</a>;</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> </div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// Set to true if MathOpt::Solve() has attempted an incremental solve instead</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// of starting from scratch.</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// We have three components involve in Solve(): MathOpt, the solver wrapper</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="comment">// (solver.h) and the actual solver (SCIP, ...). For some model modifications,</span></div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// the wrapper can support modifying the actual solver's in-memory model</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// instead of recreating it from scratch. This member is set to true when this</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// happens.</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"><a class="line" href="structoperations__research_1_1math__opt_1_1_result.html#a33beca02bf1e747c6d65374e00cf0d26"> 297</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1math__opt_1_1_result.html#a33beca02bf1e747c6d65374e00cf0d26">attempted_incremental_solve</a> = <span class="keyword">false</span>;</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> </div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span>} <span class="comment">// namespace math_opt</span></div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> </div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_MATH_OPT_CPP_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="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00492">base/logging.h:492</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#l00054">id_map.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1math__opt_1_1_indexed_model_html"><div class="ttname"><a href="classoperations__research_1_1math__opt_1_1_indexed_model.html">operations_research::math_opt::IndexedModel</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00161">indexed_model.h:161</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="aindexed__model_8h_html"><div class="ttname"><a href="indexed__model_8h.html">indexed_model.h</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="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="anamespaceutil__time_html_a801584734c5b3898f94cf932202b2eb7"><div class="ttname"><a href="namespaceutil__time.html#a801584734c5b3898f94cf932202b2eb7">util_time::DecodeGoogleApiProto</a></div><div class="ttdeci">inline ::absl::StatusOr< absl::Duration > DecodeGoogleApiProto(const google::protobuf::Duration &proto)</div><div class="ttdef"><b>Definition:</b> <a href="protoutil_8h_source.html#l00042">protoutil.h:42</a></div></div>
|
|
<div class="ttc" id="aprotoutil_8h_html"><div class="ttname"><a href="protoutil_8h.html">protoutil.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_indexed_basis_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_basis.html">operations_research::math_opt::IndexedBasis</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00656">indexed_model.h:656</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_indexed_dual_ray_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_ray.html">operations_research::math_opt::IndexedDualRay</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00645">indexed_model.h:645</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_indexed_dual_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_dual_solution.html">operations_research::math_opt::IndexedDualSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00628">indexed_model.h:628</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_indexed_primal_ray_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_ray.html">operations_research::math_opt::IndexedPrimalRay</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00618">indexed_model.h:618</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_indexed_primal_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_indexed_primal_solution.html">operations_research::math_opt::IndexedPrimalSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="indexed__model_8h_source.html#l00597">indexed_model.h:597</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_basis_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html">operations_research::math_opt::Result::Basis</a></div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00162">result.h:162</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_basis_html_a5dc49f0eb9f9a7a1f0d1a0e93a823bc5"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#a5dc49f0eb9f9a7a1f0d1a0e93a823bc5">operations_research::math_opt::Result::Basis::variable_status</a></div><div class="ttdeci">VariableMap< BasisStatus > variable_status</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00167">result.h:167</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_basis_html_a861aab8e91d4e8a0201d4de3154cf01f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#a861aab8e91d4e8a0201d4de3154cf01f">operations_research::math_opt::Result::Basis::constraint_status</a></div><div class="ttdeci">LinearConstraintMap< BasisStatus > constraint_status</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00166">result.h:166</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_basis_html_aa26f5c33c4803f6f86e352b35c0d0c54"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_basis.html#aa26f5c33c4803f6f86e352b35c0d0c54">operations_research::math_opt::Result::Basis::Basis</a></div><div class="ttdeci">Basis()=default</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_ray_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html">operations_research::math_opt::Result::DualRay</a></div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00128">result.h:128</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_ray_html_a2b3653881f60f4bf506f6c7b95af3ef2"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a2b3653881f60f4bf506f6c7b95af3ef2">operations_research::math_opt::Result::DualRay::DualRay</a></div><div class="ttdeci">DualRay()=default</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_ray_html_a801b3639c3daff80850bf450a95fab3d"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a801b3639c3daff80850bf450a95fab3d">operations_research::math_opt::Result::DualRay::dual_values</a></div><div class="ttdeci">LinearConstraintMap< double > dual_values</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00132">result.h:132</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_ray_html_a8c59e260c5341833e0c29dfbeb4b92a3"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_ray.html#a8c59e260c5341833e0c29dfbeb4b92a3">operations_research::math_opt::Result::DualRay::reduced_costs</a></div><div class="ttdeci">VariableMap< double > reduced_costs</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00133">result.h:133</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html">operations_research::math_opt::Result::DualSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00099">result.h:99</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_solution_html_a26aa149207b76b4758e3374bbb0bfc6a"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a26aa149207b76b4758e3374bbb0bfc6a">operations_research::math_opt::Result::DualSolution::DualSolution</a></div><div class="ttdeci">DualSolution()=default</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_solution_html_a69703b8569462134ad4e22ab0133e418"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a69703b8569462134ad4e22ab0133e418">operations_research::math_opt::Result::DualSolution::objective_value</a></div><div class="ttdeci">double objective_value</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00105">result.h:105</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_solution_html_a801b3639c3daff80850bf450a95fab3d"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a801b3639c3daff80850bf450a95fab3d">operations_research::math_opt::Result::DualSolution::dual_values</a></div><div class="ttdeci">LinearConstraintMap< double > dual_values</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00103">result.h:103</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_dual_solution_html_a8c59e260c5341833e0c29dfbeb4b92a3"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_dual_solution.html#a8c59e260c5341833e0c29dfbeb4b92a3">operations_research::math_opt::Result::DualSolution::reduced_costs</a></div><div class="ttdeci">VariableMap< double > reduced_costs</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00104">result.h:104</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_ray_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html">operations_research::math_opt::Result::PrimalRay</a></div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00078">result.h:78</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_ray_html_a217b557acea6edff9d4174403dc2f2ff"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html#a217b557acea6edff9d4174403dc2f2ff">operations_research::math_opt::Result::PrimalRay::variable_values</a></div><div class="ttdeci">VariableMap< double > variable_values</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00082">result.h:82</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_ray_html_a9ea206117e5ce3c7ee6896953f3f84c3"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_ray.html#a9ea206117e5ce3c7ee6896953f3f84c3">operations_research::math_opt::Result::PrimalRay::PrimalRay</a></div><div class="ttdeci">PrimalRay()=default</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_solution_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html">operations_research::math_opt::Result::PrimalSolution</a></div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00050">result.h:50</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_solution_html_a217b557acea6edff9d4174403dc2f2ff"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a217b557acea6edff9d4174403dc2f2ff">operations_research::math_opt::Result::PrimalSolution::variable_values</a></div><div class="ttdeci">VariableMap< double > variable_values</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00054">result.h:54</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_solution_html_a69703b8569462134ad4e22ab0133e418"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a69703b8569462134ad4e22ab0133e418">operations_research::math_opt::Result::PrimalSolution::objective_value</a></div><div class="ttdeci">double objective_value</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00055">result.h:55</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_1_1_primal_solution_html_a91266736c5b498ef3e128f7af8154024"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result_1_1_primal_solution.html#a91266736c5b498ef3e128f7af8154024">operations_research::math_opt::Result::PrimalSolution::PrimalSolution</a></div><div class="ttdeci">PrimalSolution()=default</div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html">operations_research::math_opt::Result</a></div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00037">result.h:37</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a111ca69b2f4a515754ff424f8214efe6"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a111ca69b2f4a515754ff424f8214efe6">operations_research::math_opt::Result::ray_variable_values</a></div><div class="ttdeci">const VariableMap< double > & ray_variable_values() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00204">result.h:204</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a116b227550e648d43bfbaccf9557ce42"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a116b227550e648d43bfbaccf9557ce42">operations_research::math_opt::Result::dual_values</a></div><div class="ttdeci">const LinearConstraintMap< double > & dual_values() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00217">result.h:217</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a195a613e6f4f428a13f8da84725a197f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a195a613e6f4f428a13f8da84725a197f">operations_research::math_opt::Result::primal_solutions</a></div><div class="ttdeci">std::vector< PrimalSolution > primal_solutions</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00276">result.h:276</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a1e2301bdfac3bd250b16fe5ba4b22190"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a1e2301bdfac3bd250b16fe5ba4b22190">operations_research::math_opt::Result::variable_status</a></div><div class="ttdeci">const VariableMap< BasisStatus > & variable_status() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00264">result.h:264</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a240b106da863fbff10545e97c2c72007"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a240b106da863fbff10545e97c2c72007">operations_research::math_opt::Result::has_dual_ray</a></div><div class="ttdeci">bool has_dual_ray() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00236">result.h:236</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a2dc761880474e791f59285a792f7d1bb"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a2dc761880474e791f59285a792f7d1bb">operations_research::math_opt::Result::solve_time</a></div><div class="ttdeci">absl::Duration solve_time() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00179">result.h:179</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a33beca02bf1e747c6d65374e00cf0d26"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a33beca02bf1e747c6d65374e00cf0d26">operations_research::math_opt::Result::attempted_incremental_solve</a></div><div class="ttdeci">bool attempted_incremental_solve</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00297">result.h:297</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a348ba125b5dd1e6ee310de01c8ae4c54"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a348ba125b5dd1e6ee310de01c8ae4c54">operations_research::math_opt::Result::warnings</a></div><div class="ttdeci">std::vector< std::string > warnings</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00269">result.h:269</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a5511ef5b247197964fac748cc4a8de1f"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a5511ef5b247197964fac748cc4a8de1f">operations_research::math_opt::Result::ray_dual_values</a></div><div class="ttdeci">const LinearConstraintMap< double > & ray_dual_values() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00242">result.h:242</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a6183bb2e39fee640317587be62b8a5e6"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a6183bb2e39fee640317587be62b8a5e6">operations_research::math_opt::Result::solve_stats</a></div><div class="ttdeci">SolveStatsProto solve_stats</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00273">result.h:273</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a62c089ac76f862b590837a1e3222255a"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a62c089ac76f862b590837a1e3222255a">operations_research::math_opt::Result::has_basis</a></div><div class="ttdeci">bool has_basis() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00255">result.h:255</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a6e4b0ba0339c6172e9bfa3df9f8c61d8"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a6e4b0ba0339c6172e9bfa3df9f8c61d8">operations_research::math_opt::Result::primal_rays</a></div><div class="ttdeci">std::vector< PrimalRay > primal_rays</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00277">result.h:277</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a712271fcdb3e50439c4802d9983f93de"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a712271fcdb3e50439c4802d9983f93de">operations_research::math_opt::Result::has_solution</a></div><div class="ttdeci">bool has_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00187">result.h:187</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a7427661813c1b5a8a05d02b913eadfc9"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a7427661813c1b5a8a05d02b913eadfc9">operations_research::math_opt::Result::termination_detail</a></div><div class="ttdeci">std::string termination_detail</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00272">result.h:272</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a84f066c304d8bcbb9567be094feb9b08"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a84f066c304d8bcbb9567be094feb9b08">operations_research::math_opt::Result::objective_value</a></div><div class="ttdeci">double objective_value() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00174">result.h:174</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_a92d19a5e106290c1b90a5184a4826936"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#a92d19a5e106290c1b90a5184a4826936">operations_research::math_opt::Result::has_ray</a></div><div class="ttdeci">bool has_ray() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00200">result.h:200</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_aa40f46a9ffd7e5e740dd07f990d57078"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#aa40f46a9ffd7e5e740dd07f990d57078">operations_research::math_opt::Result::termination_reason</a></div><div class="ttdeci">SolveResultProto::TerminationReason termination_reason</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00270">result.h:270</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_aafa2eea97d94bf02b53add568f96a5b7"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#aafa2eea97d94bf02b53add568f96a5b7">operations_research::math_opt::Result::ray_reduced_costs</a></div><div class="ttdeci">const VariableMap< double > & ray_reduced_costs() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00249">result.h:249</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_ab62d9dad5e21d92465fbe8c1d4b34369"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#ab62d9dad5e21d92465fbe8c1d4b34369">operations_research::math_opt::Result::constraint_status</a></div><div class="ttdeci">const LinearConstraintMap< BasisStatus > & constraint_status() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00258">result.h:258</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_ac4a6e078f25aa73eec5271d449a12532"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#ac4a6e078f25aa73eec5271d449a12532">operations_research::math_opt::Result::variable_values</a></div><div class="ttdeci">const VariableMap< double > & variable_values() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00191">result.h:191</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_ac4f68c0ccada9fb3ecb536dc47843d40"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#ac4f68c0ccada9fb3ecb536dc47843d40">operations_research::math_opt::Result::Result</a></div><div class="ttdeci">Result(IndexedModel *model, const SolveResultProto &solve_result)</div><div class="ttdef"><b>Definition:</b> <a href="result_8cc_source.html#l00049">result.cc:49</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_acc1f8f5ed04e9ea770b526fa34d6076c"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#acc1f8f5ed04e9ea770b526fa34d6076c">operations_research::math_opt::Result::reduced_costs</a></div><div class="ttdeci">const VariableMap< double > & reduced_costs() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00227">result.h:227</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_add1943472845692060a2649cea91b9e5"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#add1943472845692060a2649cea91b9e5">operations_research::math_opt::Result::dual_solutions</a></div><div class="ttdeci">std::vector< DualSolution > dual_solutions</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00280">result.h:280</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_ae649adda3768ef9a888061f9396903de"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#ae649adda3768ef9a888061f9396903de">operations_research::math_opt::Result::has_dual_solution</a></div><div class="ttdeci">bool has_dual_solution() const</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00213">result.h:213</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_af8a0308f391215b9c41b855832504054"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#af8a0308f391215b9c41b855832504054">operations_research::math_opt::Result::dual_rays</a></div><div class="ttdeci">std::vector< DualRay > dual_rays</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00281">result.h:281</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1math__opt_1_1_result_html_affcbde612045e8c0013c9c8b8c571aa4"><div class="ttname"><a href="structoperations__research_1_1math__opt_1_1_result.html#affcbde612045e8c0013c9c8b8c571aa4">operations_research::math_opt::Result::basis</a></div><div class="ttdeci">std::vector< Basis > basis</div><div class="ttdef"><b>Definition:</b> <a href="result_8h_source.html#l00287">result.h:287</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="result_8h.html">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.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|