279 lines
39 KiB
HTML
279 lines
39 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: lp_utils.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('sat_2lp__utils_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">sat/lp_utils.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sat_2lp__utils_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment">// Utility functions to interact with an lp solver from the SAT context.</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_LP_UTILS_H_</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#define OR_TOOLS_SAT_LP_UTILS_H_</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <stdint.h></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "ortools/linear_solver/linear_solver.pb.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "<a class="code" href="lp__data_8h.html">ortools/lp_data/lp_data.h</a>"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "ortools/sat/boolean_problem.pb.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "ortools/sat/cp_model.pb.h"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</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 id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="util_2logging_8h.html">ortools/util/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> </div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> </div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment">// Returns the smallest factor f such that f * abs(x) is integer modulo the</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">// given tolerance relative to f (we use f * tolerance). It is only looking</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// for f smaller than the given limit. Returns zero if no such factor exist.</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">// The complexity is a lot less than O(limit), but it is possible that we might</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// miss the smallest such factor if the tolerance used is too low. This is</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// because we only rely on the best rational approximations of x with increasing</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// denominator.</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="keywordtype">int</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#af8b326626fb8ca0efd32ff0564d35731">FindRationalFactor</a>(<span class="keywordtype">double</span> x, <span class="keywordtype">int</span> limit = 1e4, <span class="keywordtype">double</span> tolerance = 1e-6);</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// Multiplies all continuous variable by the given scaling parameters and change</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">// the rest of the model accordingly. The returned vector contains the scaling</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// of each variable (will always be 1.0 for integers) and can be used to recover</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment">// a solution of the unscaled problem from one of the new scaled problems by</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// dividing the variable values.</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">// We usually scale a continuous variable by scaling, but if its domain is going</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// to have larger values than max_bound, then we scale to have the max domain</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// magnitude equal to max_bound.</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// Note that it is recommended to call DetectImpliedIntegers() before this</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// function so that we do not scale variables that do not need to be scaled.</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// TODO(user): Also scale the solution hint if any.</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span>std::vector<double> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac71665cf974c4a75adc4c9ad251ae853">ScaleContinuousVariables</a>(<span class="keywordtype">double</span> scaling, <span class="keywordtype">double</span> max_bound,</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> MPModelProto* mp_model);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// This simple step helps and should be done first. Returns false if the model</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">// is trivially infeasible because of crossing bounds.</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ab976889f89f3df5d24c7b72c0a7d8d07">MakeBoundsOfIntegerVariablesInteger</a>(<span class="keyword">const</span> SatParameters& params,</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> MPModelProto* mp_model,</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span><span class="comment">// Performs some extra tests on the given MPModelProto and returns false if one</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="comment">// is not satisfied. These are needed before trying to convert it to the native</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment">// CP-SAT format.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a9cad548d18a6c850514c835b34f60cfe">MPModelProtoValidationBeforeConversion</a>(<span class="keyword">const</span> SatParameters& params,</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">const</span> MPModelProto& mp_model,</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// To satisfy our scaling requirements, any terms that is almost zero can just</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment">// be set to zero. We need to do that before operations like</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment">// DetectImpliedIntegers(), becauses really low coefficients can cause issues</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment">// and might lead to less detection.</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8163165c60b5914e1e8476c56b048664">RemoveNearZeroTerms</a>(<span class="keyword">const</span> SatParameters& params, MPModelProto* mp_model,</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// This will mark implied integer as such. Note that it can also discover</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">// variable of the form coeff * Integer + offset, and will change the model</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">// so that these are marked as integer. It is why we return both a scaling and</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// an offset to transform the solution back to its original domain.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment">// TODO(user): Actually implement the offset part. This currently only happens</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment">// on the 3 neos-46470* miplib problems where we have a non-integer rhs.</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span>std::vector<double> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ae188c568fdffc07e6443ba7eb11cff1b">DetectImpliedIntegers</a>(MPModelProto* mp_model,</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="comment">// Converts a MIP problem to a CpModel. Returns false if the coefficients</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment">// couldn't be converted to integers with a good enough precision.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="comment">// There is a bunch of caveats and you can find more details on the</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment">// SatParameters proto documentation for the mip_* parameters.</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8344143223766ba5898fdba30d6f61d8">ConvertMPModelProtoToCpModelProto</a>(<span class="keyword">const</span> SatParameters& params,</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keyword">const</span> MPModelProto& mp_model,</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> CpModelProto* cp_model,</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="comment">// Converts a CP-SAT model to a MPModelProto one.</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="comment">// This only works for pure linear model (otherwise it returns false). This is</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment">// mainly useful for debugging or using CP-SAT presolve and then trying other</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment">// MIP solvers.</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment">// TODO(user): This first version do not even handle basic Boolean constraint.</span></div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="comment">// Support more constraints as needed.</span></div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a1f03a05fdb422a45d174be99780a6f9d">ConvertCpModelProtoToMPModelProto</a>(<span class="keyword">const</span> CpModelProto& <a class="code hl_function" href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a>,</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> MPModelProto* output);</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> </div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">// Scales a double objective to its integer version and fills it in the proto.</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment">// The variable listed in the objective must be already defined in the cp_model</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment">// proto as this uses the variables bounds to compute a proper scaling.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment">// This uses params.mip_wanted_tolerance() and</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment">// params.mip_max_activity_exponent() to compute the scaling. Note however that</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment">// if the wanted tolerance is not satisfied this still scale with best effort.</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment">// You can see in the log the tolerance guaranteed by this automatic scaling.</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><span class="comment">// This will almost always returns true except for really bad cases like having</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span><span class="comment">// infinity in the objective.</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a0b38571bb1f48f98df1134a4005d9c21">ScaleAndSetObjective</a>(<span class="keyword">const</span> SatParameters& params,</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keyword">const</span> std::vector<std::pair<int, double>>& objective,</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordtype">double</span> objective_offset, <span class="keywordtype">bool</span> maximize,</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> CpModelProto* cp_model, SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment">// Given a CpModelProto with a floating point objective, and its scaled integer</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment">// version with a known lower bound, this uses the variable bounds to derive a</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment">// correct lower bound on the original objective.</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment">// Note that the integer version can be way different, but then the bound is</span></div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">// likely to be bad. For now, we solve this with a simple LP with one</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment">// constraint.</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">// TODO(user): Code a custom algo with more precision guarantee?</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="keywordtype">double</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#abf1098bd1f66254ed356544335469700">ComputeTrueObjectiveLowerBound</a>(</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keyword">const</span> CpModelProto& model_proto_with_floating_point_objective,</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keyword">const</span> CpObjectiveProto& integer_objective,</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">const</span> int64_t inner_integer_objective_lower_bound);</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">// Converts an integer program with only binary variables to a Boolean</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment">// optimization problem. Returns false if the problem didn't contains only</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">// binary integer variable, or if the coefficients couldn't be converted to</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment">// integer with a good enough precision.</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7b33067a7dffa07cd5748bc4552c85a1">ConvertBinaryMPModelProtoToBooleanProblem</a>(<span class="keyword">const</span> MPModelProto& mp_model,</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> LinearBooleanProblem* problem);</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="comment">// Converts a Boolean optimization problem to its lp formulation.</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a4591e100a0f29a249169e5833995cd31">ConvertBooleanProblemToLinearProgram</a>(<span class="keyword">const</span> LinearBooleanProblem& problem,</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> glop::LinearProgram* lp);</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_LP_UTILS_H_</span></div>
|
|
<div class="ttc" id="alp__data_8h_html"><div class="ttname"><a href="lp__data_8h.html">lp_data.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0b38571bb1f48f98df1134a4005d9c21"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0b38571bb1f48f98df1134a4005d9c21">operations_research::sat::ScaleAndSetObjective</a></div><div class="ttdeci">bool ScaleAndSetObjective(const SatParameters &params, const std::vector< std::pair< int, double > > &objective, double objective_offset, bool maximize, CpModelProto *cp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l01059">sat/lp_utils.cc:1059</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1f03a05fdb422a45d174be99780a6f9d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1f03a05fdb422a45d174be99780a6f9d">operations_research::sat::ConvertCpModelProtoToMPModelProto</a></div><div class="ttdeci">bool ConvertCpModelProtoToMPModelProto(const CpModelProto &input, MPModelProto *output)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00981">sat/lp_utils.cc:981</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a4591e100a0f29a249169e5833995cd31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4591e100a0f29a249169e5833995cd31">operations_research::sat::ConvertBooleanProblemToLinearProgram</a></div><div class="ttdeci">void ConvertBooleanProblemToLinearProgram(const LinearBooleanProblem &problem, glop::LinearProgram *lp)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l01332">sat/lp_utils.cc:1332</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7b33067a7dffa07cd5748bc4552c85a1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7b33067a7dffa07cd5748bc4552c85a1">operations_research::sat::ConvertBinaryMPModelProtoToBooleanProblem</a></div><div class="ttdeci">bool ConvertBinaryMPModelProtoToBooleanProblem(const MPModelProto &mp_model, LinearBooleanProblem *problem)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l01153">sat/lp_utils.cc:1153</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8163165c60b5914e1e8476c56b048664"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8163165c60b5914e1e8476c56b048664">operations_research::sat::RemoveNearZeroTerms</a></div><div class="ttdeci">void RemoveNearZeroTerms(const SatParameters &params, MPModelProto *mp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00227">sat/lp_utils.cc:227</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8344143223766ba5898fdba30d6f61d8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8344143223766ba5898fdba30d6f61d8">operations_research::sat::ConvertMPModelProtoToCpModelProto</a></div><div class="ttdeci">bool ConvertMPModelProtoToCpModelProto(const SatParameters &params, const MPModelProto &mp_model, CpModelProto *cp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00788">sat/lp_utils.cc:788</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a9cad548d18a6c850514c835b34f60cfe"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9cad548d18a6c850514c835b34f60cfe">operations_research::sat::MPModelProtoValidationBeforeConversion</a></div><div class="ttdeci">bool MPModelProtoValidationBeforeConversion(const SatParameters &params, const MPModelProto &mp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00280">sat/lp_utils.cc:280</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab976889f89f3df5d24c7b72c0a7d8d07"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab976889f89f3df5d24c7b72c0a7d8d07">operations_research::sat::MakeBoundsOfIntegerVariablesInteger</a></div><div class="ttdeci">bool MakeBoundsOfIntegerVariablesInteger(const SatParameters &params, MPModelProto *mp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00189">sat/lp_utils.cc:189</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_abf1098bd1f66254ed356544335469700"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#abf1098bd1f66254ed356544335469700">operations_research::sat::ComputeTrueObjectiveLowerBound</a></div><div class="ttdeci">double ComputeTrueObjectiveLowerBound(const CpModelProto &model_proto_with_floating_point_objective, const CpObjectiveProto &integer_objective, const int64_t inner_integer_objective_lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l01396">sat/lp_utils.cc:1396</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac71665cf974c4a75adc4c9ad251ae853"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac71665cf974c4a75adc4c9ad251ae853">operations_research::sat::ScaleContinuousVariables</a></div><div class="ttdeci">std::vector< double > ScaleContinuousVariables(double scaling, double max_bound, MPModelProto *mp_model)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00107">sat/lp_utils.cc:107</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ae188c568fdffc07e6443ba7eb11cff1b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae188c568fdffc07e6443ba7eb11cff1b">operations_research::sat::DetectImpliedIntegers</a></div><div class="ttdeci">std::vector< double > DetectImpliedIntegers(MPModelProto *mp_model, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00344">sat/lp_utils.cc:344</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_af8b326626fb8ca0efd32ff0564d35731"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#af8b326626fb8ca0efd32ff0564d35731">operations_research::sat::FindRationalFactor</a></div><div class="ttdeci">int FindRationalFactor(double x, int limit, double tolerance)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00126">sat/lp_utils.cc:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aparser_8yy_8cc_html_a5a634cf4429798b1c921a81de8250051"><div class="ttname"><a href="parser_8yy_8cc.html#a5a634cf4429798b1c921a81de8250051">input</a></div><div class="ttdeci">static int input(yyscan_t yyscanner)</div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="autil_2logging_8h_html"><div class="ttname"><a href="util_2logging_8h.html">logging.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="sat_2lp__utils_8h.html">lp_utils.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|