A CONVEX PROGRAMMING APPROACH TO THE MULTIPLE CONSTRAINT INVENTORY PROBLEM
作者:
L. R. LAMBERSON,
期刊:
International Journal of Production Research
(Taylor Available online 1967)
卷期:
Volume 6,
issue 4
页码: 313-327
ISSN:0020-7543
年代: 1967
DOI:10.1080/00207546708929790
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
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 non-linear constraints and/or objective function be differentiable, convex functions.
点击下载:
PDF (330KB)
返 回