Main Article Content
Abstract
In this paper, we consider the problem of minimizing the variances for the various characters with fixed (given) budget. Each convex objective function is first linearised at its minimal point where it meets the linear cost constraint. The resulting multiobjective linear programming problem is then solved by Chebyshev goal programming. A numerical example is given to illustrate the procedure.
Article Details
Authors who publish with this journal agree to the following License
CC BY: This license allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, so long as attribution is given to the creator. The license allows for commercial use.
How to Cite
Ismail, M. V., Nasser, K., & Ahmad, Q. S. (2010). SOLUTION OF A MULTIVARIATE STRATIFIED SAMPLING PROBLEM THROUGH CHEBYSHEV GOAL PROGRAMMING. Pakistan Journal of Statistics and Operation Research, 7(1), 101-108. https://doi.org/10.18187/pjsor.v7i1.172