<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" version="2.0">
  <channel>
    <title>MaplePrimes - answers and comments on Question, nonnegative integers in an identity</title>
    <link>http://www.mapleprimes.com/questions/41110-Nonnegative-Integers-In-An-Identity</link>
    <language>en-us</language>
    <copyright>2026 Maplesoft, A Division of Waterloo Maple Inc.</copyright>
    <generator>Maplesoft Document System</generator>
    <lastBuildDate>Wed, 10 Jun 2026 17:49:26 GMT</lastBuildDate>
    <pubDate>Wed, 10 Jun 2026 17:49:26 GMT</pubDate>
    <itunes:subtitle />
    <itunes:summary />
    <description>The latest answers and comments added to the Question, nonnegative integers in an identity</description>
    <image>
      <url>http://www.mapleprimes.com/images/mapleprimeswhite.jpg</url>
      <title>MaplePrimes - answers and comments on Question, nonnegative integers in an identity</title>
      <link>http://www.mapleprimes.com/questions/41110-Nonnegative-Integers-In-An-Identity</link>
    </image>
    <item>
      <title>nonnegative integers in an identity</title>
      <link>http://www.mapleprimes.com/questions/41110-Nonnegative-Integers-In-An-Identity?ref=Feed:MaplePrimes:nonnegative integers in an identity:Comments#answer76338</link>
      <itunes:summary>The result of isolve is a good starting point.  Consider the requirements a[j] &gt;= 0 as a set of constraints on the variables _Z1 and _Z2.  Then you could use integer linear programming, 
available in Optimization[LPSolve] with assume=integer.  For example, if S is the result of your isolve, to find the solution that minimizes a[1]:

&lt;pre&gt;
&gt; Optimization[LPSolve](subs(S,a[1]), map(t -&gt; (rhs(t)&gt;=0), S),
    assume=nonnegint);
&lt;/pre&gt;
&lt;maple&gt;[4, [_Z2 = 0, _Z1 = 2]]&lt;/maple&gt; 


</itunes:summary>
      <description>The result of isolve is a good starting point.  Consider the requirements a[j] &gt;= 0 as a set of constraints on the variables _Z1 and _Z2.  Then you could use integer linear programming, 
available in Optimization[LPSolve] with assume=integer.  For example, if S is the result of your isolve, to find the solution that minimizes a[1]:

&lt;pre&gt;
&gt; Optimization[LPSolve](subs(S,a[1]), map(t -&gt; (rhs(t)&gt;=0), S),
    assume=nonnegint);
&lt;/pre&gt;
&lt;maple&gt;[4, [_Z2 = 0, _Z1 = 2]]&lt;/maple&gt; 


</description>
      <guid>76338</guid>
      <pubDate>Fri, 13 Jul 2007 22:55:26 Z</pubDate>
      <itunes:author>Robert Israel</itunes:author>
      <author>Robert Israel</author>
    </item>
  </channel>
</rss>