<?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 Re: Proc Optmodel, Pairwise selection of observations in Mathematical Optimization, Discrete-Event Simulation, and OR</title>
    <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112629#M662</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;STRONG&gt;Rob, This was helpful but has a big limitation when applied to my example. I need to pick up pairs with lowest individual cost (limited number). &lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;This model picks up in such a way that it minimizes the cost for the whole matrix.&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;Is there a way i can select the costs (limited number) such that each individual cost is small out of the whole nXn cost matrix. &lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Like if i am interested in picking up only 10 pairs of the 200, the output should be something like this:&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;TABLE border="0" cellpadding="0" cellspacing="0" style="width: 464px;"&gt;&lt;TBODY&gt;&lt;TR&gt;&lt;TD class="xl68" height="20" width="190"&gt;CA&lt;/TD&gt;&lt;TD class="xl68" style="border-left: medium none;" width="190"&gt;FL&lt;/TD&gt;&lt;TD class="xl69" style="border-left: medium none;" width="84"&gt;&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl67" height="20" style="border-top: medium none;"&gt;prop_val&lt;/TD&gt;&lt;TD class="xl67" style="border-top: medium none; border-left: medium none;"&gt;prop_val&lt;/TD&gt;&lt;TD class="xl70" style="border-left: medium none;"&gt;Error&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;40491.01228&lt;/TD&gt;&lt;TD class="xl71"&gt;40627.76096&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;136.7486725&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;74185.43779&lt;/TD&gt;&lt;TD class="xl71"&gt;74439.91526&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;254.4774759&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;52112.67672&lt;/TD&gt;&lt;TD class="xl71"&gt;51757.37807&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;355.2986575&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;92344.59878&lt;/TD&gt;&lt;TD class="xl71"&gt;92861.84872&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;517.2499386&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;149438.711&lt;/TD&gt;&lt;TD class="xl71"&gt;150428.7754&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;990.064358&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;161100.0464&lt;/TD&gt;&lt;TD class="xl71"&gt;162322.5791&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;1222.532687&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;45977.42362&lt;/TD&gt;&lt;TD class="xl71"&gt;44745.24589&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;1232.177735&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;52993.13839&lt;/TD&gt;&lt;TD class="xl71"&gt;54359.262&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;1366.123614&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="21"&gt;108280.265&lt;/TD&gt;&lt;TD class="xl71"&gt;113204.0449&lt;/TD&gt;&lt;TD class="xl66" style="border-top: medium none;"&gt;4923.7799&lt;/TD&gt;&lt;/TR&gt;&lt;/TBODY&gt;&lt;/TABLE&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The solution from Proc optmodel LP solver was not trying to give me the minimum error values since it was trying to balance total cost (i mean minimize)&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Thu, 26 Jul 2012 23:12:40 GMT</pubDate>
    <dc:creator>khchaitanya</dc:creator>
    <dc:date>2012-07-26T23:12:40Z</dc:date>
    <item>
      <title>Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112625#M658</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Hi there,&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; I have an optimization problem where i need to select the observations in pairwise based on certain criteria. The problem is discussed in-detail as shown below:&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;for suppose we have following data:&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;property_code&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&amp;nbsp;&amp;nbsp; state&amp;nbsp;&amp;nbsp;&amp;nbsp; value&lt;/SPAN&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;53012&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; CA&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 500000&amp;nbsp; &lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;98432&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; FL&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 200000&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;32763&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; GA&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 300000&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;34534&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; CA&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 198000 &lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;12432&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; FL&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 650000&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;65851&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; MN&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 200000&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;85563&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; FL&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 499000&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;54632&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; CA&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 645000 &lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;65726&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; UT&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 100000&amp;nbsp;&amp;nbsp; &lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Using the optimization technique we have to select pair-wise records from above data, one property from CA and one property from FL such that the difference in their respective values is almost the same or below certain tolerance.&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;For suppose we want to take 2 pairs out of above data:&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Optimizer has to output:&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;property_code&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&amp;nbsp;&amp;nbsp; state&amp;nbsp;&amp;nbsp;&amp;nbsp; value&lt;/SPAN&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;53012&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; CA&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 500000&amp;nbsp; &lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;85563&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; FL&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 499000&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;34534&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; CA&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 198000 &lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;98432&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; FL&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; 200000&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;i.e It selected one from CA worth 500000 and then selected a near one from FL worth 499000, and similarly it pulled second pair as shown above. &lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Can anybody let me know how to put this as a constraint or a objective function.&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Thank you for you help in advance!&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 19 Jul 2012 20:04:49 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112625#M658</guid>
      <dc:creator>khchaitanya</dc:creator>
      <dc:date>2012-07-19T20:04:49Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112626#M659</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;STRONG&gt;I was able to select 2 records from each state using the state flag indicator. But could not do pair-selection such that the difference in the property values is min or within threshold.&lt;/STRONG&gt; &lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 20 Jul 2012 15:09:10 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112626#M659</guid>
      <dc:creator>khchaitanya</dc:creator>
      <dc:date>2012-07-20T15:09:10Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112627#M660</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;For a given pair of states, your problem can be formulated as a linear assignment problem, where the cost of assigning record i from one state to record j from the other state is the absolute difference of the property values.&amp;nbsp; See the following usage note for how to solve a linear assignment problem using the LP solver in SAS/OR:&lt;/P&gt;&lt;P&gt;&lt;A href="http://support.sas.com/kb/35/026.html"&gt;http://support.sas.com/kb/35/026.html&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;In SAS/OR 12.1, which will be released next month, there is also a linear assignment problem algorithm available in the new OPTNET procedure.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Note that without your threshold constraint, if there are n records for each of the two states, then just sorting the values for each state and matching them up in that order is optimal.&amp;nbsp; This property does not hold in general, but for your absolute difference cost, it is easy to show that any other matching will have higher cost.&amp;nbsp; (If two values are out of order, interchanging them will improve the cost.)&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 24 Jul 2012 13:19:27 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112627#M660</guid>
      <dc:creator>RobPratt</dc:creator>
      <dc:date>2012-07-24T13:19:27Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112628#M661</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;STRONG&gt;Thank you Rob, It worked. Thank you very much &lt;img id="smileyhappy" class="emoticon emoticon-smileyhappy" src="https://communities.sas.com/i/smilies/16x16_smiley-happy.png" alt="Smiley Happy" title="Smiley Happy" /&gt;!&lt;/STRONG&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 24 Jul 2012 22:12:51 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112628#M661</guid>
      <dc:creator>khchaitanya</dc:creator>
      <dc:date>2012-07-24T22:12:51Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112629#M662</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;STRONG&gt;Rob, This was helpful but has a big limitation when applied to my example. I need to pick up pairs with lowest individual cost (limited number). &lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;This model picks up in such a way that it minimizes the cost for the whole matrix.&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;Is there a way i can select the costs (limited number) such that each individual cost is small out of the whole nXn cost matrix. &lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;Like if i am interested in picking up only 10 pairs of the 200, the output should be something like this:&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-family: comic sans ms,sans-serif;"&gt;&lt;STRONG&gt;&lt;BR /&gt;&lt;/STRONG&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;TABLE border="0" cellpadding="0" cellspacing="0" style="width: 464px;"&gt;&lt;TBODY&gt;&lt;TR&gt;&lt;TD class="xl68" height="20" width="190"&gt;CA&lt;/TD&gt;&lt;TD class="xl68" style="border-left: medium none;" width="190"&gt;FL&lt;/TD&gt;&lt;TD class="xl69" style="border-left: medium none;" width="84"&gt;&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl67" height="20" style="border-top: medium none;"&gt;prop_val&lt;/TD&gt;&lt;TD class="xl67" style="border-top: medium none; border-left: medium none;"&gt;prop_val&lt;/TD&gt;&lt;TD class="xl70" style="border-left: medium none;"&gt;Error&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;40491.01228&lt;/TD&gt;&lt;TD class="xl71"&gt;40627.76096&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;136.7486725&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;74185.43779&lt;/TD&gt;&lt;TD class="xl71"&gt;74439.91526&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;254.4774759&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;52112.67672&lt;/TD&gt;&lt;TD class="xl71"&gt;51757.37807&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;355.2986575&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;92344.59878&lt;/TD&gt;&lt;TD class="xl71"&gt;92861.84872&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;517.2499386&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;149438.711&lt;/TD&gt;&lt;TD class="xl71"&gt;150428.7754&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;990.064358&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;161100.0464&lt;/TD&gt;&lt;TD class="xl71"&gt;162322.5791&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;1222.532687&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;45977.42362&lt;/TD&gt;&lt;TD class="xl71"&gt;44745.24589&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;1232.177735&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="20"&gt;52993.13839&lt;/TD&gt;&lt;TD class="xl71"&gt;54359.262&lt;/TD&gt;&lt;TD class="xl65" style="border-top: medium none;"&gt;1366.123614&lt;/TD&gt;&lt;/TR&gt;&lt;TR&gt;&lt;TD class="xl71" height="21"&gt;108280.265&lt;/TD&gt;&lt;TD class="xl71"&gt;113204.0449&lt;/TD&gt;&lt;TD class="xl66" style="border-top: medium none;"&gt;4923.7799&lt;/TD&gt;&lt;/TR&gt;&lt;/TBODY&gt;&lt;/TABLE&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The solution from Proc optmodel LP solver was not trying to give me the minimum error values since it was trying to balance total cost (i mean minimize)&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 26 Jul 2012 23:12:40 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112629#M662</guid>
      <dc:creator>khchaitanya</dc:creator>
      <dc:date>2012-07-26T23:12:40Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112630#M663</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;For your "cardinality-constrained" assignment problem, you can modify both sets of = 1 constraints to &amp;lt;= 1 and then include a new constraint that forces the desired number of assignments:&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; con cardinality: sum{i in NSET, j in NSET} x[i,j] = 10;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;In that case, you should also declare x as binary and use the MILP solver.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 27 Jul 2012 14:35:27 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112630#M663</guid>
      <dc:creator>RobPratt</dc:creator>
      <dc:date>2012-07-27T14:35:27Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Optmodel, Pairwise selection of observations</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112631#M664</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;STRONG&gt;That's simply awesome!&amp;nbsp; I owe you a treat &lt;img id="smileyhappy" class="emoticon emoticon-smileyhappy" src="https://communities.sas.com/i/smilies/16x16_smiley-happy.png" alt="Smiley Happy" title="Smiley Happy" /&gt;. Thank you very much Rob. Have a nice day!&lt;/STRONG&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Fri, 27 Jul 2012 15:37:42 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Proc-Optmodel-Pairwise-selection-of-observations/m-p/112631#M664</guid>
      <dc:creator>khchaitanya</dc:creator>
      <dc:date>2012-07-27T15:37:42Z</dc:date>
    </item>
  </channel>
</rss>

