  In this paper we introduce the Ameso optimization problem, a special class of
discrete optimization problems. We establish its basic properties and
investigate the relation between Ameso optimization and the convex
optimization. Further, we design an algorithm to solve a multi-dimensional
Ameso problem by solving a sequence of one-dimensional Ameso problems. Finally,
we demonstrate how the knapsack problem can be solved using the Ameso
optimization framework.
