Rehabilitation and Maintenance System: State Optimal Fund Allocation- Program I (239-4)

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 approximabley 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.