An Algorithm for Infinite Horizon Lot Sizing with Deterministic Demand

• 作者: Milan Hornia?ek
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: NATURAL ASSET FINANCIAL VALUE NEURAL NETWORK
• 年，卷（期）: 2014,（2）
• 页码范围: 217-225
• 页数: 9页
• 分类号: O1

摘要

We analyze an infinite horizon discrete time inventory model with deterministic but non-stationary demand for a single product at a single stage. There is a finite cycle of vectors of characteristics of the environment (demand, fixed ordering cost, variable procurement cost, holding cost) which is repeated after a finite number of periods. Future cost is discounted. In general, minimization of the sum of discounted total cost over the cycle does not give the minimum of the sum of discounted total cost over the infinite horizon. We construct an algorithm for computing of an optimal strategy over the infinite horizon. It is based on a forward in time dynamic programming recursion.