We present and prove a proposition which defines a recurrence relation for computing, a priori, multipliers that are valid for any set partitioning problem. We further use the relation to establish a constructive method for estimating the size of set partitioning problem that can be completely aggregated on a given computer. The size largely depends on the number of rows of the problem. We also present some computational results.