<?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 Dual Solution of Large Marketing Optimization Problems using PROC NLP in Mathematical Optimization, Discrete-Event Simulation, and OR</title>
    <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63289#M1289</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;PROC NLP is not under active development, It belongs to legacy procs. Please try the new NLP algorithms (Interior Point or Active Set) through PROC OPTMODEL. You can find more information about new NLP algorithms &amp;amp; OPTMODEL here&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="http://support.sas.com/documentation/cdl/en/ormpug/63975/HTML/default/viewer.htm#nlpsolver_toc.htm"&gt;http://support.sas.com/documentation/cdl/en/ormpug/63975/HTML/default/viewer.htm#nlpsolver_toc.htm&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;thanks,&lt;/P&gt;&lt;P&gt;Yan&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Tue, 27 Sep 2011 17:41:39 GMT</pubDate>
    <dc:creator>YanXu</dc:creator>
    <dc:date>2011-09-27T17:41:39Z</dc:date>
    <item>
      <title>Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63284#M1284</link>
      <description>For about five years, I have employed PROC NLP to solve large marketing optimization problems via a collapsed dual method.  The results have been remarkable.  For a general description of the approach, see &lt;A href="http://home.comcast.net/~raagnew/Downloads/Dual_Solution_Marketing_Optimization.pdf" target="_blank"&gt;http://home.comcast.net/~raagnew/Downloads/Dual_Solution_Marketing_Optimization.pdf&lt;/A&gt;.</description>
      <pubDate>Thu, 27 Nov 2008 04:35:37 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63284#M1284</guid>
      <dc:creator>RAAgnew</dc:creator>
      <dc:date>2008-11-27T04:35:37Z</dc:date>
    </item>
    <item>
      <title>Re: Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63285#M1285</link>
      <description>This is a reasonable approach to try for this type of problem, and it could work well for the types of constraints you describe. However, we have found that as the constraints become more complex, this approach often does not work, and additional techniques are needed. In particular, it is often the case that the constraints per prospect are not of the form "a prospect can receive at most one offer", but rather are more complicated -- such as at most three offers in total, at most one email per week, at most two credit card offers, etc. Furthermore, the quantity constraints for each offer are typically more generic and could represent any business constraint: budgets per offer, lower bounds on expected number of responses, upper bounds on some type of risk measure, ratio of two measures (for example, ROI -- defined as total profit divided by total cost -- must be at least 20%), etc.&lt;BR /&gt;
&lt;BR /&gt;
With these complications, which often appear in combination, the approach described can run into issues. The nonlinear programming algorithm might not converge well enough due to nondifferentiability, and finding a primal solution from the dual solution is no longer as simple as it is in this case, and the process becomes highly sensitive to the accuracy of the dual solution. Therefore, in building an algorithm for a general direct marketing problem, other techniques are required, such as those used by the commercial vendors mentioned in the paper.</description>
      <pubDate>Mon, 22 Dec 2008 20:02:02 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63285#M1285</guid>
      <dc:creator>MichelleOpp</dc:creator>
      <dc:date>2008-12-22T20:02:02Z</dc:date>
    </item>
    <item>
      <title>Re: Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63286#M1286</link>
      <description>My write-up is purposely simplified.  I have used this approach with more general constraints like you mention, including &amp;lt;= k offers per prospect where k &amp;gt; 1.  My approach does have some math overhead in terms of deriving the appropriate dual problem and changing SAS code accordingly.  This is not a big deal, but it is of course unnecessary with commercial optimizers like SAS Marketing Optimization.  On the other hand, PROC NLP is available to any SAS/OR subscriber.</description>
      <pubDate>Thu, 25 Dec 2008 17:26:40 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63286#M1286</guid>
      <dc:creator>RAAgnew</dc:creator>
      <dc:date>2008-12-25T17:26:40Z</dc:date>
    </item>
    <item>
      <title>Re: Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63287#M1287</link>
      <description>For some reason, some of the text in my reply was deleted.  Here is another attempt.  My write-up is purposely simplified. I have used this approach with more general constraints like you mention, including that a prospect may receive at most k offers where k is greater than one.  My approach does have some math overhead in terms of deriving the appropriate dual problem and changing SAS code accordingly. This is not a big deal, but it is of course unnecessary with commercial optimizers like SAS Marketing Optimization. On the other hand, PROC NLP is available to any SAS/OR subscriber.</description>
      <pubDate>Thu, 25 Dec 2008 17:31:44 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63287#M1287</guid>
      <dc:creator>RAAgnew</dc:creator>
      <dc:date>2008-12-25T17:31:44Z</dc:date>
    </item>
    <item>
      <title>Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63288#M1288</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;&lt;SPAN&gt;As a post-script, I now have a Marketing Optimization R-Script which solves my demo problem in about a minute on my home PC. &lt;/SPAN&gt;&lt;A class="jive-link-external-small" href="http://home.comcast.net/~raagnew/Downloads/mktg_opt.R"&gt;http://home.comcast.net/~raagnew/Downloads/mktg_opt.R&lt;/A&gt;&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Mon, 05 Sep 2011 16:52:34 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63288#M1288</guid>
      <dc:creator>RAAgnew</dc:creator>
      <dc:date>2011-09-05T16:52:34Z</dc:date>
    </item>
    <item>
      <title>Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63289#M1289</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;PROC NLP is not under active development, It belongs to legacy procs. Please try the new NLP algorithms (Interior Point or Active Set) through PROC OPTMODEL. You can find more information about new NLP algorithms &amp;amp; OPTMODEL here&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="http://support.sas.com/documentation/cdl/en/ormpug/63975/HTML/default/viewer.htm#nlpsolver_toc.htm"&gt;http://support.sas.com/documentation/cdl/en/ormpug/63975/HTML/default/viewer.htm#nlpsolver_toc.htm&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;thanks,&lt;/P&gt;&lt;P&gt;Yan&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Tue, 27 Sep 2011 17:41:39 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/63289#M1289</guid>
      <dc:creator>YanXu</dc:creator>
      <dc:date>2011-09-27T17:41:39Z</dc:date>
    </item>
    <item>
      <title>Re: Dual Solution of Large Marketing Optimization Problems using PROC NLP</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/236492#M1290</link>
      <description>&lt;P&gt;Updated website &amp;nbsp;&lt;A href="http://www.raagnew.com" target="_blank"&gt;www.raagnew.com&lt;/A&gt;&lt;/P&gt;</description>
      <pubDate>Wed, 25 Nov 2015 20:21:55 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Dual-Solution-of-Large-Marketing-Optimization-Problems-using/m-p/236492#M1290</guid>
      <dc:creator>RAAgnew</dc:creator>
      <dc:date>2015-11-25T20:21:55Z</dc:date>
    </item>
  </channel>
</rss>

