<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, "Sampling" the solution set of linear inequalities</title>
    <link>http://www.mapleprimes.com/questions/41689-Sampling-The-Solution-Set-Of-Linear</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Fri, 12 Jun 2026 07:06:43 GMT</lastBuildDate>
    <pubDate>Fri, 12 Jun 2026 07:06:43 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, "Sampling" the solution set of linear inequalities</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, "Sampling" the solution set of linear inequalities</title>
      <link>http://www.mapleprimes.com/questions/41689-Sampling-The-Solution-Set-Of-Linear</link>
    </image>
    <item>
      <title>LPSolve, perhaps</title>
      <link>http://www.mapleprimes.com/questions/41689-Sampling-The-Solution-Set-Of-Linear?ref=Feed:MaplePrimes:"Sampling" the solution set of linear inequalities:Comments#answer77823</link>
      <itunes:summary>Maybe some variant on these,

Optimization:-LPSolve(1,{a1 &gt;= 6, a2 &lt;= 99, a1 &gt;= a2+1}, integervariables=[a1,a2]);

Optimization:-LPSolve(1,{a1 &gt;= 6, a2 &lt;= 99, a1 &lt;= a2+1}, integervariables=[a1,a2]);


acer</itunes:summary>
      <description>Maybe some variant on these,

Optimization:-LPSolve(1,{a1 &gt;= 6, a2 &lt;= 99, a1 &gt;= a2+1}, integervariables=[a1,a2]);

Optimization:-LPSolve(1,{a1 &gt;= 6, a2 &lt;= 99, a1 &lt;= a2+1}, integervariables=[a1,a2]);


acer</description>
      <guid>77823</guid>
      <pubDate>Thu, 15 Mar 2007 06:58:12 Z</pubDate>
      <itunes:author>acer</itunes:author>
      <author>acer</author>
    </item>
    <item>
      <title>typo, sorry</title>
      <link>http://www.mapleprimes.com/questions/41689-Sampling-The-Solution-Set-Of-Linear?ref=Feed:MaplePrimes:"Sampling" the solution set of linear inequalities:Comments#answer77822</link>
      <itunes:summary>I meant for the second example using LPSolve to be,

Optimization:-LPSolve(1,{a1 &gt;= 6, a2 &lt;= 99, a1 &lt;= a2-1}, integervariables=[a1,a2]);

I'm sure that you get the picture. Cover a1&lt;=a2-1, and cover a1&gt;=a2+1, and then a1&lt;&gt;a2 is covered.

It might be a paint to set up programatically, if there are a lot of inequalities to account for amongst the variables. I can't imagine, offhand, how to cover an inequality (like, say, a logical &amp;or) without making the constraint nonlinear. But NLPSolve doesn't allow the integervar option.

acer</itunes:summary>
      <description>I meant for the second example using LPSolve to be,

Optimization:-LPSolve(1,{a1 &gt;= 6, a2 &lt;= 99, a1 &lt;= a2-1}, integervariables=[a1,a2]);

I'm sure that you get the picture. Cover a1&lt;=a2-1, and cover a1&gt;=a2+1, and then a1&lt;&gt;a2 is covered.

It might be a paint to set up programatically, if there are a lot of inequalities to account for amongst the variables. I can't imagine, offhand, how to cover an inequality (like, say, a logical &amp;or) without making the constraint nonlinear. But NLPSolve doesn't allow the integervar option.

acer</description>
      <guid>77822</guid>
      <pubDate>Thu, 15 Mar 2007 07:14:49 Z</pubDate>
      <itunes:author>acer</itunes:author>
      <author>acer</author>
    </item>
  </channel>
</rss>