The advent of large-capacity computer systems with remote terminal systems and access to actual manpower and personnel data should increase the use of mathematical programming techniques in dealing with manpower allocation problems. Such problems appear to involve a natural decomposition by specialty, or by groups of specialties, which should lead to computationally feasible problems. Even if a problem is excessively large, a combination of heuristic and formal analysis usually should be able to reduce it to tractable size. In this study a model is presented for solving the "rotation base requirement" problem, which involves specifying the number of military personnel in each grade, Air Force specialty code, and skill level required in the United States to support overseas military requirements. Some generalizations of the rotation situation are described that lead to familiar and pervasive manpower and personnel problems. 14 pp.