The SAS module SAS\OR has a number of procedures used for optimization of different forms.
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.
The 2025 SAS Hackathon has begun!
It's finally time to hack! Remember to visit the SAS Hacker's Hub regularly for news and updates.