A Convex Programming Approach to the Multiple Constraint Inventory Problem

摘要

The calculation of economic lot sizes with more than one constraint on the system is a recognized problem in inventory control theory. This paper presents a simplex like solution procedure. The algorithm as presented can be readily adapted to other constraints which may arise in a specific application. The essential conditions for application are that the nonlinear constraints and/or objective function be differentiable, convex functions. (Author)