Authors: Ronald L Rardin V E Unger
Publish Date: 1976/12/01
Volume: 10, Issue: 1, Pages: 379-400
Abstract
Among the most commonly occurring mixedinteger problems in operations research are linear programs with fixed charge objective functions In this paper special structures of the equivalent form of such problems obtained from optimal solutions to their continuous relaxations are characterized and exploited in a series of penalty procedures for branchandbound type algorithms The selection construction and solution of such penalty problems are discussed and computational experience with the procedures is presented
Keywords: