Optimal allocation of Pacific Fleet patrol aircraft among selected deployment sites.

Abstract

A methodology is developed which determines the optimal allocation of patrol forces among selected deployment sites. The procedure uses a linear programming algorithm which minimizes a linear cost function, subject to restraining equations representing the total hours available, the relationship between on-station and transit hours, and base loading . A computer program is presented which translates input data into the format required by the IBM Mathematical Programming System/360 for the problem solution. The methodology can be utilized to determine the allocation of forces among selected bases, reallocation of forces when a base or bases must be removed from consideration, and the effect of utilizing additional bases.