상세 보기
초록
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 optimal solution allows us to develop a dynamic programming algorithm. A problem example is solved to illustrate the algorithm. © 1987 Elsevier Science Publishers B.V. (North-Holland).
키워드
dynamic programming; Inventory; planning
- 제목
- A dynamic quantity discount lot size model with resales
- 저자
- Sohn, Kwon-ik; Hwang, Hark C.
- 발행일
- 1987
- 유형
- Article
- 권
- 28
- 호
- 3
- 페이지
- 293 ~ 297