# Tons of nodes in the Policy Graph, SDDP.jl package

**URL:** <https://discourse.julialang.org/t/tons-of-nodes-in-the-policy-graph-sddp-jl-package/103426>\
**Category:** Optimization (Mathematical)\
**Tags:** question, gurobi\
**Created:** [August 31, 2023, 9:11pm UTC](https://discourse.julialang.org/t/tons-of-nodes-in-the-policy-graph-sddp-jl-package/103426 "2023-08-31T21:11:53Z")\
**Posts on this page:** 1\
**Page:** 2

<div class="post-metadata">

**Author:** ![odow](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/odow/32/28685_2.png) [@odow](https://discourse.julialang.org/u/odow)\
**Post date:** [November 8, 2023, 1:33am UTC](https://discourse.julialang.org/t/tons-of-nodes-in-the-policy-graph-sddp-jl-package/103426/21 "2023-11-08T01:33:24Z")

</div>

So the “simulation” column has values on O(10^10). You can think of the mean of values in this column as an upper bound. (It’s not exactly, but near enough).

The “bound” column is a true lower bound. it has values O(10^8).

That means you are very far away from optimality, and that you need many, many more iterations.

[Previous page](https://discourse.julialang.org/t/tons-of-nodes-in-the-policy-graph-sddp-jl-package/103426.md?page=1)