<?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: How to solve Bellman optimisation problem in SAS? in SAS Procedures</title>
    <link>https://communities.sas.com/t5/SAS-Procedures/How-to-solve-Bellman-optimisation-problem-in-SAS/m-p/451134#M69738</link>
    <description>&lt;P&gt;The SAS module SAS\OR has a number of procedures used for optimization of different forms.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I'm too lazy to look up what ever a Bellman Recursion Problem may be. Please post a reference. The OPTNET procedure documentation mentions that a Bellman-Ford algorithm is implemented for a shortest path problem with weighted link values.&lt;/P&gt;</description>
    <pubDate>Wed, 04 Apr 2018 15:00:11 GMT</pubDate>
    <dc:creator>ballardw</dc:creator>
    <dc:date>2018-04-04T15:00:11Z</dc:date>
    <item>
      <title>How to solve Bellman optimisation problem in SAS?</title>
      <link>https://communities.sas.com/t5/SAS-Procedures/How-to-solve-Bellman-optimisation-problem-in-SAS/m-p/450989#M69731</link>
      <description>&lt;P&gt;Hi all&lt;/P&gt;&lt;P&gt;Is there any well known SAS Procedure to solve Bellman Recursion Problem?&lt;/P&gt;&lt;P&gt;Also, can you suggest some SAS procedures which in generally is used for solving Optimisation Problem?&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;</description>
      <pubDate>Wed, 04 Apr 2018 10:08:14 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-Procedures/How-to-solve-Bellman-optimisation-problem-in-SAS/m-p/450989#M69731</guid>
      <dc:creator>Koushik1729</dc:creator>
      <dc:date>2018-04-04T10:08:14Z</dc:date>
    </item>
    <item>
      <title>Re: How to solve Bellman optimisation problem in SAS?</title>
      <link>https://communities.sas.com/t5/SAS-Procedures/How-to-solve-Bellman-optimisation-problem-in-SAS/m-p/451134#M69738</link>
      <description>&lt;P&gt;The SAS module SAS\OR has a number of procedures used for optimization of different forms.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I'm too lazy to look up what ever a Bellman Recursion Problem may be. Please post a reference. The OPTNET procedure documentation mentions that a Bellman-Ford algorithm is implemented for a shortest path problem with weighted link values.&lt;/P&gt;</description>
      <pubDate>Wed, 04 Apr 2018 15:00:11 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-Procedures/How-to-solve-Bellman-optimisation-problem-in-SAS/m-p/451134#M69738</guid>
      <dc:creator>ballardw</dc:creator>
      <dc:date>2018-04-04T15:00:11Z</dc:date>
    </item>
  </channel>
</rss>

