MULTIPARTITE OPTIMIZATION.

This paper considers the problem of determining the policy to be followed by each member of a team so as to optimize some over-all criterion function characterizing the objective of the team. The reasoning of dynamic programming is employed to formulate the optimization problem, and the discussion is couched in the terms of a classical network problem. The paper first formulates a simple bipartite network optimization and then presents a number of generalizations. Finally, it gives two slightly different computational solutions to an example bipartite optimization problem. [ABSTRACT FROM AUTHOR]