GENERALIZED-MODEL FOR SOLVING CONSTRAINED BOTTLENECKS

This article demonstrates how geometric programming can be used to sol ve an industrial bottleneck with an unlimited number of products and m ultiple constraints. It shows how the basic constrained economic order quantity (EOQ) model can be expanded to solve two forms of the constr aint. Then an algorithm is developed to solve most multiply constraine d bottlenecks. The model is diagrammed, formulated, and programmed. It is then tested against a case example to demonstrate its effectivenes s.