Chebyshev Approximate Solution to Allocation Problem in Multiple Objective Surveys with Random Costs

摘要

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.