khan, Mohammed Faisal and Ali, Irfan and Ahmad, Qazi Shoeb (2011) Chebyshev Approximate Solution to Allocation Problem in Multiple Objective Surveys with Random Costs. American Journal of Computational Mathematics, 01 (04). pp. 247-251. ISSN 2161-1203
![[thumbnail of AJCM20110400007_93283726.pdf]](http://research.manuscritpub.com/style/images/fileicons/text.png)
AJCM20110400007_93283726.pdf - Published Version
Download (198kB)
Abstract
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.
Item Type: | Article |
---|---|
Subjects: | Science Repository > Mathematical Science |
Depositing User: | Managing Editor |
Date Deposited: | 23 Jun 2023 04:36 |
Last Modified: | 16 Oct 2023 03:35 |
URI: | http://research.manuscritpub.com/id/eprint/2503 |