Sufficient conditions for optimality of a \((z,c^ -,c^ +)\)-sampling plan in multistage Bayesian acceptance sampling (Q1091730): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3954702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects in multistage bayesian acceptance sampling / rank
 
Normal rank

Revision as of 09:47, 18 June 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for optimality of a \((z,c^ -,c^ +)\)-sampling plan in multistage Bayesian acceptance sampling
scientific article

    Statements

    Sufficient conditions for optimality of a \((z,c^ -,c^ +)\)-sampling plan in multistage Bayesian acceptance sampling (English)
    0 references
    0 references
    1987
    0 references
    This paper provides a general framework for designing a multistage acceptance sampling plan so as to minimize the Bayesian expected total cost of handling the noninspected part of the lot. It is proved that, under certain intuitive conditions, the sampling plan \((z,c^-,c^+)\) is optimal. The structure of this plan is also discussed.
    0 references
    lot acceptance
    0 references
    minimal expected cost
    0 references
    optimal sampling plan
    0 references
    multistage acceptance sampling plan
    0 references
    Bayesian expected total cost
    0 references

    Identifiers