Journals / Hacettepe Journal of Mathematics and Statistics / 2026 / Volume: 44 Issue: 1

An optimal controlled selection procedure for sample coordination problem using linear programming and distance function

Pages
—
Publication Date
2015-02-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Some examples have been considered to demonstrate the utility of the proposed procedure in comparison to the existing procedures.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:A number of procedures have been developed for maximizing and minimizing the overlap of sampling units in different/repeated surveys.
📊
Key Findings & Data:The concepts of controlled selection, transportation theory and controlled rounding have been used to solve the sample co-ordination problem.
💡
Conclusion & Impact:Some examples have been considered to demonstrate the utility of the proposed procedure in comparison to the existing procedures.
🔬Design:Survey & Empirical Study
📍Scope:Comprehensive Sample
⚙️Variables:Controlled Sampling · Distance Function · Sample Coordination

Abstract

A number of procedures have been developed for maximizing and minimizing the overlap of sampling units in different/repeated surveys. The concepts of controlled selection, transportation theory and controlled rounding have been used to solve the sample co-ordination problem. In this article, we proposed a procedure for sample co-ordination problem using linear programming with the concept of distance function that facilitates variance estimation using the Horvitz-Thompson estimator. The proposed procedure can be applied to any two-sample surveys having identical universe and stratification. Some examples have been considered to demonstrate the utility of the proposed procedure in comparison to the existing procedures.

🔖

Cite This Article

Tiwari, N., Chilwal, A. (2015). An optimal controlled selection procedure for sample coordination problem using linear programming and distance function. Hacettepe Journal of Mathematics and Statistics, Volume: 44 Issue: 1. https://ajindex.com/articles/1403338

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...