228 lines
183 KiB
HTML
228 lines
183 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.8.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: feasibility_pump.cc 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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('feasibility__pump_8cc_source.html','');});
|
|
/* @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">feasibility_pump.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="feasibility__pump_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a 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 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 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 name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a 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 name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a 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 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 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 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 name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="feasibility__pump_8h.html">ortools/sat/feasibility_pump.h</a>"</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="lp__types_8h.html">ortools/lp_data/lp_types.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="cp__model_8pb_8h.html">ortools/sat/cp_model.pb.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">using</span> glop::ColIndex;</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">using</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a0f6bd47b8956b59589718bd40b1cf8bc">glop::ConstraintStatus</a>;</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">using</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">glop::Fractional</a>;</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">using</span> glop::RowIndex;</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">const</span> <span class="keywordtype">double</span> FeasibilityPump::kCpEpsilon = 1e-4;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a477d40d2455543bdf702f13fa36f4ddd"> 38</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a477d40d2455543bdf702f13fa36f4ddd">FeasibilityPump::FeasibilityPump</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  : sat_parameters_(*(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html">SatParameters</a>>())),</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  time_limit_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  integer_encoder_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>()),</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  incomplete_solutions_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Mutable<<a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html">SharedIncompleteSolutionManager</a>>()),</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  sat_solver_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()),</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  domains_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="structoperations__research_1_1sat_1_1_integer_domains.html">IntegerDomains</a>>()),</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  mapping_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get<<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_mapping.html">CpModelMapping</a>>()) {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// Tweak the default parameters to make the solve incremental.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="classoperations__research_1_1glop_1_1_glop_parameters.html">glop::GlopParameters</a> <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// Note(user): Primal simplex does better here since we have a limit on</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// simplex iterations. So dual simplex sometimes fails to find a LP feasible</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// solution.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_dual_simplex(<span class="keyword">false</span>);</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_max_number_of_iterations(2000);</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ae7202d055b6b172a8a1da4f5b136f9ea">SetParameters</a>(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  integer_lp_.<a class="code" href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">clear</a>();</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> }</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a18206039e9f0c76f2b35907a4f6ea812"> 60</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a18206039e9f0c76f2b35907a4f6ea812">FeasibilityPump::~FeasibilityPump</a>() {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Feasibility Pump Total number of simplex iterations: "</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  << total_num_simplex_iterations_;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> }</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc"> 65</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">FeasibilityPump::AddLinearConstraint</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_constraint.html">LinearConstraint</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) {</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// We still create the mirror variable right away though.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.vars) {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  GetOrCreateMirrorVariable(<a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  integer_lp_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(LinearConstraintInternal());</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  LinearConstraintInternal& new_ct = integer_lp_.<a class="code" href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">back</a>();</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  new_ct.lb = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  new_ct.ub = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.vars.size();</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb, <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub);</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// We only use positive variable inside this class.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.vars[i];</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  IntegerValue coeff = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.coeffs[i];</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  coeff = -coeff;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  new_ct.terms.push_back({GetOrCreateMirrorVariable(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), coeff});</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// Important to keep lp_data_ "clean".</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  std::sort(new_ct.terms.begin(), new_ct.terms.end());</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ae384be06329c4c8f8fd62af7335dae2e"> 91</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ae384be06329c4c8f8fd62af7335dae2e">FeasibilityPump::SetObjectiveCoefficient</a>(IntegerVariable ivar,</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  IntegerValue coeff) {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  objective_is_defined_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> IntegerVariable pos_var =</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(ivar) ? ivar : <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(ivar);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (ivar != pos_var) coeff = -coeff;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = mirror_lp_variable_.find(pos_var);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (it == mirror_lp_variable_.end()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> = it->second;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  integer_objective_.push_back({<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, coeff});</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  objective_infinity_norm_ =</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(objective_infinity_norm_, <a class="code" href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">IntTypeAbs</a>(coeff));</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> ColIndex FeasibilityPump::GetOrCreateMirrorVariable(</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  IntegerVariable positive_variable) {</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">VariableIsPositive</a>(positive_variable));</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = mirror_lp_variable_.find(positive_variable);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (it == mirror_lp_variable_.end()) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> model_var =</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  mapping_-><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_mapping.html#a148597d78e10112b7e5e1f778de0410f">GetProtoVariableFromIntegerVariable</a>(positive_variable);</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  model_vars_size_ = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(model_vars_size_, model_var + 1);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(integer_variables_.size());</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  mirror_lp_variable_[positive_variable] = <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  integer_variables_.push_back(positive_variable);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  var_is_binary_.push_back(<span class="keyword">false</span>);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  lp_solution_.push_back(std::numeric_limits<double>::infinity());</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  integer_solution_.push_back(0);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">return</span> <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">return</span> it->second;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="keywordtype">void</span> FeasibilityPump::PrintStats() {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">if</span> (lp_solution_is_set_) {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Fractionality: "</span> << lp_solution_fractionality_;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Fractionality: NA"</span>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"simplex status: "</span> << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>();</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (integer_solution_is_set_) {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"#Infeasible const: "</span> << num_infeasible_constraints_;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Infeasibility: "</span> << integer_solution_infeasibility_;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Infeasibility: NA"</span>;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a942f29030f08426e7e318204e987e2f7"> 144</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a942f29030f08426e7e318204e987e2f7">FeasibilityPump::Solve</a>() {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>() == 0) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  InitializeWorkingLP();</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  UpdateBoundsOfLpVariables();</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  lp_solution_is_set_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  integer_solution_is_set_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Restore the original objective</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">for</span> (ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(0); <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>(); ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, 0.0);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : integer_objective_) {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(term.first, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(term.second));</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  mixing_factor_ = 1.0;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < max_fp_iterations_; ++i) {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  L1DistanceMinimize();</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (!SolveLp()) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (lp_solution_is_integer_) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">if</span> (!Round()) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// We don't end this loop if the integer solutions is feasible in hope to</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// get better solution.</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">if</span> (integer_solution_is_feasible_) MaybePushToRepo();</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">if</span> (model_is_unsat_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  PrintStats();</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  MaybePushToRepo();</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="keywordtype">void</span> FeasibilityPump::MaybePushToRepo() {</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (incomplete_solutions_ == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  std::vector<double> lp_solution(model_vars_size_,</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  std::numeric_limits<double>::infinity());</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// TODO(user): Consider adding solutions that have low fractionality.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (lp_solution_is_integer_) {</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Fill the solution using LP solution values.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable positive_var : integer_variables_) {</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> model_var =</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  mapping_-><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_mapping.html#a148597d78e10112b7e5e1f778de0410f">GetProtoVariableFromIntegerVariable</a>(positive_var);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">if</span> (model_var >= 0 && model_var < model_vars_size_) {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  lp_solution[model_var] = <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a680158afc869b1a617ca173fa0033202">GetLPSolutionValue</a>(positive_var);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  incomplete_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html#a058ba66ef63b5c36a5586b0151a75609">AddNewSolution</a>(lp_solution);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">if</span> (integer_solution_is_feasible_) {</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// Fill the solution using Integer solution values.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable positive_var : integer_variables_) {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> model_var =</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  mapping_-><a class="code" href="classoperations__research_1_1sat_1_1_cp_model_mapping.html#a148597d78e10112b7e5e1f778de0410f">GetProtoVariableFromIntegerVariable</a>(positive_var);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (model_var >= 0 && model_var < model_vars_size_) {</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  lp_solution[model_var] = <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a9ad847669329f6fbccf8e4553adc7dee">GetIntegerSolutionValue</a>(positive_var);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  incomplete_solutions_-><a class="code" href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html#a058ba66ef63b5c36a5586b0151a75609">AddNewSolution</a>(lp_solution);</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> }</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// ----------------------------------------------------------------</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// -------------------LPSolving------------------------------------</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment">// ----------------------------------------------------------------</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="keywordtype">void</span> FeasibilityPump::InitializeWorkingLP() {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// Create variables.</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < integer_variables_.size(); ++i) {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(ColIndex(i), lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">CreateNewVariable</a>());</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a7ddcdc56f25d075e18d62ddbcd3389b2">SetVariableType</a>(ColIndex(i),</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ac62972ff1b21a037e56530cde67309aba5d5cd46919fa987731fb2edefe0f2a0c">glop::LinearProgram::VariableType::INTEGER</a>);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// Add constraints.</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LinearConstraintInternal& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> : integer_lp_) {</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a67a7327915e66c0514cfa465a0475be1">ConstraintIndex</a> <a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a> = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">CreateNewConstraint</a>();</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">SetConstraintBounds</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.lb), <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ub));</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.terms) {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(<a class="code" href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a>, term.first, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(term.second));</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// Add objective.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : integer_objective_) {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(term.first, <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(term.second));</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">const</span> IntegerVariable cp_var = integer_variables_[i];</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(cp_var));</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(cp_var));</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(ColIndex(i), lb, ub);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  objective_normalization_factor_ = 0.0;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="namespaceoperations__research_1_1glop.html#a2b83a25cb4fd203c57a7155699fab246">glop::ColIndexVector</a> integer_variables;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> ColIndex num_cols = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>();</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">for</span> (ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a609bcb18cec39c7c43dd7a6d3a51ba81">IntegerVariablesList</a>()) {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  var_is_binary_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()] = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab8efe00bb016665606d522a42543cd96">IsVariableBinary</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (!var_is_binary_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]) {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  integer_variables.push_back(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// The aim of this normalization value is to compute a coefficient of the</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// d_i variables that should be minimized.</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  objective_normalization_factor_ +=</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  std::abs(lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a6137c2df856cf2634f9bb259d2aace2b">GetObjectiveCoefficientForMinimizationVersion</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>));</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a609bcb18cec39c7c43dd7a6d3a51ba81">IntegerVariablesList</a>().size(), 0);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  objective_normalization_factor_ =</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  objective_normalization_factor_ / lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a609bcb18cec39c7c43dd7a6d3a51ba81">IntegerVariablesList</a>().size();</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (!integer_variables.empty()) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// Update the LpProblem with norm variables and constraints.</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  norm_variables_.<a class="code" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html#af8d7048738ceb4c753b040e6d29db79c">assign</a>(num_cols, ColIndex(-1));</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  norm_lhs_constraints_.<a class="code" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html#af8d7048738ceb4c753b040e6d29db79c">assign</a>(num_cols, RowIndex(-1));</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  norm_rhs_constraints_.<a class="code" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html#af8d7048738ceb4c753b040e6d29db79c">assign</a>(num_cols, RowIndex(-1));</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// For each integer non-binary variable x_i we introduce one new variable</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// d_i subject to two new constraints:</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// d_i - x_i >= -round(x'_i)</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// d_i + x_i >= +round(x'_i)</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// That's round(x'_i) - d_i <= x_i <= round(x'_i) + d_i, where d_i is an</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// unbounded non-negative, and x'_i is the value of variable i from the</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// previous solution obtained during the projection step. Consequently</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// coefficients of the constraints are set here, but bounds of the</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// constraints are updated at each iteration of the feasibility pump. Also</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// coefficients of the objective are set here: x_i's are not present in the</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// objective (i.e., coefficients set to 0.0), and d_i's are present in the</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// objective with coefficients set to 1.0.</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// Note that the treatment of integer non-binary variables is different</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// from the treatment of binary variables. Binary variables do not impose</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// any extra variables, nor extra constraints, but their objective</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// coefficients are changed in the linear projection steps.</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : integer_variables) {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> ColIndex norm_variable = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">CreateNewVariable</a>();</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  norm_variables_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = norm_variable;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(norm_variable, 0.0, <a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a>);</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keyword">const</span> RowIndex row_a = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">CreateNewConstraint</a>();</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  norm_lhs_constraints_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = row_a;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(row_a, norm_variable, 1.0);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(row_a, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, -1.0);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">const</span> RowIndex row_b = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">CreateNewConstraint</a>();</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  norm_rhs_constraints_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] = row_b;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(row_b, norm_variable, 1.0);</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">SetCoefficient</a>(row_b, <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, 1.0);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  }</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a306cb123e8da242a6daf1c397dfe6e73">Scale</a>(&lp_data_);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aa23a76f0f582369176688b458cda07dc">AddSlackVariablesWhereNecessary</a>(</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">/*detect_integer_constraints=*/</span><span class="keyword">false</span>);</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> }</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="keywordtype">void</span> FeasibilityPump::L1DistanceMinimize() {</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  std::vector<double> new_obj_coeffs(lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>().value(), 0.0);</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// Set the original subobjective. The coefficients are scaled by mixing factor</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// and the offset remains at 0 (because it does not affect the solution).</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">const</span> ColIndex num_cols(lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a5c8255f82269d42db81cc944eff0180f">objective_coefficients</a>().<a class="code" href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html#a967a5c081ad4195a30c78dc2c0bcabf5">size</a>());</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">for</span> (ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(0); <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < num_cols; ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  new_obj_coeffs[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()] =</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  mixing_factor_ * lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a5c8255f82269d42db81cc944eff0180f">objective_coefficients</a>()[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>];</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// Set the norm subobjective. The coefficients are scaled by 1 - mixing factor</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// and the offset remains at 0 (because it does not affect the solution).</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> : lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a609bcb18cec39c7c43dd7a6d3a51ba81">IntegerVariablesList</a>()) {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (var_is_binary_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]) {</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> objective_coefficient =</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  mixing_factor_ * lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a5c8255f82269d42db81cc944eff0180f">objective_coefficients</a>()[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>] +</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  (1 - mixing_factor_) * objective_normalization_factor_ *</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  (1 - 2 * integer_solution_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]);</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  new_obj_coeffs[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()] = objective_coefficient;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  } <span class="keywordflow">else</span> { <span class="comment">// The variable is integer.</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// Update the bounds of the constraints added in</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// InitializeIntegerVariables() (see there for more details):</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="comment">// d_i - x_i >= -round(x'_i)</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// d_i + x_i >= +round(x'_i)</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// TODO(user): We change both the objective and the bounds, thus</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// breaking the incrementality. Handle integer variables differently,</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// e.g., intensify rounding, or use soft fixing from: Fischetti, Lodi,</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// "Local Branching", Math Program Ser B 98:23-47 (2003).</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">Fractional</a> objective_coefficient =</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  (1 - mixing_factor_) * objective_normalization_factor_;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  new_obj_coeffs[norm_variables_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>].value()] = objective_coefficient;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// At this point, constraint bounds have already been transformed into</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// bounds of slack variables. Instead of updating the constraints, we need</span></div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// to update the slack variables corresponding to them.</span></div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">const</span> ColIndex norm_lhs_slack_variable =</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a48de416333220c0bea7759c5aa53ee14">GetSlackVariable</a>(norm_lhs_constraints_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]);</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lhs_scaling_factor =</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">VariableScalingFactor</a>(norm_lhs_slack_variable);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  norm_lhs_slack_variable, -<a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a>,</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  lhs_scaling_factor * integer_solution_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]);</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">const</span> ColIndex norm_rhs_slack_variable =</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a48de416333220c0bea7759c5aa53ee14">GetSlackVariable</a>(norm_rhs_constraints_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>]);</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> rhs_scaling_factor =</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">VariableScalingFactor</a>(norm_rhs_slack_variable);</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  norm_rhs_slack_variable, -<a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a>,</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  -rhs_scaling_factor * integer_solution_[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]);</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  }</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">for</span> (ColIndex <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>(0); <a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a> < lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">num_variables</a>(); ++<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>) {</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">SetObjectiveCoefficient</a>(<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>, new_obj_coeffs[<a class="code" href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a>.value()]);</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// TODO(user): Tune this or expose as parameter.</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  mixing_factor_ *= 0.8;</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> }</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="keywordtype">bool</span> FeasibilityPump::SolveLp() {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"LP relaxation: "</span> << lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#adcc58612f6a1dc35ff3ffdb34188f299">GetDimensionString</a>() << <span class="stringliteral">"."</span>;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">const</span> <span class="keyword">auto</span> status = simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a866a68af5afd0355fb348f7a59eeff9e">Solve</a>(lp_data_, time_limit_);</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  total_num_simplex_iterations_ += simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ad8a718ceea92060a7f7118e2bccf4fbc">GetNumberOfIterations</a>();</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (!status.ok()) {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"The LP solver encountered an error: "</span> << status.error_message();</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ace96e115f468d752a2fcfeea901b0f8a">ClearStateForNextSolve</a>();</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="comment">// TODO(user): This shouldn't really happen except if the problem is UNSAT.</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">// But we can't just rely on a potentially imprecise LP to close the problem.</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// The rest of the solver should do that with exact precision.</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(3) << <span class="stringliteral">"simplex status: "</span> << simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>();</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a7850fcfea005b86b2a3fa0d4293c5ee0">glop::ProblemStatus::PRIMAL_INFEASIBLE</a>) {</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  lp_solution_fractionality_ = 0.0;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493af00c8dbdd6e1f11bdae06be94277d293">glop::ProblemStatus::OPTIMAL</a> ||</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a57ad14e7a035f33c8ba6c0ea9ea23caa">glop::ProblemStatus::DUAL_FEASIBLE</a> ||</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a2dcc8f5d91cb2aa2065b8305bf2d5cbd">glop::ProblemStatus::PRIMAL_FEASIBLE</a> ||</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">GetProblemStatus</a>() == <a class="code" href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a0beacd9ca195de65e685252f1b46b954">glop::ProblemStatus::IMPRECISE</a>) {</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  lp_solution_is_set_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = GetVariableValueAtCpScale(ColIndex(i));</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  lp_solution_[i] = <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  lp_solution_fractionality_ = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  lp_solution_fractionality_, std::abs(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> - std::round(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>)));</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// Compute the objective value.</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  lp_objective_ = 0;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : integer_objective_) {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  lp_objective_ += lp_solution_[term.first.value()] * term.second.value();</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  lp_solution_is_integer_ = lp_solution_fractionality_ < kCpEpsilon;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="keywordtype">void</span> FeasibilityPump::UpdateBoundsOfLpVariables() {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; i++) {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">const</span> IntegerVariable cp_var = integer_variables_[i];</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lb = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(cp_var));</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> ub = <a class="code" href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">ToDouble</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">LevelZeroUpperBound</a>(cp_var));</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> factor = scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">VariableScalingFactor</a>(ColIndex(i));</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">SetVariableBounds</a>(ColIndex(i), lb * factor, ub * factor);</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> }</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a680158afc869b1a617ca173fa0033202"> 417</a></span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a680158afc869b1a617ca173fa0033202">FeasibilityPump::GetLPSolutionValue</a>(IntegerVariable variable)<span class="keyword"> const </span>{</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">return</span> lp_solution_[<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(mirror_lp_variable_, variable).value()];</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> }</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="keywordtype">double</span> FeasibilityPump::GetVariableValueAtCpScale(ColIndex <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">return</span> scaler_.<a class="code" href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a60d41c66b603be0ec7517d437e5c63ec">UnscaleVariableValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#a201108c6e8d9fb5104697bdd0a8bd085">GetVariableValue</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> }</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// ----------------------------------------------------------------</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment">// -------------------Rounding-------------------------------------</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// ----------------------------------------------------------------</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div><div class="line"><a name="l00429"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a9ad847669329f6fbccf8e4553adc7dee"> 429</a></span> int64_t <a class="code" href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a9ad847669329f6fbccf8e4553adc7dee">FeasibilityPump::GetIntegerSolutionValue</a>(</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  IntegerVariable variable)<span class="keyword"> const </span>{</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> integer_solution_[<a class="code" href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a>(mirror_lp_variable_, variable)</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  .value()];</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="keywordtype">bool</span> FeasibilityPump::Round() {</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordtype">bool</span> rounding_successful = <span class="keyword">true</span>;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">if</span> (sat_parameters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a18b43f42eaf13ab756b22b49fc981881">fp_rounding</a>() == <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a30a14db0c416e43deb20a7374abe39a0">SatParameters::NEAREST_INTEGER</a>) {</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  rounding_successful = NearestIntegerRounding();</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sat_parameters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a18b43f42eaf13ab756b22b49fc981881">fp_rounding</a>() == <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a7b4e91d6ccf881f4d31d3c1fff97f330">SatParameters::LOCK_BASED</a>) {</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  rounding_successful = LockBasedRounding();</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sat_parameters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a18b43f42eaf13ab756b22b49fc981881">fp_rounding</a>() ==</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a93b17ac067d83120d7c2d3c680adf8c5">SatParameters::ACTIVE_LOCK_BASED</a>) {</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  rounding_successful = ActiveLockBasedRounding();</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sat_parameters_.<a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a18b43f42eaf13ab756b22b49fc981881">fp_rounding</a>() ==</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_parameters.html#a32c4461508cb8e523fa91e85e5ee6f9c">SatParameters::PROPAGATION_ASSISTED</a>) {</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  rounding_successful = PropagationRounding();</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  }</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">if</span> (!rounding_successful) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  FillIntegerSolutionStats();</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> }</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> </div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="keywordtype">bool</span> FeasibilityPump::NearestIntegerRounding() {</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">if</span> (!lp_solution_is_set_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lp_solution_.size(); ++i) {</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  integer_solution_[i] = static_cast<int64_t>(std::round(lp_solution_[i]));</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  integer_solution_is_set_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> }</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> </div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="keywordtype">bool</span> FeasibilityPump::LockBasedRounding() {</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">if</span> (!lp_solution_is_set_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// We compute the number of locks based on variable coefficient in constraints</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// and constraint bounds. This doesn't change over time so we cache it.</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">if</span> (var_up_locks_.empty()) {</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  var_up_locks_.resize(num_vars, 0);</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  var_down_locks_.resize(num_vars, 0);</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> entry : lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aeeee0971281f2781c379fce7a64a5049">GetSparseColumn</a>(ColIndex(i))) {</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  ColIndex slack = lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a48de416333220c0bea7759c5aa53ee14">GetSlackVariable</a>(entry.row());</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> constraint_upper_bounded =</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#a4ba664b00317505a0026d2a38e6dd565">variable_lower_bounds</a>()[slack] > -<a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a>;</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> constraint_lower_bounded =</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#acd138469679be137d0de53459b1342cb">variable_upper_bounds</a>()[slack] < <a class="code" href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">glop::kInfinity</a>;</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">if</span> (entry.coefficient() > 0) {</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  var_up_locks_[i] += constraint_upper_bounded;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  var_down_locks_[i] += constraint_lower_bounded;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  var_up_locks_[i] += constraint_lower_bounded;</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  var_down_locks_[i] += constraint_upper_bounded;</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  }</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lp_solution_.size(); ++i) {</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">if</span> (std::abs(lp_solution_[i] - std::round(lp_solution_[i])) < 0.1 ||</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  var_up_locks_[i] == var_down_locks_[i]) {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  integer_solution_[i] = static_cast<int64_t>(std::round(lp_solution_[i]));</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (var_up_locks_[i] > var_down_locks_[i]) {</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  integer_solution_[i] = static_cast<int64_t>(std::floor(lp_solution_[i]));</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  integer_solution_[i] = static_cast<int64_t>(std::ceil(lp_solution_[i]));</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  integer_solution_is_set_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> }</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="keywordtype">bool</span> FeasibilityPump::ActiveLockBasedRounding() {</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordflow">if</span> (!lp_solution_is_set_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = integer_variables_.size();</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// We compute the number of locks based on variable coefficient in constraints</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// and constraint bounds of active constraints. We consider the bound of the</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">// constraint that is tight for the current lp solution.</span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">if</span> (std::abs(lp_solution_[i] - std::round(lp_solution_[i])) < 0.1) {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  integer_solution_[i] = static_cast<int64_t>(std::round(lp_solution_[i]));</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> </div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">int</span> up_locks = 0;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keywordtype">int</span> down_locks = 0;</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> entry : lp_data_.<a class="code" href="classoperations__research_1_1glop_1_1_linear_program.html#aeeee0971281f2781c379fce7a64a5049">GetSparseColumn</a>(ColIndex(i))) {</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research_1_1glop.html#a0f6bd47b8956b59589718bd40b1cf8bc">ConstraintStatus</a> row_status =</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  simplex_.<a class="code" href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">GetConstraintStatus</a>(entry.row());</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">if</span> (row_status == ConstraintStatus::AT_LOWER_BOUND) {</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (entry.coefficient() > 0) {</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  down_locks++;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  up_locks++;</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (row_status == ConstraintStatus::AT_UPPER_BOUND) {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">if</span> (entry.coefficient() > 0) {</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  up_locks++;</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  down_locks++;</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  }</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">if</span> (up_locks == down_locks) {</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  integer_solution_[i] = static_cast<int64_t>(std::round(lp_solution_[i]));</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (up_locks > down_locks) {</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  integer_solution_[i] = static_cast<int64_t>(std::floor(lp_solution_[i]));</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  integer_solution_[i] = static_cast<int64_t>(std::ceil(lp_solution_[i]));</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  }</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> </div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  integer_solution_is_set_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> }</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> </div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="keywordtype">bool</span> FeasibilityPump::PropagationRounding() {</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">if</span> (!lp_solution_is_set_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>();</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> </div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// Compute an order in which we will fix variables and do the propagation.</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  std::vector<int> rounding_order;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  {</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  std::vector<std::pair<double, int>> binary_fractionality_vars;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  std::vector<std::pair<double, int>> general_fractionality_vars;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lp_solution_.size(); ++i) {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> fractionality =</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  std::abs(std::round(lp_solution_[i]) - lp_solution_[i]);</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (var_is_binary_[i]) {</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  binary_fractionality_vars.push_back({fractionality, i});</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  general_fractionality_vars.push_back({fractionality, i});</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  }</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  std::sort(binary_fractionality_vars.begin(),</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  binary_fractionality_vars.end());</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  std::sort(general_fractionality_vars.begin(),</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  general_fractionality_vars.end());</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> </div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < binary_fractionality_vars.size(); ++i) {</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  rounding_order.push_back(binary_fractionality_vars[i].second);</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < general_fractionality_vars.size(); ++i) {</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  rounding_order.push_back(general_fractionality_vars[i].second);</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  }</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> var_index : rounding_order) {</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordflow">if</span> (time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">LimitReached</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// Get the bounds of the variable.</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = integer_variables_[var_index];</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keyword">const</span> Domain& domain = (*domains_)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>];</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> </div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">if</span> (lb == ub) {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  integer_solution_[var_index] = lb.value();</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  }</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> </div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">const</span> int64_t rounded_value =</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  static_cast<int64_t>(std::round(lp_solution_[var_index]));</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keyword">const</span> int64_t floor_value =</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  static_cast<int64_t>(std::floor(lp_solution_[var_index]));</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">const</span> int64_t ceil_value =</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  static_cast<int64_t>(std::ceil(lp_solution_[var_index]));</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> </div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> floor_is_in_domain =</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  (domain.Contains(floor_value) && lb.value() <= floor_value);</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> ceil_is_in_domain =</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  (domain.Contains(ceil_value) && ub.value() >= ceil_value);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordflow">if</span> (domain.IsEmpty()) {</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  integer_solution_[var_index] = rounded_value;</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  model_is_unsat_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> </div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">if</span> (ceil_value < lb.value()) {</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  integer_solution_[var_index] = lb.value();</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (floor_value > ub.value()) {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  integer_solution_[var_index] = ub.value();</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ceil_is_in_domain && floor_is_in_domain) {</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(domain.Contains(rounded_value));</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  integer_solution_[var_index] = rounded_value;</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ceil_is_in_domain) {</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  integer_solution_[var_index] = ceil_value;</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (floor_is_in_domain) {</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  integer_solution_[var_index] = floor_value;</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">const</span> std::pair<IntegerLiteral, IntegerLiteral> values_in_domain =</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  integer_encoder_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a4a1c84558c01bae528113b50c0611564">Canonicalize</a>(</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(rounded_value)));</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> int64_t lower_value = values_in_domain.first.bound.value();</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="keyword">const</span> int64_t higher_value = -values_in_domain.second.bound.value();</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keyword">const</span> int64_t distance_from_lower_value =</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  std::abs(lower_value - rounded_value);</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keyword">const</span> int64_t distance_from_higher_value =</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  std::abs(higher_value - rounded_value);</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> </div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  integer_solution_[var_index] =</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  (distance_from_lower_value < distance_from_higher_value)</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  ? lower_value</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  : higher_value;</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  }</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> </div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(domain.Contains(integer_solution_[var_index]));</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(integer_solution_[var_index], lb);</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(integer_solution_[var_index], ub);</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> </div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// Propagate the value.</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="comment">//</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// When we want to fix the variable at its lb or ub, we do not create an</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="comment">// equality literal to minimize the number of new literal we create. This</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="comment">// is because creating an "== value" literal will implicitly also create</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// a ">= value" and a "<= value" literals.</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  Literal to_enqueue;</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(integer_solution_[var_index]);</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == lb) {</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  to_enqueue = integer_encoder_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">GetOrCreateAssociatedLiteral</a>(</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == ub) {</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  to_enqueue = integer_encoder_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">GetOrCreateAssociatedLiteral</a>(</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>));</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  to_enqueue =</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  integer_encoder_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a074fe196a1aaff1dd5fd73e0b3bb1f0e">GetOrCreateLiteralAssociatedToEquality</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> </div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span> (!sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">FinishPropagation</a>()) {</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  model_is_unsat_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859">EnqueueDecisionAndBacktrackOnConflict</a>(to_enqueue);</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> </div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">IsModelUnsat</a>()) {</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  model_is_unsat_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  sat_solver_-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">ResetToLevelZero</a>();</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  integer_solution_is_set_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> }</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> </div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="keywordtype">void</span> FeasibilityPump::FillIntegerSolutionStats() {</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// Compute the objective value.</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  integer_solution_objective_ = 0;</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : integer_objective_) {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  integer_solution_objective_ +=</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  integer_solution_[term.first.value()] * term.second.value();</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> </div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  integer_solution_is_feasible_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  num_infeasible_constraints_ = 0;</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  integer_solution_infeasibility_ = 0;</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">for</span> (RowIndex i(0); i < integer_lp_.size(); ++i) {</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  int64_t activity = 0;</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& term : integer_lp_[i].terms) {</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">const</span> int64_t prod =</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(integer_solution_[term.first.value()], term.second.value());</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">if</span> (prod <= <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() ||</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  prod >= <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  activity = prod;</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  activity = <a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(activity, prod);</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">if</span> (activity <= <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() ||</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  activity >= <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>())</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  }</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">if</span> (activity > integer_lp_[i].ub || activity < integer_lp_[i].lb) {</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  integer_solution_is_feasible_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  num_infeasible_constraints_++;</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">const</span> int64_t ub_infeasibility =</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  activity > integer_lp_[i].ub.value()</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  ? activity - integer_lp_[i].ub.value()</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  : 0;</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keyword">const</span> int64_t lb_infeasibility =</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  activity < integer_lp_[i].lb.value()</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  ? integer_lp_[i].lb.value() - activity</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  : 0;</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  integer_solution_infeasibility_ =</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(integer_solution_infeasibility_,</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(ub_infeasibility, lb_infeasibility));</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  }</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> }</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> </div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_ab8efe00bb016665606d522a42543cd96"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ab8efe00bb016665606d522a42543cd96">operations_research::glop::LinearProgram::IsVariableBinary</a></div><div class="ttdeci">bool IsVariableBinary(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00300">lp_data.cc:300</a></div></div>
|
|
<div class="ttc" id="base_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#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00106">time_limit.h:106</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_a477d40d2455543bdf702f13fa36f4ddd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a477d40d2455543bdf702f13fa36f4ddd">operations_research::sat::FeasibilityPump::FeasibilityPump</a></div><div class="ttdeci">FeasibilityPump(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00038">feasibility_pump.cc:38</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_ab5af7f232cddcd91f70be84c0d398ba9"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ab5af7f232cddcd91f70be84c0d398ba9">operations_research::glop::LinearProgram::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(ColIndex col, Fractional value)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00326">lp_data.cc:326</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00706">base/logging.h:706</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager_html_a058ba66ef63b5c36a5586b0151a75609"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html#a058ba66ef63b5c36a5586b0151a75609">operations_research::sat::SharedIncompleteSolutionManager::AddNewSolution</a></div><div class="ttdeci">void AddNewSolution(const std::vector< double > &lp_solution)</div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8cc_source.html#l00099">synchronization.cc:99</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_linear_constraint_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_constraint.html">operations_research::sat::LinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00033">sat/linear_constraint.h:33</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01383">integer.h:1383</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_a938b612b6f9885a417fda1bf886f4b39"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a938b612b6f9885a417fda1bf886f4b39">operations_research::glop::RevisedSimplex::GetProblemStatus</a></div><div class="ttdeci">ProblemStatus GetProblemStatus() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00597">revised_simplex.cc:597</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00983">base/logging.h:983</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_a201108c6e8d9fb5104697bdd0a8bd085"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a201108c6e8d9fb5104697bdd0a8bd085">operations_research::glop::RevisedSimplex::GetVariableValue</a></div><div class="ttdeci">Fractional GetVariableValue(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00613">revised_simplex.cc:613</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01435">integer.h:1435</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_domains_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_domains.html">operations_research::sat::IntegerDomains</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00298">integer.h:298</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a7ddcdc56f25d075e18d62ddbcd3389b2"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a7ddcdc56f25d075e18d62ddbcd3389b2">operations_research::glop::LinearProgram::SetVariableType</a></div><div class="ttdeci">void SetVariableType(ColIndex col, VariableType type)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00236">lp_data.cc:236</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_ace96e115f468d752a2fcfeea901b0f8a"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ace96e115f468d752a2fcfeea901b0f8a">operations_research::glop::RevisedSimplex::ClearStateForNextSolve</a></div><div class="ttdeci">void ClearStateForNextSolve()</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00113">revised_simplex.cc:113</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ab63a08713131e63e9cc4109f98ecf859"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ab63a08713131e63e9cc4109f98ecf859">operations_research::sat::SatSolver::EnqueueDecisionAndBacktrackOnConflict</a></div><div class="ttdeci">int EnqueueDecisionAndBacktrackOnConflict(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00862">sat_solver.cc:862</a></div></div>
|
|
<div class="ttc" id="markowitz_8cc_html_aa9d6c98fdf8d89b0e2321fda02adc82c"><div class="ttname"><a href="markowitz_8cc.html#aa9d6c98fdf8d89b0e2321fda02adc82c">col</a></div><div class="ttdeci">ColIndex col</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00183">markowitz.cc:183</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a733947145e3e1631165b618b05c9ccb7"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a733947145e3e1631165b618b05c9ccb7">operations_research::glop::Fractional</a></div><div class="ttdeci">double Fractional</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00078">lp_types.h:78</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::glop::LinearProgram::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00134">lp_data.cc:134</a></div></div>
|
|
<div class="ttc" id="gurobi__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="namespaceoperations__research_html_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00235">saturated_arithmetic.h:235</a></div></div>
|
|
<div class="ttc" id="classabsl_1_1_strong_vector_html_ac8bb3912a3ce86b15842e79d0b421204"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#ac8bb3912a3ce86b15842e79d0b421204">absl::StrongVector::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00170">strong_vector.h:170</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_a866a68af5afd0355fb348f7a59eeff9e"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#a866a68af5afd0355fb348f7a59eeff9e">operations_research::glop::RevisedSimplex::Solve</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT Status Solve(const LinearProgram &lp, TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00134">revised_simplex.cc:134</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a62b98dec38b6506442f9fc63f1a9b88f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a62b98dec38b6506442f9fc63f1a9b88f">operations_research::glop::LinearProgram::SetConstraintBounds</a></div><div class="ttdeci">void SetConstraintBounds(RowIndex row, Fractional lower_bound, Fractional upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00309">lp_data.cc:309</a></div></div>
|
|
<div class="ttc" id="markowitz_8cc_html_aea35f36ba98d5bbd8d033382f50c9e52"><div class="ttname"><a href="markowitz_8cc.html#aea35f36ba98d5bbd8d033382f50c9e52">row</a></div><div class="ttdeci">RowIndex row</div><div class="ttdef"><b>Definition:</b> <a href="markowitz_8cc_source.html#l00182">markowitz.cc:182</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_strict_i_t_i_vector_html_af8d7048738ceb4c753b040e6d29db79c"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html#af8d7048738ceb4c753b040e6d29db79c">operations_research::glop::StrictITIVector::assign</a></div><div class="ttdeci">void assign(IntType size, const T &v)</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00278">lp_types.h:278</a></div></div>
|
|
<div class="ttc" id="integral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a5c8255f82269d42db81cc944eff0180f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a5c8255f82269d42db81cc944eff0180f">operations_research::glop::LinearProgram::objective_coefficients</a></div><div class="ttdeci">const DenseRow & objective_coefficients() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00223">lp_data.h:223</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aed77a1a7675c2f8568529a5a16247ec1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aed77a1a7675c2f8568529a5a16247ec1">operations_research::sat::ToDouble</a></div><div class="ttdeci">double ToDouble(IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00071">integer.h:71</a></div></div>
|
|
<div class="ttc" id="classabsl_1_1_strong_vector_html_af71e6c1eccbc12e9339c00a86a981a43"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">absl::StrongVector::back</a></div><div class="ttdeci">reference back()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00174">strong_vector.h:174</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7f1ac774d4646a83631f8117f4ea03f5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">operations_research::sat::PositiveVariable</a></div><div class="ttdeci">IntegerVariable PositiveVariable(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00143">integer.h:143</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a7b4e91d6ccf881f4d31d3c1fff97f330"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a7b4e91d6ccf881f4d31d3c1fff97f330">operations_research::sat::SatParameters::LOCK_BASED</a></div><div class="ttdeci">static constexpr FPRoundingMethod LOCK_BASED</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00816">sat_parameters.pb.h:816</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_mapping_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_mapping.html">operations_research::sat::CpModelMapping</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00065">cp_model_mapping.h:65</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_mapping_html_a148597d78e10112b7e5e1f778de0410f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_mapping.html#a148597d78e10112b7e5e1f778de0410f">operations_research::sat::CpModelMapping::GetProtoVariableFromIntegerVariable</a></div><div class="ttdeci">int GetProtoVariableFromIntegerVariable(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__mapping_8h_source.html#l00160">cp_model_mapping.h:160</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a18b43f42eaf13ab756b22b49fc981881"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a18b43f42eaf13ab756b22b49fc981881">operations_research::sat::SatParameters::fp_rounding</a></div><div class="ttdeci">::operations_research::sat::SatParameters_FPRoundingMethod fp_rounding() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l07742">sat_parameters.pb.h:7742</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_adcc58612f6a1dc35ff3ffdb34188f299"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#adcc58612f6a1dc35ff3ffdb34188f299">operations_research::glop::LinearProgram::GetDimensionString</a></div><div class="ttdeci">std::string GetDimensionString() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00425">lp_data.cc:425</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00356">integer.h:356</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_lp_scaling_helper_html_a5eb3e38eae8f5143d627e8c85aff8cd7"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a5eb3e38eae8f5143d627e8c85aff8cd7">operations_research::glop::LpScalingHelper::VariableScalingFactor</a></div><div class="ttdeci">Fractional VariableScalingFactor(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00091">lp_data_utils.cc:91</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493a0beacd9ca195de65e685252f1b46b954"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a0beacd9ca195de65e685252f1b46b954">operations_research::glop::ProblemStatus::IMPRECISE</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_lp_scaling_helper_html_a60d41c66b603be0ec7517d437e5c63ec"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a60d41c66b603be0ec7517d437e5c63ec">operations_research::glop::LpScalingHelper::UnscaleVariableValue</a></div><div class="ttdeci">Fractional UnscaleVariableValue(ColIndex col, Fractional value) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00120">lp_data_utils.cc:120</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html_afcd4038298bec97a2f7a61274c6ef8c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#afcd4038298bec97a2f7a61274c6ef8c7">operations_research::sat::IntegerEncoder::GetOrCreateAssociatedLiteral</a></div><div class="ttdeci">Literal GetOrCreateAssociatedLiteral(IntegerLiteral i_lit)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00220">integer.cc:220</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a30a14db0c416e43deb20a7374abe39a0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a30a14db0c416e43deb20a7374abe39a0">operations_research::sat::SatParameters::NEAREST_INTEGER</a></div><div class="ttdeci">static constexpr FPRoundingMethod NEAREST_INTEGER</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00814">sat_parameters.pb.h:814</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a6137c2df856cf2634f9bb259d2aace2b"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a6137c2df856cf2634f9bb259d2aace2b">operations_research::glop::LinearProgram::GetObjectiveCoefficientForMinimizationVersion</a></div><div class="ttdeci">Fractional GetObjectiveCoefficientForMinimizationVersion(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00419">lp_data.cc:419</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_ae7202d055b6b172a8a1da4f5b136f9ea"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ae7202d055b6b172a8a1da4f5b136f9ea">operations_research::glop::RevisedSimplex::SetParameters</a></div><div class="ttdeci">void SetParameters(const GlopParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l03474">revised_simplex.cc:3474</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00704">base/logging.h:704</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html_a074fe196a1aaff1dd5fd73e0b3bb1f0e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#a074fe196a1aaff1dd5fd73e0b3bb1f0e">operations_research::sat::IntegerEncoder::GetOrCreateLiteralAssociatedToEquality</a></div><div class="ttdeci">Literal GetOrCreateLiteralAssociatedToEquality(IntegerVariable var, IntegerValue value)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00266">integer.cc:266</a></div></div>
|
|
<div class="ttc" id="sat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00613">integer.h:613</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a2b83a25cb4fd203c57a7155699fab246"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a2b83a25cb4fd203c57a7155699fab246">operations_research::glop::ColIndexVector</a></div><div class="ttdeci">std::vector< ColIndex > ColIndexVector</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00312">lp_types.h:312</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a695ac3d8db5a986f572711f2ef3a6a39"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a695ac3d8db5a986f572711f2ef3a6a39">operations_research::glop::LinearProgram::CreateNewVariable</a></div><div class="ttdeci">ColIndex CreateNewVariable()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00162">lp_data.cc:162</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a9ab880b5e67213a0607c5c3935da9f08"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9ab880b5e67213a0607c5c3935da9f08">operations_research::sat::IntegerTrail::LevelZeroUpperBound</a></div><div class="ttdeci">IntegerValue LevelZeroUpperBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01524">integer.h:1524</a></div></div>
|
|
<div class="ttc" id="namespacegtl_html_abce27d097bc5680207b294bdad75f59f"><div class="ttname"><a href="namespacegtl.html#abce27d097bc5680207b294bdad75f59f">gtl::FindOrDie</a></div><div class="ttdeci">const Collection::value_type::second_type & FindOrDie(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00206">map_util.h:206</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00235">sat_base.h:235</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_af9a790b7e8c5b0c6d55b336177378e78"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#af9a790b7e8c5b0c6d55b336177378e78">operations_research::glop::kInfinity</a></div><div class="ttdeci">const double kInfinity</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00084">lp_types.h:84</a></div></div>
|
|
<div class="ttc" id="classabsl_1_1_strong_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">absl::StrongVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00158">strong_vector.h:158</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_ad9d564651057c77b3f2ca1293134557f"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ad9d564651057c77b3f2ca1293134557f">operations_research::glop::LinearProgram::CreateNewConstraint</a></div><div class="ttdeci">RowIndex CreateNewConstraint()</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00191">lp_data.cc:191</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae2544d2a3a5ef4c78f8e5891f104ab41"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae2544d2a3a5ef4c78f8e5891f104ab41">operations_research::sat::VariableIsPositive</a></div><div class="ttdeci">bool VariableIsPositive(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00139">integer.h:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_a680158afc869b1a617ca173fa0033202"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a680158afc869b1a617ca173fa0033202">operations_research::sat::FeasibilityPump::GetLPSolutionValue</a></div><div class="ttdeci">double GetLPSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00417">feasibility_pump.cc:417</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html_a4a1c84558c01bae528113b50c0611564"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#a4a1c84558c01bae528113b50c0611564">operations_research::sat::IntegerEncoder::Canonicalize</a></div><div class="ttdeci">std::pair< IntegerLiteral, IntegerLiteral > Canonicalize(IntegerLiteral i_lit) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00202">integer.cc:202</a></div></div>
|
|
<div class="ttc" id="saturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a48de416333220c0bea7759c5aa53ee14"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a48de416333220c0bea7759c5aa53ee14">operations_research::glop::LinearProgram::GetSlackVariable</a></div><div class="ttdeci">ColIndex GetSlackVariable(RowIndex row) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00755">lp_data.cc:755</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_aaac2d8dee4d7fc8d5e9a1b1cfc3021bc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#aaac2d8dee4d7fc8d5e9a1b1cfc3021bc">operations_research::sat::FeasibilityPump::AddLinearConstraint</a></div><div class="ttdeci">void AddLinearConstraint(const LinearConstraint &ct)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00065">feasibility_pump.cc:65</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="sat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_acd8437353d8dc686a75c98b5897dd871"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#acd8437353d8dc686a75c98b5897dd871">operations_research::glop::LinearProgram::num_variables</a></div><div class="ttdeci">ColIndex num_variables() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00205">lp_data.h:205</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493a2dcc8f5d91cb2aa2065b8305bf2d5cbd"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a2dcc8f5d91cb2aa2065b8305bf2d5cbd">operations_research::glop::ProblemStatus::PRIMAL_FEASIBLE</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a607d97ccada862073f297bc2d495124d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a607d97ccada862073f297bc2d495124d">operations_research::sat::SatSolver::FinishPropagation</a></div><div class="ttdeci">bool FinishPropagation()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00522">sat_solver.cc:522</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a32c4461508cb8e523fa91e85e5ee6f9c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a32c4461508cb8e523fa91e85e5ee6f9c">operations_research::sat::SatParameters::PROPAGATION_ASSISTED</a></div><div class="ttdeci">static constexpr FPRoundingMethod PROPAGATION_ASSISTED</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00820">sat_parameters.pb.h:820</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00030">integer.cc:30</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_ac62972ff1b21a037e56530cde67309aba5d5cd46919fa987731fb2edefe0f2a0c"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#ac62972ff1b21a037e56530cde67309aba5d5cd46919fa987731fb2edefe0f2a0c">operations_research::glop::LinearProgram::VariableType::INTEGER</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_a18206039e9f0c76f2b35907a4f6ea812"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a18206039e9f0c76f2b35907a4f6ea812">operations_research::sat::FeasibilityPump::~FeasibilityPump</a></div><div class="ttdeci">~FeasibilityPump()</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00060">feasibility_pump.cc:60</a></div></div>
|
|
<div class="ttc" id="feasibility__pump_8h_html"><div class="ttname"><a href="feasibility__pump_8h.html">feasibility_pump.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_ad8a718ceea92060a7f7118e2bccf4fbc"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ad8a718ceea92060a7f7118e2bccf4fbc">operations_research::glop::RevisedSimplex::GetNumberOfIterations</a></div><div class="ttdeci">int64_t GetNumberOfIterations() const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00605">revised_simplex.cc:605</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_acd138469679be137d0de53459b1342cb"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#acd138469679be137d0de53459b1342cb">operations_research::glop::LinearProgram::variable_upper_bounds</a></div><div class="ttdeci">const DenseRow & variable_upper_bounds() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00232">lp_data.h:232</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_revised_simplex_html_ac0064327c37c56b93e86a91a1d64fd96"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_revised_simplex.html#ac0064327c37c56b93e86a91a1d64fd96">operations_research::glop::RevisedSimplex::GetConstraintStatus</a></div><div class="ttdeci">ConstraintStatus GetConstraintStatus(RowIndex row) const</div><div class="ttdef"><b>Definition:</b> <a href="revised__simplex_8cc_source.html#l00641">revised_simplex.cc:641</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493a57ad14e7a035f33c8ba6c0ea9ea23caa"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a57ad14e7a035f33c8ba6c0ea9ea23caa">operations_research::glop::ProblemStatus::DUAL_FEASIBLE</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_time_limit_html_a810d5f7aaf80cc09cf5a094e20c1aaca"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#a810d5f7aaf80cc09cf5a094e20c1aaca">operations_research::TimeLimit::LimitReached</a></div><div class="ttdeci">bool LimitReached()</div><div class="ttdoc">Returns true when the external limit is true, or the deterministic time is over the deterministic lim...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00534">time_limit.h:534</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a4ba664b00317505a0026d2a38e6dd565"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a4ba664b00317505a0026d2a38e6dd565">operations_research::glop::LinearProgram::variable_lower_bounds</a></div><div class="ttdeci">const DenseRow & variable_lower_bounds() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8h_source.html#l00229">lp_data.h:229</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a0fe7ba825c8c6cd1efdcff6dec631093"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a0fe7ba825c8c6cd1efdcff6dec631093">operations_research::glop::LinearProgram::SetVariableBounds</a></div><div class="ttdeci">void SetVariableBounds(ColIndex col, Fractional lower_bound, Fractional upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00249">lp_data.cc:249</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html_a93b17ac067d83120d7c2d3c680adf8c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html#a93b17ac067d83120d7c2d3c680adf8c5">operations_research::sat::SatParameters::ACTIVE_LOCK_BASED</a></div><div class="ttdeci">static constexpr FPRoundingMethod ACTIVE_LOCK_BASED</div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00818">sat_parameters.pb.h:818</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_a9da38c8d2910442d551db5e360423029"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a9da38c8d2910442d551db5e360423029">operations_research::sat::SatSolver::ResetToLevelZero</a></div><div class="ttdeci">bool ResetToLevelZero()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8cc_source.html#l00530">sat_solver.cc:530</a></div></div>
|
|
<div class="ttc" id="cp__model_8pb_8h_html"><div class="ttname"><a href="cp__model_8pb_8h.html">cp_model.pb.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a942f29030f08426e7e318204e987e2f7">operations_research::sat::FeasibilityPump::Solve</a></div><div class="ttdeci">bool Solve()</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00144">feasibility_pump.cc:144</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01439">integer.h:1439</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_a9ad847669329f6fbccf8e4553adc7dee"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a9ad847669329f6fbccf8e4553adc7dee">operations_research::sat::FeasibilityPump::GetIntegerSolutionValue</a></div><div class="ttdeci">int64_t GetIntegerSolutionValue(IntegerVariable variable) const</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00429">feasibility_pump.cc:429</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a0f6bd47b8956b59589718bd40b1cf8bc"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a0f6bd47b8956b59589718bd40b1cf8bc">operations_research::glop::ConstraintStatus</a></div><div class="ttdeci">ConstraintStatus</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00231">lp_types.h:231</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html_ad2a33e1d9335cce63548abed6b5c8aab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#ad2a33e1d9335cce63548abed6b5c8aab">operations_research::sat::SatSolver::IsModelUnsat</a></div><div class="ttdeci">bool IsModelUnsat() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00137">sat_solver.h:137</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="classoperations__research_1_1sat_1_1_feasibility_pump_html_a67a7327915e66c0514cfa465a0475be1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#a67a7327915e66c0514cfa465a0475be1">operations_research::sat::FeasibilityPump::ConstraintIndex</a></div><div class="ttdeci">glop::RowIndex ConstraintIndex</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8h_source.html#l00039">feasibility_pump.h:39</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01377">integer.h:1377</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493a7850fcfea005b86b2a3fa0d4293c5ee0"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493a7850fcfea005b86b2a3fa0d4293c5ee0">operations_research::glop::ProblemStatus::PRIMAL_INFEASIBLE</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1glop_html_a884f3b645d22471e5ed3320e182cd493af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#a884f3b645d22471e5ed3320e182cd493af00c8dbdd6e1f11bdae06be94277d293">operations_research::glop::ProblemStatus::OPTIMAL</a></div></div>
|
|
<div class="ttc" id="cp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00120">cp_model_fz_solver.cc:120</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_shared_incomplete_solution_manager.html">operations_research::sat::SharedIncompleteSolutionManager</a></div><div class="ttdef"><b>Definition:</b> <a href="synchronization_8h_source.html#l00155">synchronization.h:155</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_feasibility_pump_html_ae384be06329c4c8f8fd62af7335dae2e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_feasibility_pump.html#ae384be06329c4c8f8fd62af7335dae2e">operations_research::sat::FeasibilityPump::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(IntegerVariable ivar, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="feasibility__pump_8cc_source.html#l00091">feasibility_pump.cc:91</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_strict_i_t_i_vector_html_a967a5c081ad4195a30c78dc2c0bcabf5"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_strict_i_t_i_vector.html#a967a5c081ad4195a30c78dc2c0bcabf5">operations_research::glop::StrictITIVector::size</a></div><div class="ttdeci">IntType size() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00280">lp_types.h:280</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1e30e51173c7e43a8c0b4668d5e3f050"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1e30e51173c7e43a8c0b4668d5e3f050">operations_research::sat::IntTypeAbs</a></div><div class="ttdeci">IntType IntTypeAbs(IntType t)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00079">integer.h:79</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a2d695f450ae446d5d9c225b991f8d88e"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a2d695f450ae446d5d9c225b991f8d88e">operations_research::glop::LinearProgram::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(RowIndex row, ColIndex col, Fractional value)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00317">lp_data.cc:317</a></div></div>
|
|
<div class="ttc" id="lp__types_8h_html"><div class="ttname"><a href="lp__types_8h.html">lp_types.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_parameters_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_parameters.html">operations_research::sat::SatParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__parameters_8pb_8h_source.html#l00347">sat_parameters.pb.h:347</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_glop_parameters_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_glop_parameters.html">operations_research::glop::GlopParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="parameters_8pb_8h_source.html#l00194">parameters.pb.h:194</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_aa68cc40c827bff2fb311040e2b848f9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">operations_research::sat::IntegerTrail::LevelZeroLowerBound</a></div><div class="ttdeci">IntegerValue LevelZeroLowerBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01519">integer.h:1519</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_a609bcb18cec39c7c43dd7a6d3a51ba81"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#a609bcb18cec39c7c43dd7a6d3a51ba81">operations_research::glop::LinearProgram::IntegerVariablesList</a></div><div class="ttdeci">const std::vector< ColIndex > & IntegerVariablesList() const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00280">lp_data.cc:280</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_aeeee0971281f2781c379fce7a64a5049"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aeeee0971281f2781c379fce7a64a5049">operations_research::glop::LinearProgram::GetSparseColumn</a></div><div class="ttdeci">const SparseColumn & GetSparseColumn(ColIndex col) const</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00409">lp_data.cc:409</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_lp_scaling_helper_html_a306cb123e8da242a6daf1c397dfe6e73"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_lp_scaling_helper.html#a306cb123e8da242a6daf1c397dfe6e73">operations_research::glop::LpScalingHelper::Scale</a></div><div class="ttdeci">void Scale(LinearProgram *lp)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data__utils_8cc_source.html#l00076">lp_data_utils.cc:76</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1glop_1_1_linear_program_html_aa23a76f0f582369176688b458cda07dc"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_linear_program.html#aa23a76f0f582369176688b458cda07dc">operations_research::glop::LinearProgram::AddSlackVariablesWhereNecessary</a></div><div class="ttdeci">void AddSlackVariablesWhereNecessary(bool detect_integer_constraints)</div><div class="ttdef"><b>Definition:</b> <a href="lp__data_8cc_source.html#l00697">lp_data.cc:697</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_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="feasibility__pump_8cc.html">feasibility_pump.cc</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.8.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|