Main Article Content


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

Author Biography

Qazi Shoeb Ahmad, Integral University, Lucknow (INDIA)


Assistant Professor (Senior Scale)

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.