On the fixed charge transportation problem

Abstract

The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.