The asymptotic value of an m-constraint, n-variable, binary random knapsack is computed for the case of large values of the right-hand sides of the constraints. It is assumed that the problem coefficients are realizations of random variables, m is bounded and n tends to infinity.
