# Improvement algorithm and its time complexity

#### malamenm

##### New member
Hi, I have a problem with the following problem:

Assume fj is concave and strictly increasing for all j, j=1,..,n. Show that the optimal solution x* satisfies the condition (from j=1 to n) ∑x*j=B.

Now consider the following improvement algorithm: