Results are presented from empirical evaluations of the performance of solution procedures on random binary knapsack and weighted set covering problems in which correlation is induced between the objective function and constraint coefficients. It is concluded that the performance of the solution procedures degrades as the correlation induced among the test problem parameters is increased and that test problems with structured dependence should be used for many empirical evaluations of solution methods.Since structured dependence in discrete optimization test problems is desirable, ways t o characterize the joint distribution of a discrete bivariate random variable for any feasible correlation are needed. The problem of finding a characterization with the maximum value of the smallest probability for any possible point is formulated as a linear program. An efficient algorithm based on the Northwest Corner Rule and a simple probability reallocation scheme is presented and demonstrated on a small example.