In this paper, we formulate the multivariate allocation problem as a multi-objective convex programming problem. The objective functions are convex and there is a single linear constraint with some upper and lower bounds. We also consider a two dimensional multivariate problem when the cost is minimized. A numerical example is given to illustrate the solution procedure.

No abstract

In this paper the multivariate allocation problem with upper limits on the available costs for various characters is considered. This problem is formulated as a separable programming problem and then solving it by separable programming approach. A numerical illustration is also given.