Premium
An Efficient Zero‐One Formulation of the Multilevel Lot‐Sizing Problem
Author(s) -
McKnew Mark A.,
Saydam Cem,
Coleman B. Jay
Publication year - 1991
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1991.tb00347.x
Subject(s) - sizing , mathematical optimization , reduction (mathematics) , integer programming , computer science , linear programming , zero (linguistics) , statement (logic) , problem statement , work (physics) , cutting stock problem , integer (computer science) , optimization problem , mathematics , management science , engineering , mechanical engineering , art , linguistics , philosophy , geometry , political science , law , visual arts , programming language
This 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.