The program iteration method, which is inseparably associated with the name of A. G. Chentsov, first appeared in the study of the so-called zero-sum differential games. At early stages, only one of the two possible dual iterative procedures was considered — the maximin procedure. This can be explained by the special interest of the researchers in the so-called program maximin function, which is conveniently interpreted in geometric terms in games of pursuit. Nevertheless, the dual minimax iterative procedure is of no less interest. The program iteration method is mainly significant because it may be used as the basis for the development of a differential game theory in a closed compact form, which was shown earlier for a version of the method based on a certain modification of iterative operators. The key role in this theory belongs to the theorem that states the existence and uniqueness of a solution of the equation induced by a pair of such operators. In this case, the maximin iterative procedure is used to describe ε-optimal (in some cases, optimal) positional strategies of the first player, while the minimax procedure is used to describe ε-optimal (in some cases, optimal) positional strategies of the second player. This paper investigates the structure of the solution set of the generalized Bellman-Isaacs equation obtained with the use of historically first (not modified) operators of the program iteration method. A theorem that states the existence and uniqueness of the solution to this equation meeting a natural boundary condition is proved under certain assumptions. Thus, it is shown that the original version of the program iteration method can also be used in designing a closed-form differential game theory. However, here we use the so-called recursive strategies rather than positional ones. Such strategies, together with the program iteration method, play an essential role in the analysis of coalition-free differential games.