An Optimal Controlled Selection Procedure for Sample Coordination Problem using Linear Programming and Distance Function | Zendy

Neeraj Tiwari | Zendy; Akhil Chilwal | Zendy

Open Access

An Optimal Controlled Selection Procedure for Sample Coordination Problem using Linear Programming and Distance Function

Author(s) -

Neeraj Tiwari,

Akhil Chilwal

Publication year - 2014

Publication title -

hacettepe journal of mathematics and statistics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.312

H-Index - 26

ISSN - 1303-5010

DOI - 10.15672/hjms.201477458

Subject(s) - mathematics , selection (genetic algorithm) , sample (material) , linear programming , function (biology) , mathematical optimization , statistics , artificial intelligence , computer science , chemistry , chromatography , evolutionary biology , biology

A number of procedures have been developed for maximizing and minimizing the overlap of sampling units in dierent/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. 2000 AMS Classification: 62D05

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research