An Approximate Algorithm for Discrete Linear Programming

An algorithm is presented for determining an approximate solution of a large class of discrete linear programming problems, and an upper bound on the profit loss due to the approximation is computed. A subregion of the original polyhedron of feasible solutions is also defined; such a subregion certainly contains the optimal solution of the discrete linear programming problem considered. A geometrical interpretation of the algorithm is given.