The problem is now in the standard form for linear programming problems: an objective function that is to be maximized, subject to a number of constraints. We go on to examine solution methods.

This paper presents a simple numerical algorithm for the solution of programming problems in which some or all of the variables can take only discrete values. The algorithm requires no special ...