Rehabilitation and Maintenance System: State Optimal Fund Allocation, Program I (RAMS-SOFA-1)
-
1981-02-01
-
Details
-
Creators:
-
Corporate Creators:
-
Corporate Contributors:
-
Subject/TRT Terms:
-
Publication/ Report Number:
-
Resource Type:
-
Geographical Coverage:
-
Edition:Interim: September, 1978 - February, 1981
-
Corporate Publisher:
-
Abstract:The State Optimal Fund Allocation problem is presented. The problem is modeled as a Nonlinear Knapsack Problem, and the solution methodology uses the concepts of dynamic programming techniques. An example problem with five Highway Districts is formulated and solved using a computer program developed for that purpose. There are 11, 12, 17, 14, and 15 different budget levels for Districts 1, 2, 3, 4, and 5 respectively. The problem was solved in approximately 0.21 seconds of execution time on the AMDAHL 470V/6 computer at Texas A&M University. It was concluded that the proposed mathematical model and the solution algorithm is a simple, but powerful tool in solving the State Optimal Fund Allocation Problem.
-
Format:
-
Funding:
-
Collection(s):
-
Main Document Checksum:urn:sha-512:eab61e5d56aab687057b86e24815890da415477071674634d72d8c48f80b178c3c17b697cfa497d62a05c9814032af54b29fc993c764c1dbda4a50a19ae78ef3
-
Download URL:
-
File Type: