多阶段贝叶斯接受抽样的计算问题

Naval Research Logistics Quarterly Pub Date : 1986-08-01 DOI:10.1002/NAV.3800330306

K. Waldmann

{"title":"多阶段贝叶斯接受抽样的计算问题","authors":"K. Waldmann","doi":"10.1002/NAV.3800330306","DOIUrl":null,"url":null,"abstract":"Simple criteria are found for reducing the computational effort in multistage Bayesian acceptance sampling. Regions of optimality are given for both terminal actions accept and reject. Also, criteria are presented for detecting nonoptimality of sets of sample sizes. Finally, nearly optimal (z,c−,c+)‐sampling plans are constructed by restricting attention to a small subset of sample sizes.","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Computational aspects in multistage Bayesian acceptance sampling\",\"authors\":\"K. Waldmann\",\"doi\":\"10.1002/NAV.3800330306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Simple criteria are found for reducing the computational effort in multistage Bayesian acceptance sampling. Regions of optimality are given for both terminal actions accept and reject. Also, criteria are presented for detecting nonoptimality of sets of sample sizes. Finally, nearly optimal (z,c−,c+)‐sampling plans are constructed by restricting attention to a small subset of sample sizes.\",\"PeriodicalId\":431817,\"journal\":{\"name\":\"Naval Research Logistics Quarterly\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics Quarterly\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/NAV.3800330306\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800330306","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

找到了简化多阶段贝叶斯接受抽样计算量的准则。给出了终端动作接受和拒绝的最优区域。此外，还提出了检测样本大小集合的非最优性的准则。最后，通过将注意力限制在样本量的一个小子集上，构建了近最优(z,c−，c+)‐抽样计划。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computational aspects in multistage Bayesian acceptance sampling

Simple criteria are found for reducing the computational effort in multistage Bayesian acceptance sampling. Regions of optimality are given for both terminal actions accept and reject. Also, criteria are presented for detecting nonoptimality of sets of sample sizes. Finally, nearly optimal (z,c−,c+)‐sampling plans are constructed by restricting attention to a small subset of sample sizes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Naval Research Logistics Quarterly

自引率

0.00%

发文量