A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
β Scribed by Hsin-Der Chen; Donald W. Hearn; Chung-Yee Lee
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Weight
- 830 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper considers the dynamic linear programming model for multispecies livestock farming with a feed production subsystem. The problem is to determine the optimal livestock mix with the projected growth rate and corresponding development of feed production in order to obtain the maximum profit
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w
This paper deals with a dynamic lot size problem in which the unit purchasing price depends on the quantity of an order and resale of the excess is possible at the end of each period. We assume an all units discount system with a single price break point. Investigation of the properties of an optima