Postoptimal analysis of a dynamic lot-size Problem with time-varying capacities

• 발행기관: 호서대학교 사회과학연구소
• 저자명: Jae Wook Yoon
• 간행물 정보: 『사회과학연구』제5집 제1호, 361~371쪽, 전체 11쪽
• 주제분류: 사회과학 > 행정학
• 파일형태: PDF
• 발행일자: 1986.12.31

영문 초록

There are a variety of dynamic lot-sizing techniques. Among them, Baker et al developed a branchand-bound algorithm, so called, “tree search procedure”, for a dynamic lot-size problem with timevarying capacities. In this paper, a method to do sensitivity and parametric analysis upon the problem of Baker et al, is presented which is developed by extending the tree search procedure. In particular, procedures are developed for determining ranges on problem parameters for which an optimal solution remains optimal and for exploring new optimal with changes in problem parameters. Keywords:Optimization, Postoptimal analysis.

목차

1. Introduction

2. The tree search procedure

3. Postoptimal Analysis

4. An example

5. Concluding Remarks

References

Abstract