Convergence of the bounded fixed charge programming problem

Calculating the solution for a mixed integer linear programming problem has been problematic for any sizable dimension because of the time required. Accordingly, an improved method for the fixed charge problem is presented here. The method is a modification of a bounding technique first suggested by Balinski, and it exploits fully the ratio of costio-use, first described by Cooper and Drebes. It exploits those local properties which have global application so that enumeration is confined to those relatively few combinations which cannot be evaluated otherwise.