Abstract : The paper deals with the solution by decomposition to a discrete optimization problem. A criterion for ranking the decomposition procedures is developed and properties of the optimal decompositions are discussed. An algorithm for finding the best decomposition in the case of no storage limitation is given. (Author)