<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Linear programming in SAS in SAS Programming</title>
    <link>https://communities.sas.com/t5/SAS-Programming/Linear-programming-in-SAS/m-p/554479#M154249</link>
    <description>&lt;P&gt;Find all optimal solutions to the following LP in SAS.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Max Z&amp;nbsp; = 3X[1] + 3X[2]&lt;/P&gt;&lt;P&gt;s.t.&amp;nbsp; &amp;nbsp;&amp;nbsp;X[1] + X[2] &amp;lt;= 1&lt;/P&gt;&lt;P&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; All X[i] =&amp;gt; 0&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Please help me with just the codes. I can interpret once I see them. Appreciate the help, in advance!&lt;/P&gt;</description>
    <pubDate>Sat, 27 Apr 2019 15:04:40 GMT</pubDate>
    <dc:creator>nep0827</dc:creator>
    <dc:date>2019-04-27T15:04:40Z</dc:date>
    <item>
      <title>Linear programming in SAS</title>
      <link>https://communities.sas.com/t5/SAS-Programming/Linear-programming-in-SAS/m-p/554479#M154249</link>
      <description>&lt;P&gt;Find all optimal solutions to the following LP in SAS.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Max Z&amp;nbsp; = 3X[1] + 3X[2]&lt;/P&gt;&lt;P&gt;s.t.&amp;nbsp; &amp;nbsp;&amp;nbsp;X[1] + X[2] &amp;lt;= 1&lt;/P&gt;&lt;P&gt;&amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp; All X[i] =&amp;gt; 0&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Please help me with just the codes. I can interpret once I see them. Appreciate the help, in advance!&lt;/P&gt;</description>
      <pubDate>Sat, 27 Apr 2019 15:04:40 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-Programming/Linear-programming-in-SAS/m-p/554479#M154249</guid>
      <dc:creator>nep0827</dc:creator>
      <dc:date>2019-04-27T15:04:40Z</dc:date>
    </item>
    <item>
      <title>Re: Linear programming in SAS</title>
      <link>https://communities.sas.com/t5/SAS-Programming/Linear-programming-in-SAS/m-p/554481#M154250</link>
      <description>&lt;P&gt;&lt;a href="https://communities.sas.com/t5/user/viewprofilepage/user-id/271960"&gt;@nep0827&lt;/a&gt;,&amp;nbsp;does this represent your actual problem? Any two positive number numbers that sum to 1 will optimize this problem. However, as answered in &lt;A href="https://communities.sas.com/t5/Mathematical-Optimization/Find-all-Optimal-solutions-to-the-following-LP/m-p/554112" target="_self"&gt;your previous thread&lt;/A&gt;, you can find one of those solutions like this&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;PRE&gt;&lt;CODE class=" language-sas"&gt;proc optmodel;
var x{i in 1..2} &amp;gt;= 0;
max z = 3*x[1] +  3*x[2];
con c1: x[1] + x[2] &amp;lt;= 1;
solve;
print x;
run;quit;&lt;/CODE&gt;&lt;/PRE&gt;</description>
      <pubDate>Sat, 27 Apr 2019 15:30:04 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-Programming/Linear-programming-in-SAS/m-p/554481#M154250</guid>
      <dc:creator>PeterClemmensen</dc:creator>
      <dc:date>2019-04-27T15:30:04Z</dc:date>
    </item>
  </channel>
</rss>

