Solving large-scale mixed-integer programs with fixed charge variables

Abstract

We consider large-scale mixed-integer programming problems containing fixed charge variables. In practice such problems are frequently approached by using commercial mathematical programming systems. Depending on the formulation, size and structure of the problem this approach may or may not be successful. We describe algorithms for preprocessing and optimization of such problems and discuss the design of an experimental software system based on MPSX/370. Numerical results for solving some large real life problems are also presented. © 1985 The Mathematical Programming Society, Inc.