Two Line Sampling Plans: A Path-Counting Problem

Bikas K. Sinha and Günter Weiss
Additional contact information
Bikas K. Sinha: Indian Statistical Institute
Günter Weiss: University of Winnipeg

A chapter in Computing Science and Statistics, 1992, pp 524-528 from Springer

Abstract: Abstract Statistical sampling plans are represented by a lattice of points. We consider all finite closed plans in which the set of Boundary points lie on two straight lines. Each path on the lattice from the origin to one of the points in the Boundary set represents one possible sample. We must therefore count the number of paths for each of the different two-line plans.

Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2856-1_92

Ordering information: This item can be ordered from
http://www.springer.com/9781461228561

DOI: 10.1007/978-1-4612-2856-1_92

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().