Control of inventories under non-convex polynomial cost functions

I propose an alternative method for computing effectively the solution of the control inventory problem under non-convex polynomial cost functions. I apply the method of moments in global optimization to transform the corresponding, non-convex dynamic programming problem into an equivalent optimal control problem with linear and convex structure. I device computational tools based on convex optimization, to solve the convex formulation of the original problem.