A cutting plane algorithm for the fixed charge problem

Abstract

An algorithm is devised for solving the fixed charge problem with linear constraints. The algorithm employs especially constructed cuts to locate the global optimum point. Computational results are included.