An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem

Abstract

ABSTRACTThis paper presents a zero‐one linear formulation of the multilevel lot‐sizing problem for materials requirement planning systems without capacity constraints. The model is an efficient statement of the problem and has a structure that is particularly convenient for research work. In addition, it is demonstrated that the relaxed linear programming solution to this formulation will always be integer. The results of a rather large computational history are reported along with a variable reduction methodology that allows for the solution of reasonably sized research problems.