期刊名称：Pakistan Journal of Statistics and Operation Research
印刷版ISSN：2220-5810
出版年度：2011
卷号：7
期号：1
页码：101-108
DOI：10.1234/pjsor.v7i1.172
语种：English
出版社：College of Statistical and Actuarial Sciences
摘要：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.
