Exact and Approximating Solutions to the Success Runs Problem,
Abstract
A method for calculating the exact risk for the success runs problem is explained and nomographs from which the minimum test size may be determined, with an upper bound on the Type 1 error, are included in the paper. An approximate and an exact solution were used in development of the nomographs, both of which are explained. Some discussion is included concerning the appropriate method for problems not solvable by the nomographs. Algorithms for both the approximate and exact solutions were written. The latter was generalized to provide an automated solution to the success runs problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1968
- Accession Number
- AD0738946
Entities
People
- Billy G. Murphy
Organizations
- United States Army Materiel Command