PARAMETRIC AND DYNAMIC PROGRAMMING IN FOREST FIRE CONTROL MODELS
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
The forest fire control models developed by Parks and Jewell 1 3 assumed one type of suppression force with a particular effectiveness and cost of operations. These models are extended here to the multiple suppression force case. If N types of forces are dispatched to a fire, they will either arrive simultaneously or in a lagged sequence. Choosing the optimal lowest cost of burn plus suppression mix of forces for simultaneous arrival required the use of a linear programming model that is simultaneously parametric in the right- hand sides and in the objective function. For non-simultaneous arrival, a dynamic programming algorithm, that compared pairs of forces, was developed and solved on an IBM 1620 computer. The lowest envelope of cost curves for all such pairs can be used as a planning tool in initial attack.