A CONVEX PROGRAMMING APPROACH TO THE MULTIPLE CONSTRAINT INVENTORY PROBLEM.
Themis optimization research program,
TEXAS A AND M UNIV COLLEGE STATION DEPT OF INDUSTRIAL ENGINEERING
Pagination or Media Count:
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 andor objective function be differentiable, convex functions. Author
- Operations Research
- Computer Programming and Software