Abstract

Warner (1965) introduced the randomized response model as an alternative survey technique for socially undesirable or incriminating behaviour questions in order to reduce response error, protect a respondent’s privacy, and increase response rates. In multivariate stratified surveys with multiple randomised response data the choice of optimum sample sizes from various strata may be viewed as a multi-objective nonlinear programming problem. The allocation thus obtained may be called a “compromise allocation” in sampling literature. In this paper, we have formulated two stage stratified Warner’s Randomised Response model ( RRM ) as a multi-objective integer non-liner optimization problem. In this problem of RRM we have minimized the square root of coefficient of variations instead of variations for different characteristics because the coefficient of variation is unit free, subject to the linear and quadratic cost constraint. The multi-objective optimization problem of RRM has been solved by lexicographic goal programming integrated with fixed priority - distance method. The solution obtained by lexicographic goal programming Integrated with fixed priority - distance have been compared with various existing approaches namely the value function approach, goal programming techniques, - constraint method and distance-based method and Khuri & Cornel distance based method. A numerical example is also been presented to illustrate the computational details. https://doi.org/10.28919/jmcs/3376

Highlights

  • In a questionnaire survey, if a question is highly sensitive or personal, the person may refuse to answer or may give evasive answer

  • We have formulated two stage stratified Warner’s Randomised Response model (RRM) as a multiobjective integer non-liner optimization problem. In this problem of RRM we have minimized the square root of coefficient of variations instead of variations for different characteristics because the coefficient of variation is unit free, subject to the linear and quadratic cost constraint

  • The multi-objective optimization problem of RRM has been solved by lexicographic goal programming integrated with fixed priority D1 - distance method

Read more

Summary

Introduction

If a question is highly sensitive or personal, the person may refuse to answer or may give evasive answer. Sufficient information about a variable is not available, or it is difficult to decide most important characteristic of the survey In such situations, the distance-based technique is very useful see Steuer [1986] and Rios [1989]. A lexicographic goal programming integrated with fixed priority D1 - distances method is suggested for obtaining compromise allocation for multiple characteristics Warner’s randomized response model. This problem is solved by various existing methods namely - the value function approach, goal programming techniques, - constraint method, distancebased method and Khuri & Cornel distance based method. A numerical example is presented to illustrate the computational details for all methods

Formulation of the problem
Pi 1 2M i 1 Pi 2
Goal Programming
Lexicographic Goal Programming
D1 Distance Algorithm
Comparisons of Optimum allocation
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call