- Thread starter
- #1

I was wondering if you might have some insight into a problem, where we consider an optimization problem:

max ∑ from j=1 to n of f

x

where B is a positive integer and f

I am trying to formulate a solution using dynamic programming and to figure out the time complexity of this method.

Im a bit confused about the dynamic programming approach, how would you implement it for a function such as f

kind regards

max ∑ from j=1 to n of f

_{j}(x_{j}) such that ∑ to n of xj <=Bx

_{j}>=0, integerswhere B is a positive integer and f

_{j}is real to realI am trying to formulate a solution using dynamic programming and to figure out the time complexity of this method.

Im a bit confused about the dynamic programming approach, how would you implement it for a function such as f

_{1}(x)=sqrt(x) if n=5 and B=10kind regards

Last edited: