AN INVESTIGATION OF SOLUTIONS TO ALLOCATION PROBLEMS
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
This paper considers the allocation problem in general through the development of theorems giving necessary conditions for a given vector or function to be a solution. These conditions in many cases enable one to deduce the solution. The paper is presented in two parts. The first addresses the problem of maximizing a sum of n functions over an N-dimensional simplex. The second is concerned with the maximization of the Lebesgue integral of a functional over a class of integrable non-negative functions with common L1 norm.
- Operations Research