The probability distribution of the optimum (Z) of an integer linear program is discussed in which the elements of the right-hand-side (RHS) are distributed independently. The assumptions of the asymptotic algorithm ofGomory are supposed to hold for each realization of the RHS. This algorithm serves also as the theoretic framework of the present communication. Bounds and approximations for the probability function of Z are derived demanding different levels of numerical efforts. The normal distribution is a satisfactory approximation which is asymptotically correct if the elements of the RHS are uniformly distributed within bounds satisfying some requirements and the number of inequalities approaches infinity.