<?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: Please help: Optimizing strategy in Mathematical Optimization, Discrete-Event Simulation, and OR</title>
    <link>https://communities.sas.com/t5/Mathematical-Optimization/Please-help-Optimizing-strategy/m-p/42061#M349</link>
    <description>The optimal solution for this depends on how important the two objectives are for you.&lt;BR /&gt;
&lt;BR /&gt;
If they are equally important, my guess is that the optimal solution is trivial:&lt;BR /&gt;
&lt;BR /&gt;
"Study all the chapters in some order, then repeat the same order twice."&lt;BR /&gt;
&lt;BR /&gt;
Thinking about it, maybe the order in each iteration does not even matter, depending on how we count "Revise chapter earlier". Some options would be: Sum, Arithmetic mean, median of days between chapter revisions. &lt;BR /&gt;
&lt;BR /&gt;
One could write a MIP model with OPTMODEL, I guess. The constraints are no problem, but the objectives are a little messy, depending on what option above we choose.</description>
    <pubDate>Fri, 09 Jul 2010 12:38:11 GMT</pubDate>
    <dc:creator>Philipp_SAS</dc:creator>
    <dc:date>2010-07-09T12:38:11Z</dc:date>
    <item>
      <title>Please help: Optimizing strategy</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Please-help-Optimizing-strategy/m-p/42060#M348</link>
      <description>Hi everyone,&lt;BR /&gt;
                    It is an unusual question, I dont know if this is the right forum.&lt;BR /&gt;
&lt;BR /&gt;
                   I need to study 16 chapers, one chapter a day. My strategy is to revise 3 times. Hence I have 48 days.&lt;BR /&gt;
&lt;BR /&gt;
   How can I optimize my schedule to achieve following:&lt;BR /&gt;
&lt;BR /&gt;
   1&amp;gt; Revise a chapter sooner to retain more&lt;BR /&gt;
   2&amp;gt;  Complete the entire 16 chapters the first time as fast as possible&lt;BR /&gt;
&lt;BR /&gt;
        I appreciate all your help.&lt;BR /&gt;
&lt;BR /&gt;
Regards,&lt;BR /&gt;
&lt;BR /&gt;
Amit</description>
      <pubDate>Tue, 29 Jun 2010 18:04:06 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Please-help-Optimizing-strategy/m-p/42060#M348</guid>
      <dc:creator>AmitKB</dc:creator>
      <dc:date>2010-06-29T18:04:06Z</dc:date>
    </item>
    <item>
      <title>Re: Please help: Optimizing strategy</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Please-help-Optimizing-strategy/m-p/42061#M349</link>
      <description>The optimal solution for this depends on how important the two objectives are for you.&lt;BR /&gt;
&lt;BR /&gt;
If they are equally important, my guess is that the optimal solution is trivial:&lt;BR /&gt;
&lt;BR /&gt;
"Study all the chapters in some order, then repeat the same order twice."&lt;BR /&gt;
&lt;BR /&gt;
Thinking about it, maybe the order in each iteration does not even matter, depending on how we count "Revise chapter earlier". Some options would be: Sum, Arithmetic mean, median of days between chapter revisions. &lt;BR /&gt;
&lt;BR /&gt;
One could write a MIP model with OPTMODEL, I guess. The constraints are no problem, but the objectives are a little messy, depending on what option above we choose.</description>
      <pubDate>Fri, 09 Jul 2010 12:38:11 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Please-help-Optimizing-strategy/m-p/42061#M349</guid>
      <dc:creator>Philipp_SAS</dc:creator>
      <dc:date>2010-07-09T12:38:11Z</dc:date>
    </item>
  </channel>
</rss>

