The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
87 views

Dynamic programming proof

I have aquestion, lets say im trying to maximize: S=∑j=1nfj(xj) subject to ∑j=1nxj≤B, where B∈ℤ+ and fj:ℝ→ℝ. how would i do this using dynamic programming and what would be the states and ...