SOLUTION OF A MULTIVARIATE STRATIFIED SAMPLING PROBLEM THROUGH CHEBYSHEV GOAL PROGRAMMING

Mohd. Vaseem Ismail, Kaynat Nasser, Qazi Shoeb Ahmad

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.


Full Text:

PDF


DOI: http://dx.doi.org/10.18187/pjsor.v7i1.172

Refbacks

  • There are currently no refbacks.




Copyright (c)

Title

SOLUTION OF A MULTIVARIATE STRATIFIED SAMPLING PROBLEM THROUGH CHEBYSHEV GOAL PROGRAMMING

Keywords


Description

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.


Date

2010-12-30

Identifier


Source

Pakistan Journal of Statistics and Operation Research; Vol 7. No. 1, Jan 2011



Print ISSN: 1816-2711 | Electronic ISSN: 2220-5810