| This research shows how mathematical optimization can be applied to a resource partition problem. The resource partition problem is characterized as the allocation of resources to jobs such that disjoint sets are formed. Further, all resources and jobs are contained in the final solution. The solution to the resource partition problem is approached by decomposing the problem into two many-to-one allocation problems. Whereas the disjointedness characteristic defies classical formulations, the significance of this approach is that existing solution techniques can be employed. This research addresses the solution to one of the many-to-one allocation subproblems. This many-to-one allocation subproblem is formulated as a classical transportion problem. To provide rationale for, and to demonstrate the utility of the general structure of the problem formulation, the resource partition problem is presented in the context of a hypothetical Ballistic Missile Defense system. (Abstract shortened by UMI.)... |
