An Improved, Multiplier Adjustment Procedure for the Segregated Storage Problem

Abstract

The segregated storage problem consists of determining an optimal distribution of products among existing storage compartments such that at most one product may be stored in a given compartment. The problem is solved using linear programming, Lagrangean relaxation and multiplier adjustment techniques. The procedures are easily adapted to obtain good heuristic solutions quickly. Computational results are given.