Technical Note—An Improved Computational Procedure for Optimal Allocation of Aircraft Sorties

This note presents a revision to the OPTSA model for optimal allocation of aircraft sorties that shortens its running time. The new procedure uses the fact that not all payoff entries of a game matrix need be known to determine the game solution, and that the computer time spent in simplex operations is insignificant compared to the time spent computing payoff entries. Estimates of the computational savings are given. When the procedure was implemented in a three-stage behavioral game, computational savings of up to 95% over the original model were observed.