| Article ID: | iaor20118342 |
| Volume: | 7 |
| Issue: | 1 |
| Start Page Number: | 101 |
| End Page Number: | 108 |
| Publication Date: | Jan 2011 |
| Journal: | Pakistan Journal of Statistics and Operation Research |
| Authors: | Ismail Mohd, Nasser Kaynat, Ahmad Qazi |
| Keywords: | programming: linear, programming: multiple criteria, programming: goal |
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.