<?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 Equivalent objective functions? in Mathematical Optimization, Discrete-Event Simulation, and OR</title>
    <link>https://communities.sas.com/t5/Mathematical-Optimization/Equivalent-objective-functions/m-p/169253#M864</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;BR /&gt;Is Minimize &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑[x(i)+y(i)] the exact equivalent of &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑x(i)+&lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑&lt;/SPAN&gt;y(i) for a LPP?&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-size: 11pt; font-family: 'Calibri','sans-serif';"&gt;Some time back, I read somewhere that the formulation &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑x(i)+&lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑&lt;/SPAN&gt;y(i) is more effective than &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑[x(i)+y(i)] because we are minimizing each section of the objective function separately. Same for maximizaton.&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-size: 11pt; font-family: 'Calibri','sans-serif';"&gt;Is this correct? Can it be mathematically proved if this is correct or incorrect?&lt;/SPAN&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Sat, 14 Feb 2015 08:13:24 GMT</pubDate>
    <dc:creator>abhik_giri</dc:creator>
    <dc:date>2015-02-14T08:13:24Z</dc:date>
    <item>
      <title>Equivalent objective functions?</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Equivalent-objective-functions/m-p/169253#M864</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;BR /&gt;Is Minimize &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑[x(i)+y(i)] the exact equivalent of &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑x(i)+&lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑&lt;/SPAN&gt;y(i) for a LPP?&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-size: 11pt; font-family: 'Calibri','sans-serif';"&gt;Some time back, I read somewhere that the formulation &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑x(i)+&lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑&lt;/SPAN&gt;y(i) is more effective than &lt;SPAN style="font-family: 'Calibri','sans-serif'; font-size: 11pt;"&gt;∑[x(i)+y(i)] because we are minimizing each section of the objective function separately. Same for maximizaton.&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/SPAN&gt;&lt;/P&gt;&lt;P&gt;&lt;SPAN style="font-size: 11pt; font-family: 'Calibri','sans-serif';"&gt;Is this correct? Can it be mathematically proved if this is correct or incorrect?&lt;/SPAN&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 14 Feb 2015 08:13:24 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Equivalent-objective-functions/m-p/169253#M864</guid>
      <dc:creator>abhik_giri</dc:creator>
      <dc:date>2015-02-14T08:13:24Z</dc:date>
    </item>
    <item>
      <title>Re: Equivalent objective functions?</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Equivalent-objective-functions/m-p/169254#M865</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Yes, they are equivalent, and neither one is more efficient than the other.&amp;nbsp; In both cases, the LP solver sees a single vector of objective coefficients and optimizes the x and y parts simultaneously.&amp;nbsp; The variable names do not influence the solver, which internally considers all problems as having one set of variables indexed from 0 to n - 1.&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Sat, 14 Feb 2015 16:27:57 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Equivalent-objective-functions/m-p/169254#M865</guid>
      <dc:creator>RobPratt</dc:creator>
      <dc:date>2015-02-14T16:27:57Z</dc:date>
    </item>
  </channel>
</rss>

