This paper discusses the modular-design problem, as set up by David Evans, in which the module is made of several components: there exist Ei of the ith component in each module, and for every application j, D, modules will be needed to satisfy all component requirements. The problem is to design a module (i.e., choose Ē) such that the requirements are satisfied at a minimum cost of surplus components. Mathematically, the problem is: minimizeEi,Dj ∑i=1i=m eiEi ∑j=1j=ndjDj subject to EiDj ≧ Rij; EiDj are positive integers and ei, dj, are constants. The conclusion of the paper is that the two procedures outlined by Evans and by A. Charnes and M. Kirby for the noninteger case cannot be used to find the integer solution. An integer branch-and-bound technique is proposed that has been shown to be useful in the solution of small problems and that has potential use in larger problems.