Optimal Sorting in Industrial Operations

A theorem is developed which reduces to manageable proportions a linear programming problem of potentially infinite size. A converging iterative procedure is presented for estimating the parameters to be used in combining the activities of the original large problem. The theorem and iterative procedure are applicable to the general problem of sorting material in industrial processes, whether the material to be sorted consists of peas, pine logs, or poultry products.