We propose an alternative method for computing e¤ectively the solution of the control inventory problem under non-convex polynomial cost functions. We 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. We device computational tools based on convex o...

We propose a general method to determine the theoretical microstructure in one dimensional elastic bars whose internal deformation energy is given by non-convex polynomials. We use non-convex variational principles and Young measure theory to describe the optimal energetic configuration of the body. By using convex analysis and classical characterizations of algebraic moments, we can formulate ...

In this paper, an optimization problem with a linear objective function subject to a consistent finite system of fuzzy relation inequalities using the max-product composition is studied. Since its feasible domain is non-convex, traditional linear programming methods cannot be applied to solve it. We study this problem and capture some special characteristics of its feasible domain and optimal s...