Optimal Sequential Sampling Plans Using Dynamic Programming Approach

Mohammad Saber Fallah Nezhad, Minoo Momeni, Noushin Noushin Sayani, Fatemeh Akhoondi

Abstract


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. 


Keywords


Sampling Plan; Dynamic Programming; Optimization; Recursive Approach

Full Text:

PDF


DOI: http://dx.doi.org/10.18187/pjsor.v11i4.583

Refbacks

  • There are currently no refbacks.




Copyright (c) 2015 Pakistan Journal of Statistics and Operation Research

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Title

Optimal Sequential Sampling Plans Using Dynamic Programming Approach

Keywords

Sampling Plan; Dynamic Programming; Optimization; Recursive Approach

Description

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. 


Date

2015-12-03

Identifier


Source

Pakistan Journal of Statistics and Operation Research; Vol. 11 No. 4, 2015



Print ISSN: 1816-2711 | Electronic ISSN: 2220-5810