期刊名称：American Journal of Computational Mathematics
印刷版ISSN：2161-1203
电子版ISSN：2161-1211
出版年度：2011
卷号：1
期号：4
页码：247-251
DOI：10.4236/ajcm.2011.14029
出版社：Scientific Research Publishing
摘要：In this paper, we consider an allocation problem in multivariate surveys as a convex programming problem with non-linear objective functions and a single stochastic cost constraint. The stochastic constraint is converted into an equivalent deterministic one by using chance constrained programming. The resulting multi-objective convex programming problem is then solved by Chebyshev approximation technique. A numerical example is presented to illustrate the computational procedure.
