<?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 IIS Option in Mathematical Optimization, Discrete-Event Simulation, and OR</title>
    <link>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94885#M622</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi There,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Am trying to solve an MILP using proc opt, which I know is infeasible. To know the source of this structural infeasibility, am calling out IIS=ON option and then print "constraint.status". However, this lists one IIS at a time. I fix it and run IIS again; it comes up with another IIS. My problem has multiple IIS and I want to list all of them at one go, so I can make changes accordingly How can I list all the IIS at once? Any idea / experience anyone?&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;-Thanks,&lt;/P&gt;&lt;P&gt;-Mike&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Tue, 04 Jun 2013 15:50:02 GMT</pubDate>
    <dc:creator>MikeCarter</dc:creator>
    <dc:date>2013-06-04T15:50:02Z</dc:date>
    <item>
      <title>IIS Option</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94885#M622</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi There,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Am trying to solve an MILP using proc opt, which I know is infeasible. To know the source of this structural infeasibility, am calling out IIS=ON option and then print "constraint.status". However, this lists one IIS at a time. I fix it and run IIS again; it comes up with another IIS. My problem has multiple IIS and I want to list all of them at one go, so I can make changes accordingly How can I list all the IIS at once? Any idea / experience anyone?&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;-Thanks,&lt;/P&gt;&lt;P&gt;-Mike&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 04 Jun 2013 15:50:02 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94885#M622</guid>
      <dc:creator>MikeCarter</dc:creator>
      <dc:date>2013-06-04T15:50:02Z</dc:date>
    </item>
    <item>
      <title>Re: IIS Option</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94886#M623</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;There are two things you can try:&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;First, if the constraints all come from the same declaration, i.e.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;con DontDoIt{i in SETI}: ...&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;then you can try relaxing all of the DontDoIt constraints.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Second, a little bit more work, but probably closer to what you want, you could put the solve statement in a loop and keep track of the constraints removed at each step until the problem is feasible.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Combining &lt;A href="http://support.sas.com/documentation/cdl/en/ormpug/65554/HTML/default/viewer.htm#ormpug_lpsolver_examples04.htm" title="http://support.sas.com/documentation/cdl/en/ormpug/65554/HTML/default/viewer.htm#ormpug_lpsolver_examples04.htm"&gt;this IIS example&lt;/A&gt; with &lt;A href="http://support.sas.com/documentation/cdl/en/ormpug/65554/HTML/default/viewer.htm#ormpug_optmodel_sect110.htm" title="http://support.sas.com/documentation/cdl/en/ormpug/65554/HTML/default/viewer.htm#ormpug_optmodel_sect110.htm"&gt;the information about problem symbols:&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;proc optmodel presolver=none;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; /* declare variables */&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; var x{1..3} &amp;gt;=0;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; &lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; /* upper bound on variable x[3] */&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; x[3].ub = 3;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; &lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; /* objective function */&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; min obj = x[1] + x[2] + x[3];&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; &lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; /* constraints */&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; con c1: x[1] + x[2] &amp;gt;= 10;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; con c2: x[1] + x[3] &amp;lt;= 4;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; con c3: 4 &amp;lt;= x[2] + x[3] &amp;lt;= 5;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; &lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; num iteration init 1;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; set IIS{1 .. iteration} init {};&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; do while (1);&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; solve with lp / iis = on;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; IIS[iteration] = {ci in 1 .. _NCON_: _CON_[ci].status ~= ''};&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; if card(IIS[iteration]) = 0 then leave;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; for {ci in IIS[iteration]: _CON_[ci].status = 'I_L'} &lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; _CON_[ci].lb = -constant('big');&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; for {ci in IIS[iteration]: _CON_[ci].status = 'I_U'} &lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; _CON_[ci].ub = constant('big');&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; iteration = iteration + 1;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; end;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; iteration = iteration - 1;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp; for {ii in 1 .. iteration}&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; put IIS[ii]=;&lt;/P&gt;&lt;P&gt;quit;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Wed, 05 Jun 2013 03:22:56 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94886#M623</guid>
      <dc:creator>LeoLopes</dc:creator>
      <dc:date>2013-06-05T03:22:56Z</dc:date>
    </item>
    <item>
      <title>Re: IIS Option</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94887#M624</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Thanks Leo. This gives me some direction to think.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Thank you very much. Shall try the second approach.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Wed, 05 Jun 2013 14:15:37 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94887#M624</guid>
      <dc:creator>MikeCarter</dc:creator>
      <dc:date>2013-06-05T14:15:37Z</dc:date>
    </item>
    <item>
      <title>Re: IIS Option</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94888#M625</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;You're welcome!&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 06 Jun 2013 01:19:15 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/IIS-Option/m-p/94888#M625</guid>
      <dc:creator>LeoLopes</dc:creator>
      <dc:date>2013-06-06T01:19:15Z</dc:date>
    </item>
  </channel>
</rss>

