Files
ortools-clone/docs/dotnet/LinearProgrammingExample_8cs_source.html
2019-09-03 15:42:34 +02:00

66 lines
15 KiB
HTML

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>OR-Tools</title>
<meta http-equiv="Content-Type" content="text/html;"/>
<meta charset="utf-8"/>
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
</head>
<body>
<div id="banner-container">
<div id="banner">
<span id="sfml">Google OR-Tools 7.3</span>
</div>
</div>
<div id="content" style="width: 100%; overflow: hidden;">
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
<h2>DotNet Reference</h2>
<ul>
<li><a href="../dotnet/namespaceGoogle_1_1OrTools_1_1Sat.html">CP-SAT</a></li>
<li><a href="../dotnet/namespaceGoogle_1_1OrTools_1_1Graph.html">Graph</a></li>
<li><a href="../dotnet/namespaceGoogle_1_1OrTools_1_1Algorithms.html">Knapsack solver</a></li>
<li><a href="../dotnet/namespaceGoogle_1_1OrTools_1_1LinearSolver.html">Linear solver</a></li>
<li><a href="../dotnet/namespaceGoogle_1_1OrTools_1_1ConstraintSolver.html">Routing</a></li>
<li><a href="../dotnet/namespaceGoogle_1_1OrTools_1_1Util.html">Util</a></li>
</ul>
</div>
<div id="content">
<div align="center">
<h1 style="color: #145A32;">DotNet Reference</h1>
</div>
<!-- Generated by Doxygen 1.8.15 -->
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_4d3a5a688e4550f3d7725aaa5ab9c27b.html">linear_solver</a></li><li class="navelem"><a class="el" href="dir_c058b655dd87a06086a3d01984927bc3.html">samples</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">LinearProgrammingExample.cs</div> </div>
</div><!--header-->
<div class="contents">
<a href="LinearProgrammingExample_8cs.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">// Copyright 2010-2018 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<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>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<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>&#160;<span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<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>&#160;<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>&#160;<span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment">// [START program]</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="keyword">using</span> System;</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="keyword">using</span> <a class="code" href="namespaceGoogle.html">Google</a>.<a class="code" href="namespaceGoogle_1_1OrTools.html">OrTools</a>.<a class="code" href="namespaceGoogle_1_1OrTools_1_1LinearSolver.html">LinearSolver</a>;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;</div><div class="line"><a name="l00018"></a><span class="lineno"><a class="line" href="classLinearProgrammingExample.html"> 18</a></span>&#160;<span class="keyword">public</span> <span class="keyword">class </span><a class="code" href="classLinearProgrammingExample.html">LinearProgrammingExample</a></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;{</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span>&#160; <span class="keyword">static</span> <span class="keywordtype">void</span> Main()</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; <span class="comment">// [START solver]</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>&#160; MPSolver solver = <span class="keyword">new</span> MPSolver(<span class="stringliteral">&quot;LinearProgrammingExample&quot;</span>, <span class="stringliteral">&quot;GLOP_LINEAR_PROGRAMMING&quot;</span>);</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; <span class="comment">// [END solver]</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; <span class="comment">// x and y are continuous non-negative variables.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; <span class="comment">// [START variables]</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; <a class="code" href="classGoogle_1_1OrTools_1_1LinearSolver_1_1Variable.html">Variable</a> x = solver.MakeNumVar(0.0, <span class="keywordtype">double</span>.PositiveInfinity, <span class="stringliteral">&quot;x&quot;</span>);</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <a class="code" href="classGoogle_1_1OrTools_1_1LinearSolver_1_1Variable.html">Variable</a> y = solver.MakeNumVar(0.0, <span class="keywordtype">double</span>.PositiveInfinity, <span class="stringliteral">&quot;y&quot;</span>);</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; <span class="comment">// [END variables]</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160; <span class="comment">// [START constraints]</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; <span class="comment">// x + 2y &lt;= 14.</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; Constraint c0 = solver.MakeConstraint(<span class="keywordtype">double</span>.NegativeInfinity, 14.0);</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; c0.SetCoefficient(x, 1);</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; c0.SetCoefficient(y, 2);</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160;</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="comment">// 3x - y &gt;= 0.</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; Constraint c1 = solver.MakeConstraint(0.0, <span class="keywordtype">double</span>.PositiveInfinity);</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; c1.SetCoefficient(x, 3);</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; c1.SetCoefficient(y, -1);</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="comment">// x - y &lt;= 2.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; Constraint c2 = solver.MakeConstraint(<span class="keywordtype">double</span>.NegativeInfinity, 2.0);</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; c2.SetCoefficient(x, 1);</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; c2.SetCoefficient(y, -1);</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="comment">// [END constraints]</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="comment">// [START objective]</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="comment">// Objective function: 3x + 4y.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; Objective objective = solver.Objective();</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; objective.SetCoefficient(x, 3);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; objective.SetCoefficient(y, 4);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; objective.SetMaximization();</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="comment">// [END objective]</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="comment">// [START solve]</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; solver.Solve();</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="comment">// [END solve]</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">// [START print_solution]</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; Console.WriteLine(<span class="stringliteral">&quot;Number of variables = &quot;</span> + solver.NumVariables());</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; Console.WriteLine(<span class="stringliteral">&quot;Number of constraints = &quot;</span> + solver.NumConstraints());</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="comment">// The value of each variable in the solution.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; Console.WriteLine(<span class="stringliteral">&quot;Solution:&quot;</span>);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; Console.WriteLine(<span class="stringliteral">&quot;x = &quot;</span> + x.SolutionValue());</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; Console.WriteLine(<span class="stringliteral">&quot;y = &quot;</span> + y.SolutionValue());</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="comment">// The objective value of the solution.</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; Console.WriteLine(<span class="stringliteral">&quot;Optimal objective value = &quot;</span> +</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; solver.Objective().Value());</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="comment">// [END print_solution]</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;}</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;<span class="comment">// [END program]</span></div><div class="ttc" id="classGoogle_1_1OrTools_1_1LinearSolver_1_1Variable_html"><div class="ttname"><a href="classGoogle_1_1OrTools_1_1LinearSolver_1_1Variable.html">Google.OrTools.LinearSolver.Variable</a></div><div class="ttdef"><b>Definition:</b> <a href="VariableHelper_8cs_source.html#l00019">VariableHelper.cs:19</a></div></div>
<div class="ttc" id="namespaceGoogle_html"><div class="ttname"><a href="namespaceGoogle.html">Google</a></div><div class="ttdef"><b>Definition:</b> <a href="RoutingEnums_8pb_8cs_source.html#l00012">RoutingEnums.pb.cs:12</a></div></div>
<div class="ttc" id="namespaceGoogle_1_1OrTools_html"><div class="ttname"><a href="namespaceGoogle_1_1OrTools.html">Google.OrTools</a></div><div class="ttdef"><b>Definition:</b> <a href="RoutingEnums_8pb_8cs_source.html#l00012">RoutingEnums.pb.cs:12</a></div></div>
<div class="ttc" id="namespaceGoogle_1_1OrTools_1_1LinearSolver_html"><div class="ttname"><a href="namespaceGoogle_1_1OrTools_1_1LinearSolver.html">Google.OrTools.LinearSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="DoubleArrayHelper_8cs_source.html#l00014">DoubleArrayHelper.cs:14</a></div></div>
<div class="ttc" id="classLinearProgrammingExample_html"><div class="ttname"><a href="classLinearProgrammingExample.html">LinearProgrammingExample</a></div><div class="ttdef"><b>Definition:</b> <a href="LinearProgrammingExample_8cs_source.html#l00018">LinearProgrammingExample.cs:18</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div>
</div>
<div id="footer-container">
<div id="footer">
</div>
</div>
</body>
</html>