期刊名称：Pakistan Journal of Statistics and Operation Research
印刷版ISSN：2220-5810
出版年度：2015
卷号：11
期号：4
页码：575-586
DOI：10.18187/pjsor.v11i4.583
语种：English
出版社：College of Statistical and Actuarial Sciences
摘要：In this paper we proposed a dynamic programming procedure to develop an optimal sequential sampling plan. A suitable cost model is employed for depicting the cost of sampling, accepting or rejecting the lot. This model is based on sequential approach. A sequential iterative approach is used for modeling the cost of different decisions in each stage. In addition a backward recursive algorithm is developed that can be adapted to a computer program. At the end of this paper a numerical example is solved to show how this model works.
其他摘要：In this paper we proposed a dynamic programming procedure to develop an optimal sequential sampling plan. A suitable cost model is employed for depicting the cost of sampling, accepting or rejecting the lot. This model is based on sequential approach. A sequential iterative approach is used for modeling the cost of different decisions in each stage. In addition a backward recursive algorithm is developed that can be adapted to a computer program. At the end of this paper a numerical example is solved to show how this model works.
